Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729100371.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 ASLink-PT-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729100371
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K 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.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 921K 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 ASLink-PT-06b-LTLCardinality-00
FORMULA_NAME ASLink-PT-06b-LTLCardinality-01
FORMULA_NAME ASLink-PT-06b-LTLCardinality-02
FORMULA_NAME ASLink-PT-06b-LTLCardinality-03
FORMULA_NAME ASLink-PT-06b-LTLCardinality-04
FORMULA_NAME ASLink-PT-06b-LTLCardinality-05
FORMULA_NAME ASLink-PT-06b-LTLCardinality-06
FORMULA_NAME ASLink-PT-06b-LTLCardinality-07
FORMULA_NAME ASLink-PT-06b-LTLCardinality-08
FORMULA_NAME ASLink-PT-06b-LTLCardinality-09
FORMULA_NAME ASLink-PT-06b-LTLCardinality-10
FORMULA_NAME ASLink-PT-06b-LTLCardinality-11
FORMULA_NAME ASLink-PT-06b-LTLCardinality-12
FORMULA_NAME ASLink-PT-06b-LTLCardinality-13
FORMULA_NAME ASLink-PT-06b-LTLCardinality-14
FORMULA_NAME ASLink-PT-06b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748590765106

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 07:39:26] [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-05-30 07:39:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 07:39:26] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2025-05-30 07:39:26] [INFO ] Transformed 2826 places.
[2025-05-30 07:39:26] [INFO ] Transformed 3513 transitions.
[2025-05-30 07:39:26] [INFO ] Found NUPN structural information;
[2025-05-30 07:39:26] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 337 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ASLink-PT-06b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 2826 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Discarding 173 places :
Symmetric choice reduction at 0 with 173 rule applications. Total rules 173 place count 2653 transition count 3340
Iterating global reduction 0 with 173 rules applied. Total rules applied 346 place count 2653 transition count 3340
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 347 place count 2653 transition count 3339
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 415 place count 2585 transition count 3233
Iterating global reduction 1 with 68 rules applied. Total rules applied 483 place count 2585 transition count 3233
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 504 place count 2585 transition count 3212
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 513 place count 2576 transition count 3203
Iterating global reduction 2 with 9 rules applied. Total rules applied 522 place count 2576 transition count 3203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 525 place count 2573 transition count 3193
Iterating global reduction 2 with 3 rules applied. Total rules applied 528 place count 2573 transition count 3193
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 530 place count 2571 transition count 3191
Iterating global reduction 2 with 2 rules applied. Total rules applied 532 place count 2571 transition count 3191
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 534 place count 2569 transition count 3182
Iterating global reduction 2 with 2 rules applied. Total rules applied 536 place count 2569 transition count 3182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 537 place count 2568 transition count 3174
Iterating global reduction 2 with 1 rules applied. Total rules applied 538 place count 2568 transition count 3174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 539 place count 2567 transition count 3173
Iterating global reduction 2 with 1 rules applied. Total rules applied 540 place count 2567 transition count 3173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 541 place count 2566 transition count 3165
Iterating global reduction 2 with 1 rules applied. Total rules applied 542 place count 2566 transition count 3165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 543 place count 2565 transition count 3157
Iterating global reduction 2 with 1 rules applied. Total rules applied 544 place count 2565 transition count 3157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 545 place count 2564 transition count 3156
Iterating global reduction 2 with 1 rules applied. Total rules applied 546 place count 2564 transition count 3156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 547 place count 2563 transition count 3148
Iterating global reduction 2 with 1 rules applied. Total rules applied 548 place count 2563 transition count 3148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 549 place count 2562 transition count 3140
Iterating global reduction 2 with 1 rules applied. Total rules applied 550 place count 2562 transition count 3140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 551 place count 2561 transition count 3139
Iterating global reduction 2 with 1 rules applied. Total rules applied 552 place count 2561 transition count 3139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 553 place count 2560 transition count 3131
Iterating global reduction 2 with 1 rules applied. Total rules applied 554 place count 2560 transition count 3131
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 555 place count 2559 transition count 3123
Iterating global reduction 2 with 1 rules applied. Total rules applied 556 place count 2559 transition count 3123
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 557 place count 2558 transition count 3122
Iterating global reduction 2 with 1 rules applied. Total rules applied 558 place count 2558 transition count 3122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 559 place count 2557 transition count 3114
Iterating global reduction 2 with 1 rules applied. Total rules applied 560 place count 2557 transition count 3114
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 561 place count 2556 transition count 3106
Iterating global reduction 2 with 1 rules applied. Total rules applied 562 place count 2556 transition count 3106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 563 place count 2555 transition count 3105
Iterating global reduction 2 with 1 rules applied. Total rules applied 564 place count 2555 transition count 3105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 565 place count 2554 transition count 3097
Iterating global reduction 2 with 1 rules applied. Total rules applied 566 place count 2554 transition count 3097
Applied a total of 566 rules in 4632 ms. Remains 2554 /2826 variables (removed 272) and now considering 3097/3513 (removed 416) transitions.
// Phase 1: matrix 3097 rows 2554 cols
[2025-05-30 07:39:31] [INFO ] Computed 277 invariants in 221 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:39:33] [INFO ] Implicit Places using invariants in 2265 ms returned [2388, 2399, 2410, 2418, 2426, 2434, 2442, 2453, 2461, 2469, 2480]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 2307 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2543/2826 places, 3097/3513 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2530 transition count 3084
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2530 transition count 3084
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 2519 transition count 3073
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 2519 transition count 3073
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 2510 transition count 3064
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 2510 transition count 3064
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 2506 transition count 3060
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 2506 transition count 3060
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 2504 transition count 3058
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 2504 transition count 3058
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 2502 transition count 3056
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 2502 transition count 3056
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 2500 transition count 3054
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 2500 transition count 3054
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 2498 transition count 3052
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 2498 transition count 3052
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 2497 transition count 3051
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 2497 transition count 3051
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 2496 transition count 3050
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 2496 transition count 3050
Applied a total of 94 rules in 1818 ms. Remains 2496 /2543 variables (removed 47) and now considering 3050/3097 (removed 47) transitions.
// Phase 1: matrix 3050 rows 2496 cols
[2025-05-30 07:39:35] [INFO ] Computed 266 invariants in 103 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:39:37] [INFO ] Implicit Places using invariants in 1554 ms returned []
[2025-05-30 07:39:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:39:44] [INFO ] Implicit Places using invariants and state equation in 6885 ms returned []
Implicit Place search using SMT with State Equation took 8442 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2496/2826 places, 3050/3513 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17215 ms. Remains : 2496/2826 places, 3050/3513 transitions.
Support contains 29 out of 2496 places after structural reductions.
[2025-05-30 07:39:44] [INFO ] Flatten gal took : 199 ms
[2025-05-30 07:39:44] [INFO ] Flatten gal took : 124 ms
[2025-05-30 07:39:44] [INFO ] Input system was already deterministic with 3050 transitions.
RANDOM walk for 40000 steps (70 resets) in 1119 ms. (35 steps per ms) remains 5/15 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 202 ms. (197 steps per ms) remains 5/5 properties
[2025-05-30 07:39:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 97/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 580/687 variables, 58/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/687 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1710/2397 variables, 192/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2397 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 99/2496 variables, 10/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2496 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 3050/5546 variables, 2496/2762 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5546 variables, 0/2762 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/5546 variables, 0/2762 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5546/5546 variables, and 2762 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2652 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 202/202 constraints, State Equation: 2496/2496 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 97/107 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 580/687 variables, 58/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:39:48] [INFO ] Deduced a trap composed of 108 places in 100 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:39:48] [INFO ] Deduced a trap composed of 111 places in 79 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/687 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/687 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1710/2397 variables, 192/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:39:49] [INFO ] Deduced a trap composed of 39 places in 554 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:39:50] [INFO ] Deduced a trap composed of 42 places in 336 ms of which 40 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2397 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2397 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 99/2496 variables, 10/270 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2496 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3050/5546 variables, 2496/2766 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5546 variables, 5/2771 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5546/5546 variables, and 2771 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 202/202 constraints, State Equation: 2496/2496 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7720ms problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 2496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2496/2496 places, 3050/3050 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 460 transitions
Trivial Post-agglo rules discarded 460 transitions
Performed 460 trivial Post agglomeration. Transition count delta: 460
Iterating post reduction 0 with 460 rules applied. Total rules applied 460 place count 2496 transition count 2590
Reduce places removed 460 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 463 rules applied. Total rules applied 923 place count 2036 transition count 2587
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 927 place count 2034 transition count 2585
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 929 place count 2032 transition count 2585
Performed 667 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 667 Pre rules applied. Total rules applied 929 place count 2032 transition count 1918
Deduced a syphon composed of 667 places in 3 ms
Ensure Unique test removed 61 places
Reduce places removed 728 places and 0 transitions.
Iterating global reduction 4 with 1395 rules applied. Total rules applied 2324 place count 1304 transition count 1918
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 4 with 46 rules applied. Total rules applied 2370 place count 1296 transition count 1880
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 40 rules applied. Total rules applied 2410 place count 1258 transition count 1878
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2412 place count 1256 transition count 1878
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 24 Pre rules applied. Total rules applied 2412 place count 1256 transition count 1854
Deduced a syphon composed of 24 places in 3 ms
Ensure Unique test removed 24 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 72 rules applied. Total rules applied 2484 place count 1208 transition count 1854
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 23 Pre rules applied. Total rules applied 2484 place count 1208 transition count 1831
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 2530 place count 1185 transition count 1831
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2532 place count 1183 transition count 1822
Iterating global reduction 7 with 2 rules applied. Total rules applied 2534 place count 1183 transition count 1822
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2535 place count 1182 transition count 1814
Iterating global reduction 7 with 1 rules applied. Total rules applied 2536 place count 1182 transition count 1814
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2537 place count 1181 transition count 1806
Iterating global reduction 7 with 1 rules applied. Total rules applied 2538 place count 1181 transition count 1806
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2539 place count 1180 transition count 1798
Iterating global reduction 7 with 1 rules applied. Total rules applied 2540 place count 1180 transition count 1798
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 7 with 402 rules applied. Total rules applied 2942 place count 978 transition count 1598
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2946 place count 974 transition count 1594
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 2951 place count 973 transition count 1594
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 2952 place count 973 transition count 1593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2953 place count 972 transition count 1593
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 2953 place count 972 transition count 1592
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2955 place count 971 transition count 1592
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2957 place count 969 transition count 1590
Iterating global reduction 9 with 2 rules applied. Total rules applied 2959 place count 969 transition count 1590
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 2961 place count 969 transition count 1588
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2962 place count 968 transition count 1588
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2964 place count 967 transition count 1593
Free-agglomeration rule applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 2971 place count 967 transition count 1586
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 2978 place count 960 transition count 1586
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 12 with 5 rules applied. Total rules applied 2983 place count 960 transition count 1581
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2988 place count 955 transition count 1581
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 13 with 6 rules applied. Total rules applied 2994 place count 955 transition count 1581
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2995 place count 954 transition count 1580
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 13 with 14 rules applied. Total rules applied 3009 place count 944 transition count 1576
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 3013 place count 940 transition count 1576
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 14 Pre rules applied. Total rules applied 3013 place count 940 transition count 1562
Deduced a syphon composed of 14 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 15 with 29 rules applied. Total rules applied 3042 place count 925 transition count 1562
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 15 with 7 rules applied. Total rules applied 3049 place count 918 transition count 1562
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 3049 place count 918 transition count 1561
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 3051 place count 917 transition count 1561
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 16 with 26 rules applied. Total rules applied 3077 place count 904 transition count 1548
Discarding 6 places :
Symmetric choice reduction at 16 with 6 rule applications. Total rules 3083 place count 898 transition count 1542
Iterating global reduction 16 with 6 rules applied. Total rules applied 3089 place count 898 transition count 1542
Free-agglomeration rule applied 6 times.
Iterating global reduction 16 with 6 rules applied. Total rules applied 3095 place count 898 transition count 1536
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 3101 place count 892 transition count 1536
Applied a total of 3101 rules in 1010 ms. Remains 892 /2496 variables (removed 1604) and now considering 1536/3050 (removed 1514) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1010 ms. Remains : 892/2496 places, 1536/3050 transitions.
RANDOM walk for 40000 steps (427 resets) in 396 ms. (100 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (62 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (52 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (60 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (62 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (61 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 245484 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 5
Probabilistic random walk after 245484 steps, saw 50588 distinct states, run finished after 3005 ms. (steps per millisecond=81 ) properties seen :0
// Phase 1: matrix 1536 rows 892 cols
[2025-05-30 07:39:57] [INFO ] Computed 152 invariants in 13 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 70/80 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 24/124 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/126 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 346/472 variables, 46/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 66/538 variables, 15/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 3/541 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 216/757 variables, 40/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/757 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 16/773 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/773 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/774 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/774 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 104/878 variables, 19/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/878 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 1/879 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/879 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 13/892 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/892 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 1536/2428 variables, 892/1044 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2428 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 0/2428 variables, 0/1044 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2428/2428 variables, and 1044 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1403 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 109/109 constraints, State Equation: 892/892 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 70/80 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 20/100 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 24/124 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/126 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 346/472 variables, 46/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/472 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 66/538 variables, 15/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/538 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 3/541 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/541 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 216/757 variables, 40/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/757 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 16/773 variables, 6/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/773 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/774 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/774 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 104/878 variables, 19/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/878 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 1/879 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/879 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 13/892 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/892 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 1536/2428 variables, 892/1044 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2428 variables, 5/1049 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2428 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 0/2428 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2428/2428 variables, and 1049 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3374 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 109/109 constraints, State Equation: 892/892 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4814ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 1 properties in 7584 ms.
Support contains 8 out of 892 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 892/892 places, 1536/1536 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 892 transition count 1535
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 891 transition count 1535
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 891 transition count 1534
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 890 transition count 1534
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 889 transition count 1533
Applied a total of 6 rules in 71 ms. Remains 889 /892 variables (removed 3) and now considering 1533/1536 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 889/892 places, 1533/1536 transitions.
RANDOM walk for 40000 steps (427 resets) in 231 ms. (172 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (61 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (53 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (58 resets) in 54 ms. (727 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (66 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 255985 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 4
Probabilistic random walk after 255985 steps, saw 52742 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
// Phase 1: matrix 1533 rows 889 cols
[2025-05-30 07:40:13] [INFO ] Computed 152 invariants in 19 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 56/64 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 17/81 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 24/105 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/107 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 296/403 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 93/496 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/501 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/501 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 244/745 variables, 46/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/745 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 17/762 variables, 7/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/762 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 1/763 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/763 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 112/875 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/875 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 1/876 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/876 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 13/889 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/889 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1533/2422 variables, 889/1041 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2422 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 0/2422 variables, 0/1041 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2422/2422 variables, and 1041 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 109/109 constraints, State Equation: 889/889 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 56/64 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 17/81 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 24/105 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/107 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/107 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 296/403 variables, 39/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 93/496 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:40:14] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 5/501 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 244/745 variables, 46/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/745 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 17/762 variables, 7/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/762 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 1/763 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/763 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 112/875 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/875 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 1/876 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/876 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 13/889 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/889 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 1533/2422 variables, 889/1042 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2422 variables, 4/1046 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2422 variables, 0/1046 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:40:16] [INFO ] Deduced a trap along path composed of 18 places in 82 ms of which 5 ms to minimize.
At refinement iteration 31 (OVERLAPS) 0/2422 variables, 1/1047 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2422 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 0/2422 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2422/2422 variables, and 1047 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3654 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 109/109 constraints, State Equation: 889/889 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4833ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3555 ms.
Support contains 8 out of 889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 889/889 places, 1533/1533 transitions.
Applied a total of 0 rules in 33 ms. Remains 889 /889 variables (removed 0) and now considering 1533/1533 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 889/889 places, 1533/1533 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 889/889 places, 1533/1533 transitions.
Applied a total of 0 rules in 33 ms. Remains 889 /889 variables (removed 0) and now considering 1533/1533 (removed 0) transitions.
[2025-05-30 07:40:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:40:22] [INFO ] Implicit Places using invariants in 630 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 262, 276, 277, 297, 315, 384, 388, 389, 400, 401, 403, 420, 438, 477, 480, 519, 534, 535, 539, 574, 643, 647, 648, 659, 660, 662, 679, 697, 766, 770, 772, 775, 787, 788, 789, 807, 828, 829, 830, 831]
[2025-05-30 07:40:22] [INFO ] Actually due to overlaps returned [807, 789, 48, 168, 297, 420, 679, 31, 151, 539, 662, 148, 276, 400, 403, 534, 659, 787, 828, 149, 277, 401, 535, 660, 788, 829, 1, 18, 262, 388, 389, 519, 647, 648, 770, 66, 186, 315, 438, 574, 697, 830, 19, 384, 772, 775, 831]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 633 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 842/889 places, 1533/1533 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 839 transition count 1443
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 186 place count 749 transition count 1440
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 186 place count 749 transition count 1409
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 249 place count 717 transition count 1409
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 261 place count 713 transition count 1401
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 269 place count 705 transition count 1401
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 273 place count 701 transition count 1397
Iterating global reduction 4 with 4 rules applied. Total rules applied 277 place count 701 transition count 1397
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 280 place count 701 transition count 1394
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 281 place count 700 transition count 1393
Iterating global reduction 5 with 1 rules applied. Total rules applied 282 place count 700 transition count 1393
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 283 place count 699 transition count 1392
Iterating global reduction 5 with 1 rules applied. Total rules applied 284 place count 699 transition count 1392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 285 place count 699 transition count 1391
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 373 place count 655 transition count 1347
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 376 place count 652 transition count 1344
Iterating global reduction 6 with 3 rules applied. Total rules applied 379 place count 652 transition count 1344
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 382 place count 652 transition count 1341
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 386 place count 650 transition count 1342
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 387 place count 650 transition count 1341
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 403 place count 650 transition count 1325
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 7 with 17 rules applied. Total rules applied 420 place count 633 transition count 1325
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 421 place count 633 transition count 1324
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 438 place count 633 transition count 1324
Applied a total of 438 rules in 313 ms. Remains 633 /842 variables (removed 209) and now considering 1324/1533 (removed 209) transitions.
// Phase 1: matrix 1324 rows 633 cols
[2025-05-30 07:40:22] [INFO ] Computed 96 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:40:23] [INFO ] Implicit Places using invariants in 465 ms returned [73, 89, 95, 98, 100, 101, 104, 105, 174, 180, 183, 185, 189, 196, 197, 254, 274, 280, 283, 285, 290, 291, 355, 358, 366, 372, 375, 377, 380, 387, 388, 446, 466, 474, 480, 485, 486, 539, 555, 561, 564, 566]
[2025-05-30 07:40:23] [INFO ] Actually due to overlaps returned [104, 196, 290, 387, 485, 105, 197, 291, 388, 486, 89, 95, 100, 174, 180, 185, 274, 280, 285, 366, 372, 377, 555, 561, 566, 73, 101, 189, 254, 355, 380, 446, 466, 474, 480, 539]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 468 ms to find 36 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 597/889 places, 1324/1533 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 572 transition count 1299
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 572 transition count 1299
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 57 place count 565 transition count 1292
Iterating global reduction 0 with 7 rules applied. Total rules applied 64 place count 565 transition count 1292
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 563 transition count 1290
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 563 transition count 1290
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 562 transition count 1289
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 562 transition count 1289
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 561 transition count 1288
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 561 transition count 1288
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 90 place count 552 transition count 1279
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 91 place count 552 transition count 1278
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 109 place count 552 transition count 1260
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 127 place count 534 transition count 1260
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 534 transition count 1257
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 133 place count 531 transition count 1257
Applied a total of 133 rules in 163 ms. Remains 531 /597 variables (removed 66) and now considering 1257/1324 (removed 67) transitions.
// Phase 1: matrix 1257 rows 531 cols
[2025-05-30 07:40:23] [INFO ] Computed 60 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:40:23] [INFO ] Implicit Places using invariants in 360 ms returned [307]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 362 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 530/889 places, 1257/1533 transitions.
Applied a total of 0 rules in 20 ms. Remains 530 /530 variables (removed 0) and now considering 1257/1257 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1992 ms. Remains : 530/889 places, 1257/1533 transitions.
RANDOM walk for 40000 steps (529 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (116 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (83 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (109 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (116 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 356628 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :3 out of 4
Probabilistic random walk after 356628 steps, saw 87432 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :3
// Phase 1: matrix 1257 rows 530 cols
[2025-05-30 07:40:26] [INFO ] Computed 59 invariants in 11 ms
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/150 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 185/335 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/340 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 71/411 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/415 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 100/515 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/519 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 11/530 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1257/1787 variables, 530/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1787 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1787 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1787/1787 variables, and 589 constraints, problems are : Problem set: 0 solved, 1 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 530/530 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 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 81/150 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 185/335 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/340 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 71/411 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/415 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 100/515 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/519 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/519 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 11/530 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1257/1787 variables, 530/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1787 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1787 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1787 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1787/1787 variables, and 590 constraints, problems are : Problem set: 0 solved, 1 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 530/530 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1078ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 2 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 1257/1257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 530 transition count 1254
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 525 transition count 1253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 524 transition count 1253
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 10 place count 524 transition count 1249
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 18 place count 520 transition count 1249
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 517 transition count 1246
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 517 transition count 1244
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 516 transition count 1243
Applied a total of 27 rules in 56 ms. Remains 516 /530 variables (removed 14) and now considering 1243/1257 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 516/530 places, 1243/1257 transitions.
RANDOM walk for 40000 steps (598 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (128 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 393520 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 1
Probabilistic random walk after 393520 steps, saw 115324 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
// Phase 1: matrix 1243 rows 516 cols
[2025-05-30 07:40:31] [INFO ] Computed 57 invariants in 16 ms
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/132 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 186/318 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/318 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/322 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 77/399 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/402 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 99/501 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/501 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/505 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/505 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 11/516 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/516 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1243/1759 variables, 516/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1759 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1759 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1759/1759 variables, and 573 constraints, problems are : Problem set: 0 solved, 1 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 516/516 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 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/132 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:40:31] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 186/318 variables, 24/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/322 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 77/399 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/402 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 99/501 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/505 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 11/516 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/516 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1243/1759 variables, 516/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1759 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1759 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1759 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1759/1759 variables, and 575 constraints, problems are : Problem set: 0 solved, 1 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 516/516 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1072ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 2 out of 516 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 1243/1243 transitions.
Applied a total of 0 rules in 17 ms. Remains 516 /516 variables (removed 0) and now considering 1243/1243 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 516/516 places, 1243/1243 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 516/516 places, 1243/1243 transitions.
Applied a total of 0 rules in 17 ms. Remains 516 /516 variables (removed 0) and now considering 1243/1243 (removed 0) transitions.
[2025-05-30 07:40:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:40:32] [INFO ] Implicit Places using invariants in 374 ms returned [140, 156, 162, 306, 307, 329]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 376 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 510/516 places, 1243/1243 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 510 transition count 1238
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 505 transition count 1238
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 499 transition count 1232
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 499 transition count 1229
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 496 transition count 1229
Applied a total of 28 rules in 48 ms. Remains 496 /510 variables (removed 14) and now considering 1229/1243 (removed 14) transitions.
// Phase 1: matrix 1229 rows 496 cols
[2025-05-30 07:40:32] [INFO ] Computed 51 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:40:32] [INFO ] Implicit Places using invariants in 344 ms returned []
[2025-05-30 07:40:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:40:34] [INFO ] Implicit Places using invariants and state equation in 1074 ms returned []
Implicit Place search using SMT with State Equation took 1421 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 496/516 places, 1229/1243 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1862 ms. Remains : 496/516 places, 1229/1243 transitions.
RANDOM walk for 40000 steps (617 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (144 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 404643 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 1
Probabilistic random walk after 404643 steps, saw 119241 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
[2025-05-30 07:40:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/214 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 220/434 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/439 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 57/496 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1229/1725 variables, 496/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1725 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1725 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1725/1725 variables, and 547 constraints, problems are : Problem set: 0 solved, 1 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 496/496 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 120.0 s and query timeout 12000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/214 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:40:37] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 220/434 variables, 26/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/439 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 57/496 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1229/1725 variables, 496/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1725 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1725 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1725 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1725/1725 variables, and 549 constraints, problems are : Problem set: 0 solved, 1 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 917ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 103 ms.
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 1229/1229 transitions.
Applied a total of 0 rules in 15 ms. Remains 496 /496 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 496/496 places, 1229/1229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 1229/1229 transitions.
Applied a total of 0 rules in 16 ms. Remains 496 /496 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
[2025-05-30 07:40:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:40:38] [INFO ] Implicit Places using invariants in 329 ms returned []
[2025-05-30 07:40:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:40:39] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:40:39] [INFO ] Redundant transitions in 90 ms returned []
Running 1196 sub problems to find dead transitions.
[2025-05-30 07:40:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 495/1725 variables, and 45 constraints, problems are : Problem set: 0 solved, 1196 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 37/40 constraints, State Equation: 0/496 constraints, PredecessorRefiner: 1196/1196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 3 (OVERLAPS) 1/496 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/496 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/1725 variables, and 51 constraints, problems are : Problem set: 0 solved, 1196 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/496 constraints, PredecessorRefiner: 0/1196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60481ms problems are : Problem set: 0 solved, 1196 unsolved
Search for dead transitions found 0 dead transitions in 60493ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62009 ms. Remains : 496/496 places, 1229/1229 transitions.
FORMULA ASLink-PT-06b-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 101 stabilizing places and 101 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' '!(F(G(p0)))'
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 3050/3050 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 463 transitions
Trivial Post-agglo rules discarded 463 transitions
Performed 463 trivial Post agglomeration. Transition count delta: 463
Iterating post reduction 0 with 463 rules applied. Total rules applied 463 place count 2495 transition count 2586
Reduce places removed 463 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 466 rules applied. Total rules applied 929 place count 2032 transition count 2583
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 933 place count 2030 transition count 2581
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 935 place count 2028 transition count 2581
Performed 671 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 671 Pre rules applied. Total rules applied 935 place count 2028 transition count 1910
Deduced a syphon composed of 671 places in 3 ms
Ensure Unique test removed 63 places
Reduce places removed 734 places and 0 transitions.
Iterating global reduction 4 with 1405 rules applied. Total rules applied 2340 place count 1294 transition count 1910
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 4 with 46 rules applied. Total rules applied 2386 place count 1288 transition count 1870
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 2426 place count 1248 transition count 1870
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2426 place count 1248 transition count 1846
Deduced a syphon composed of 24 places in 3 ms
Ensure Unique test removed 24 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 2498 place count 1200 transition count 1846
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 23 Pre rules applied. Total rules applied 2498 place count 1200 transition count 1823
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 2544 place count 1177 transition count 1823
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2547 place count 1174 transition count 1813
Iterating global reduction 6 with 3 rules applied. Total rules applied 2550 place count 1174 transition count 1813
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2550 place count 1174 transition count 1812
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2552 place count 1173 transition count 1812
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2553 place count 1172 transition count 1804
Iterating global reduction 6 with 1 rules applied. Total rules applied 2554 place count 1172 transition count 1804
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2555 place count 1171 transition count 1796
Iterating global reduction 6 with 1 rules applied. Total rules applied 2556 place count 1171 transition count 1796
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2557 place count 1170 transition count 1788
Iterating global reduction 6 with 1 rules applied. Total rules applied 2558 place count 1170 transition count 1788
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: 200
Deduced a syphon composed of 200 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 6 with 402 rules applied. Total rules applied 2960 place count 968 transition count 1588
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2964 place count 964 transition count 1584
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2969 place count 963 transition count 1584
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2970 place count 963 transition count 1583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2971 place count 962 transition count 1583
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2971 place count 962 transition count 1582
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2973 place count 961 transition count 1582
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2975 place count 959 transition count 1580
Iterating global reduction 8 with 2 rules applied. Total rules applied 2977 place count 959 transition count 1580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2979 place count 959 transition count 1578
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2980 place count 958 transition count 1578
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2982 place count 957 transition count 1583
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2984 place count 955 transition count 1581
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 10 with 18 rules applied. Total rules applied 3002 place count 943 transition count 1575
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3008 place count 937 transition count 1575
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 18 Pre rules applied. Total rules applied 3008 place count 937 transition count 1557
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 37 rules applied. Total rules applied 3045 place count 918 transition count 1557
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 12 with 13 rules applied. Total rules applied 3058 place count 905 transition count 1557
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3058 place count 905 transition count 1556
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3060 place count 904 transition count 1556
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 13 with 38 rules applied. Total rules applied 3098 place count 885 transition count 1537
Discarding 12 places :
Symmetric choice reduction at 13 with 12 rule applications. Total rules 3110 place count 873 transition count 1525
Iterating global reduction 13 with 12 rules applied. Total rules applied 3122 place count 873 transition count 1525
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 3128 place count 867 transition count 1519
Iterating global reduction 13 with 6 rules applied. Total rules applied 3134 place count 867 transition count 1519
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3140 place count 867 transition count 1513
Applied a total of 3140 rules in 642 ms. Remains 867 /2496 variables (removed 1629) and now considering 1513/3050 (removed 1537) transitions.
// Phase 1: matrix 1513 rows 867 cols
[2025-05-30 07:41:41] [INFO ] Computed 144 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:41:41] [INFO ] Implicit Places using invariants in 602 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 466, 469, 504, 505, 517, 518, 520, 537, 555, 575, 626, 627, 639, 640, 642, 659, 677, 697, 748, 750, 753, 764, 765, 766, 784, 805, 806, 807, 808]
[2025-05-30 07:41:41] [INFO ] Actually due to overlaps returned [784, 766, 48, 167, 289, 411, 537, 659, 31, 147, 150, 269, 272, 391, 394, 517, 520, 639, 642, 764, 805, 148, 270, 392, 518, 640, 765, 806, 1, 18, 256, 257, 378, 379, 504, 505, 626, 627, 748, 807, 19, 66, 86, 137, 185, 205, 307, 327, 429, 449, 555, 575, 677, 697, 750, 753, 808]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 604 ms to find 57 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 810/2496 places, 1513/3050 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 810 transition count 1411
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 204 place count 708 transition count 1411
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 204 place count 708 transition count 1380
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 267 place count 676 transition count 1380
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 279 place count 672 transition count 1372
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 287 place count 664 transition count 1372
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 290 place count 661 transition count 1369
Iterating global reduction 4 with 3 rules applied. Total rules applied 293 place count 661 transition count 1369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 296 place count 661 transition count 1366
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 392 place count 613 transition count 1318
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 396 place count 611 transition count 1319
Applied a total of 396 rules in 89 ms. Remains 611 /810 variables (removed 199) and now considering 1319/1513 (removed 194) transitions.
// Phase 1: matrix 1319 rows 611 cols
[2025-05-30 07:41:41] [INFO ] Computed 82 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:41:42] [INFO ] Implicit Places using invariants in 390 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 343, 346, 354, 360, 365, 442, 448, 453, 530, 536, 541, 608]
[2025-05-30 07:41:42] [INFO ] Actually due to overlaps returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 343, 354, 360, 365, 442, 448, 453, 530, 536, 541, 608]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 393 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 591/2496 places, 1319/3050 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 591 transition count 1318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 590 transition count 1318
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 578 transition count 1306
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 578 transition count 1306
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 38 place count 566 transition count 1294
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 566 transition count 1294
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 560 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 560 transition count 1288
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 74 place count 554 transition count 1282
Applied a total of 74 rules in 79 ms. Remains 554 /591 variables (removed 37) and now considering 1282/1319 (removed 37) transitions.
// Phase 1: matrix 1282 rows 554 cols
[2025-05-30 07:41:42] [INFO ] Computed 62 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:41:42] [INFO ] Implicit Places using invariants in 344 ms returned [318]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 346 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 553/2496 places, 1282/3050 transitions.
Applied a total of 0 rules in 20 ms. Remains 553 /553 variables (removed 0) and now considering 1282/1282 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 2173 ms. Remains : 553/2496 places, 1282/3050 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-00
Product exploration explored 100000 steps with 1145 reset in 409 ms.
Product exploration explored 100000 steps with 1154 reset in 296 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 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 40000 steps (476 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (99 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 409601 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 409601 steps, saw 109038 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
// Phase 1: matrix 1282 rows 553 cols
[2025-05-30 07:41:46] [INFO ] Computed 61 invariants in 19 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 144/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/197 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 268/465 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/493 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/553 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1282/1835 variables, 553/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1835 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1835 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1835/1835 variables, and 614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 443 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 553/553 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 144/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/197 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 268/465 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/493 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/553 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1282/1835 variables, 553/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1835 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1835 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1835 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1835/1835 variables, and 615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 553/553 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1072ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 2 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1282/1282 transitions.
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 553 transition count 1252
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 66 place count 523 transition count 1246
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 1 with 17 rules applied. Total rules applied 83 place count 523 transition count 1229
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 100 place count 506 transition count 1229
Applied a total of 100 rules in 57 ms. Remains 506 /553 variables (removed 47) and now considering 1229/1282 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 506/553 places, 1229/1282 transitions.
RANDOM walk for 40000 steps (611 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (148 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 414472 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 1
Probabilistic random walk after 414472 steps, saw 115974 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
// Phase 1: matrix 1229 rows 506 cols
[2025-05-30 07:41:50] [INFO ] Computed 61 invariants in 14 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/205 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 222/427 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/432 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/506 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1229/1735 variables, 506/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1735 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1735 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1735/1735 variables, and 567 constraints, problems are : Problem set: 0 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 506/506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/205 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 222/427 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/432 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/506 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1229/1735 variables, 506/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1735 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1735 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1735 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1735/1735 variables, and 568 constraints, problems are : Problem set: 0 solved, 1 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 506/506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 960ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 2 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1229/1229 transitions.
Applied a total of 0 rules in 16 ms. Remains 506 /506 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 506/506 places, 1229/1229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1229/1229 transitions.
Applied a total of 0 rules in 16 ms. Remains 506 /506 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
[2025-05-30 07:41:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:41:52] [INFO ] Implicit Places using invariants in 354 ms returned [88, 89, 159, 160, 230, 231, 303, 304, 374, 375]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 355 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 496/506 places, 1229/1229 transitions.
Applied a total of 0 rules in 17 ms. Remains 496 /496 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 388 ms. Remains : 496/506 places, 1229/1229 transitions.
RANDOM walk for 40000 steps (610 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (137 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 428927 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :0 out of 1
Probabilistic random walk after 428927 steps, saw 120112 distinct states, run finished after 3001 ms. (steps per millisecond=142 ) properties seen :0
// Phase 1: matrix 1229 rows 496 cols
[2025-05-30 07:41:55] [INFO ] Computed 51 invariants in 14 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/214 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 220/434 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/439 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 57/496 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1229/1725 variables, 496/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1725 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1725 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1725/1725 variables, and 547 constraints, problems are : Problem set: 0 solved, 1 unsolved in 389 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 496/496 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/214 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 220/434 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/439 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 57/496 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1229/1725 variables, 496/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1725 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1725 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1725 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1725/1725 variables, and 548 constraints, problems are : Problem set: 0 solved, 1 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1040ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 1229/1229 transitions.
Applied a total of 0 rules in 16 ms. Remains 496 /496 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 496/496 places, 1229/1229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 1229/1229 transitions.
Applied a total of 0 rules in 16 ms. Remains 496 /496 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
[2025-05-30 07:41:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:41:56] [INFO ] Implicit Places using invariants in 323 ms returned []
[2025-05-30 07:41:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:41:57] [INFO ] Implicit Places using invariants and state equation in 962 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:41:57] [INFO ] Redundant transitions in 16 ms returned []
Running 1196 sub problems to find dead transitions.
[2025-05-30 07:41:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 495/1725 variables, and 45 constraints, problems are : Problem set: 0 solved, 1196 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 37/40 constraints, State Equation: 0/496 constraints, PredecessorRefiner: 1196/1196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 3 (OVERLAPS) 1/496 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/496 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/1725 variables, and 51 constraints, problems are : Problem set: 0 solved, 1196 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/496 constraints, PredecessorRefiner: 0/1196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60375ms problems are : Problem set: 0 solved, 1196 unsolved
Search for dead transitions found 0 dead transitions in 60379ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61707 ms. Remains : 496/496 places, 1229/1229 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 17 ms. Remains 496 /496 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-30 07:42:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 07:42:58] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 07:42:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2025-05-30 07:42:58] [INFO ] [Nat]Absence check using 11 positive and 40 generalized place invariants in 18 ms returned sat
[2025-05-30 07:42:58] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 07:42:58] [INFO ] After 397ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 07:42:58] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 674 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 2 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 1282/1282 transitions.
Applied a total of 0 rules in 22 ms. Remains 553 /553 variables (removed 0) and now considering 1282/1282 (removed 0) transitions.
// Phase 1: matrix 1282 rows 553 cols
[2025-05-30 07:42:59] [INFO ] Computed 61 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:42:59] [INFO ] Implicit Places using invariants in 371 ms returned []
[2025-05-30 07:42:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:43:00] [INFO ] Implicit Places using invariants and state equation in 1024 ms returned []
Implicit Place search using SMT with State Equation took 1397 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:43:00] [INFO ] Redundant transitions in 17 ms returned []
Running 1237 sub problems to find dead transitions.
[2025-05-30 07:43:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/1835 variables, and 39 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/12 constraints, Generalized P Invariants (flows): 32/49 constraints, State Equation: 0/553 constraints, PredecessorRefiner: 1237/1237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1237 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 3 (OVERLAPS) 2/548 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/1835 variables, and 45 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 33/49 constraints, State Equation: 0/553 constraints, PredecessorRefiner: 0/1237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60373ms problems are : Problem set: 0 solved, 1237 unsolved
Search for dead transitions found 0 dead transitions in 60377ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61827 ms. Remains : 553/553 places, 1282/1282 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 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (456 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (104 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 370837 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 370837 steps, saw 98451 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2025-05-30 07:44:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 144/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/197 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 268/465 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/493 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/553 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1282/1835 variables, 553/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1835 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1835 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1835/1835 variables, and 614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 553/553 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 144/146 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/197 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 268/465 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/465 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/493 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/493 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 60/553 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/553 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1282/1835 variables, 553/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1835 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1835 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1835 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1835/1835 variables, and 615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 553/553 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1004ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 2 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1282/1282 transitions.
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 553 transition count 1252
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 66 place count 523 transition count 1246
Free-agglomeration rule (complex) applied 17 times.
Iterating global reduction 1 with 17 rules applied. Total rules applied 83 place count 523 transition count 1229
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 100 place count 506 transition count 1229
Applied a total of 100 rules in 53 ms. Remains 506 /553 variables (removed 47) and now considering 1229/1282 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 506/553 places, 1229/1282 transitions.
RANDOM walk for 40000 steps (606 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (130 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 380025 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :0 out of 1
Probabilistic random walk after 380025 steps, saw 105831 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
// Phase 1: matrix 1229 rows 506 cols
[2025-05-30 07:44:08] [INFO ] Computed 61 invariants in 17 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/205 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 222/427 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/432 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/506 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1229/1735 variables, 506/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1735 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1735 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1735/1735 variables, and 567 constraints, problems are : Problem set: 0 solved, 1 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 506/506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 71/205 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 222/427 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/432 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 74/506 variables, 11/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1229/1735 variables, 506/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1735 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1735 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1735 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1735/1735 variables, and 568 constraints, problems are : Problem set: 0 solved, 1 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 506/506 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1014ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 2 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1229/1229 transitions.
Applied a total of 0 rules in 17 ms. Remains 506 /506 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 506/506 places, 1229/1229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1229/1229 transitions.
Applied a total of 0 rules in 16 ms. Remains 506 /506 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
[2025-05-30 07:44:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:44:09] [INFO ] Implicit Places using invariants in 399 ms returned [88, 89, 159, 160, 230, 231, 303, 304, 374, 375]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 401 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 496/506 places, 1229/1229 transitions.
Applied a total of 0 rules in 19 ms. Remains 496 /496 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 436 ms. Remains : 496/506 places, 1229/1229 transitions.
RANDOM walk for 40000 steps (633 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (152 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 388935 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 388935 steps, saw 108598 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
// Phase 1: matrix 1229 rows 496 cols
[2025-05-30 07:44:12] [INFO ] Computed 51 invariants in 19 ms
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/214 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 220/434 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/439 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 57/496 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1229/1725 variables, 496/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1725 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1725 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1725/1725 variables, and 547 constraints, problems are : Problem set: 0 solved, 1 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 496/496 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 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/155 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 59/214 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 220/434 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/439 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 57/496 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1229/1725 variables, 496/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1725 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1725 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1725 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1725/1725 variables, and 548 constraints, problems are : Problem set: 0 solved, 1 unsolved in 592 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1025ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 1229/1229 transitions.
Applied a total of 0 rules in 16 ms. Remains 496 /496 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 496/496 places, 1229/1229 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 1229/1229 transitions.
Applied a total of 0 rules in 16 ms. Remains 496 /496 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
[2025-05-30 07:44:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:44:14] [INFO ] Implicit Places using invariants in 329 ms returned []
[2025-05-30 07:44:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:44:15] [INFO ] Implicit Places using invariants and state equation in 951 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:44:15] [INFO ] Redundant transitions in 16 ms returned []
Running 1196 sub problems to find dead transitions.
[2025-05-30 07:44:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 495/1725 variables, and 45 constraints, problems are : Problem set: 0 solved, 1196 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 37/40 constraints, State Equation: 0/496 constraints, PredecessorRefiner: 1196/1196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1196 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/495 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 3 (OVERLAPS) 1/496 variables, 3/48 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/496 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/1725 variables, and 51 constraints, problems are : Problem set: 0 solved, 1196 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/496 constraints, PredecessorRefiner: 0/1196 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60350ms problems are : Problem set: 0 solved, 1196 unsolved
Search for dead transitions found 0 dead transitions in 60353ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61676 ms. Remains : 496/496 places, 1229/1229 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 16 ms. Remains 496 /496 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Running SMT prover for 1 properties.
[2025-05-30 07:45:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 07:45:15] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-30 07:45:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2025-05-30 07:45:15] [INFO ] [Nat]Absence check using 11 positive and 40 generalized place invariants in 14 ms returned sat
[2025-05-30 07:45:16] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-30 07:45:16] [INFO ] After 381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-30 07:45:16] [INFO ] After 501ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 600 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1141 reset in 201 ms.
Product exploration explored 100000 steps with 1149 reset in 214 ms.
Built C files in :
/tmp/ltsmin2434189571158399076
[2025-05-30 07:45:16] [INFO ] Computing symmetric may disable matrix : 1282 transitions.
[2025-05-30 07:45:16] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:45:16] [INFO ] Computing symmetric may enable matrix : 1282 transitions.
[2025-05-30 07:45:16] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:45:17] [INFO ] Computing Do-Not-Accords matrix : 1282 transitions.
[2025-05-30 07:45:17] [INFO ] Computation of Completed DNA matrix. took 41 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:45:17] [INFO ] Built C files in 361ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2434189571158399076
Running compilation step : cd /tmp/ltsmin2434189571158399076;'/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/ltsmin2434189571158399076;'/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/ltsmin2434189571158399076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 553 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 553/553 places, 1282/1282 transitions.
Applied a total of 0 rules in 18 ms. Remains 553 /553 variables (removed 0) and now considering 1282/1282 (removed 0) transitions.
// Phase 1: matrix 1282 rows 553 cols
[2025-05-30 07:45:20] [INFO ] Computed 61 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:45:20] [INFO ] Implicit Places using invariants in 355 ms returned []
[2025-05-30 07:45:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:45:21] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1399 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:45:21] [INFO ] Redundant transitions in 14 ms returned []
Running 1237 sub problems to find dead transitions.
[2025-05-30 07:45:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/1835 variables, and 39 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/12 constraints, Generalized P Invariants (flows): 32/49 constraints, State Equation: 0/553 constraints, PredecessorRefiner: 1237/1237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1237 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 3 (OVERLAPS) 2/548 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1237 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 0)
(s40 1)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 1)
(s47 0)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s72 1)
(s73 4)
(s74 1)
(s75 0)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 6)
(s83 1)
(s84 1)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 1)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 0)
(s117 1)
(s118 0)
(s119 1)
(s120 0)
(s121 1)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s149 1)
(s150 4)
(s151 1)
(s152 0)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 6)
(s161 1)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 1)
(s167 0)
(s168 1)
(s169 1)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 0)
(s196 1)
(s197 0)
(s198 1)
(s199 0)
(s200 1)
(s201 0)
(s202 1)
(s203 0)
(s204 1)
(s205 0)
(s206 1)
(s207 0)
(s208 1)
(s209 0)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s228 1)
(s229 4)
(s230 1)
(s231 0)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 6)
(s240 1)
(s241 1)
(s242 0)
(s243 1)
(s244 0)
(s245 1)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 0)
(s275 1)
(s276 0)
(s277 1)
(s278 0)
(s279 1)
(s280 0)
(s281 1)
(s282 0)
(s283 1)
(s284 0)
(s285 1)
(s286 0)
(s287 1)
(s288 0)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s307 1)
(s308 6)
(s309 1)
(s310 0)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 6)
(s323 0)
(s324 1)
(s325 0)
(s326 1)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 1)
(s338 1)
(s339 0)
(s340 1)
(s341 0)
(s342 1)
(s343 0)
(s344 1)
(s345 0)
(s346 1)
(s347 0)
(s348 1)
(s349 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/1835 variables, and 45 constraints, problems are : Problem set: 0 solved, 1237 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 33/49 constraints, State Equation: 0/553 constraints, PredecessorRefiner: 0/1237 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60369ms problems are : Problem set: 0 solved, 1237 unsolved
Search for dead transitions found 0 dead transitions in 60372ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61812 ms. Remains : 553/553 places, 1282/1282 transitions.
Built C files in :
/tmp/ltsmin3557252581876232859
[2025-05-30 07:46:22] [INFO ] Computing symmetric may disable matrix : 1282 transitions.
[2025-05-30 07:46:22] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:46:22] [INFO ] Computing symmetric may enable matrix : 1282 transitions.
[2025-05-30 07:46:22] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:46:22] [INFO ] Computing Do-Not-Accords matrix : 1282 transitions.
[2025-05-30 07:46:22] [INFO ] Computation of Completed DNA matrix. took 45 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:46:22] [INFO ] Built C files in 316ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3557252581876232859
Running compilation step : cd /tmp/ltsmin3557252581876232859;'/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/ltsmin3557252581876232859;'/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/ltsmin3557252581876232859;'/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-05-30 07:46:25] [INFO ] Flatten gal took : 61 ms
[2025-05-30 07:46:25] [INFO ] Flatten gal took : 47 ms
[2025-05-30 07:46:25] [INFO ] Time to serialize gal into /tmp/LTL2170612980739920275.gal : 13 ms
[2025-05-30 07:46:25] [INFO ] Time to serialize properties into /tmp/LTL16730954058975756407.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/LTL2170612980739920275.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3536849015940575171.hoa' '-atoms' '/tmp/LTL16730954058975756407.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/LTL16730954058975756407.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3536849015940575171.hoa
Detected timeout of ITS tools.
[2025-05-30 07:46:40] [INFO ] Flatten gal took : 43 ms
[2025-05-30 07:46:40] [INFO ] Flatten gal took : 41 ms
[2025-05-30 07:46:40] [INFO ] Time to serialize gal into /tmp/LTL15545380018450279759.gal : 9 ms
[2025-05-30 07:46:40] [INFO ] Time to serialize properties into /tmp/LTL6148295538830017350.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15545380018450279759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6148295538830017350.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p1449==0)||(p2400==1))"))))
Formula 0 simplified : GF!"((p1449==0)||(p2400==1))"
Detected timeout of ITS tools.
[2025-05-30 07:46:56] [INFO ] Flatten gal took : 40 ms
[2025-05-30 07:46:56] [INFO ] Applying decomposition
[2025-05-30 07:46:56] [INFO ] Flatten gal took : 39 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/graph11620702963341803635.txt' '-o' '/tmp/graph11620702963341803635.bin' '-w' '/tmp/graph11620702963341803635.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11620702963341803635.bin' '-l' '-1' '-v' '-w' '/tmp/graph11620702963341803635.weights' '-q' '0' '-e' '0.001'
[2025-05-30 07:46:56] [INFO ] Decomposing Gal with order
[2025-05-30 07:46:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 07:46:56] [INFO ] Removed a total of 2544 redundant transitions.
[2025-05-30 07:46:56] [INFO ] Flatten gal took : 163 ms
[2025-05-30 07:46:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 76 ms.
[2025-05-30 07:46:56] [INFO ] Time to serialize gal into /tmp/LTL10001162964250455788.gal : 12 ms
[2025-05-30 07:46:56] [INFO ] Time to serialize properties into /tmp/LTL7414856811244769255.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/LTL10001162964250455788.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7414856811244769255.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i8.u81.p1449==0)||(i10.u100.p2400==1))"))))
Formula 0 simplified : GF!"((i8.u81.p1449==0)||(i10.u100.p2400==1))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-06b-LTLCardinality-00 finished in 331388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((p0||G(p1)))||F(G(p1))))))'
Support contains 3 out of 2496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2496/2496 places, 3050/3050 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2491 transition count 3038
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2491 transition count 3038
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 2488 transition count 3035
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 2488 transition count 3035
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 2485 transition count 3025
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 2485 transition count 3025
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 2483 transition count 3016
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 2483 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2482 transition count 3015
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2482 transition count 3015
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2481 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2481 transition count 3007
Applied a total of 30 rules in 1170 ms. Remains 2481 /2496 variables (removed 15) and now considering 3007/3050 (removed 43) transitions.
// Phase 1: matrix 3007 rows 2481 cols
[2025-05-30 07:47:12] [INFO ] Computed 266 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:47:14] [INFO ] Implicit Places using invariants in 1385 ms returned []
[2025-05-30 07:47:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:47:20] [INFO ] Implicit Places using invariants and state equation in 5935 ms returned []
Implicit Place search using SMT with State Equation took 7330 ms to find 0 implicit places.
Running 3006 sub problems to find dead transitions.
[2025-05-30 07:47:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2480 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2480/5488 variables, and 154 constraints, problems are : Problem set: 0 solved, 3006 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/64 constraints, Generalized P Invariants (flows): 154/202 constraints, State Equation: 0/2481 constraints, PredecessorRefiner: 3006/3006 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3006 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2480 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 13)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 3)
(s49 1)
(s50 1)
(s51 6)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 26)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 0)
(s95 1)
(s96 1)
(s97 0)
(s98 0)
(s99 1)
(s100 1)
(s101 0)
(s102 0)
(s103 1)
(s104 1)
(s105 0)
(s106 0)
(s107 1)
(s108 1)
(s109 0)
(s110 0)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 6)
(s117 0)
(s118 0)
(s119 1)
(s120 1)
(s121 0)
(s122 0)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 1)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 1)
(s137 1)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 1)
(s146 1)
(s147 0)
(s148 1)
(s149 1)
(s150 0)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 16)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 0)
(s285 1)
(s286 1)
(s287 1)
(s288 0)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 10)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 0)
(s321 0)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 7)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 0)
(s354 1)
(s355 1)
(s356 1)
(s357 0)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 4)
(s363 1)
(s364 0)
(s365 1)
(s366 1)
(s367 0)
(s368 0)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 21)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 21)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 18)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 4)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 28)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 0)
(s453 0)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 0)
(s461 0)
(s462 1)
(s463 6)
(s464 0)
(s465 0)
(s466 5)
(s467 1)
(s468 0)
(s469 0)
(s470 1)
(s471 1)
(s472 0)
(s473 0)
(s474 1)
(s475 1)
(s476 0)
(s477 0)
(s478 1)
(s479 1)
(s480 1)
(s481 0)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 1)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 1)
(s508 1)
(s509 0)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 23)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 0)
(s611 0)
(s612 1)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 1)
(s618 1)
(s619 0)
(s620 0)
(s621 1)
(s622 0)
(s623 0)
(s624 0)
(s625 1)
(s626 1)
(s627 0)
(s628 1)
(s629 0)
(s630 0)
(s631 1)
(s632 1)
(s633 0)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 0)
(s644 1)
(s645 1)
(s646 0)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 0)
(s653 0)
(s654 1)
(s655 1)
(s656 0)
(s657 0)
(s658 0)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 0)
(s665 0)
(s666 0)
(s667 1)
(s668 1)
(s669 0)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 0)
(s680 1)
(s681 1)
(s682 0)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 0)
(s690 1)
(s691 0)
(s692 0)
(s693 1)
(s694 1)
(s695 1)
(s696 0)
(s697 1)
(s698 0)
(s699 1)
(s700 1)
(s701 0)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 0)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 0)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 4)
(s722 1)
(s723 0)
(s724 1)
(s725 1)
(s726 0)
(s727 0)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 17)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 17)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 14)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 3)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 93)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 0)
(s812 5)
(s813 5)
(s814 1)
(s815 0)
(s816 0)
(s817 1)
(s818 1)
(s819 0)
(s820 1)
(s821 1)
(s822 1)
(s823 0)
(s824 0)
(s825 1)
(s826 1)
(s827 0)
(s828 1)
(s829 1)
(s830 1)
(s831 0)
(s832 0)
(s833 1)
(s834 1)
(s835 0)
(s836 0)
(s837 1)
(s838 1)
(s839 1)
(s840 0)
(s841 1)
(s842 1)
(s843 1)
(s844 4)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 1)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 1)
(s859 0)
(s860 1)
(s861 1)
(s862 0)
(s863 0)
(s864 1)
(s865 0)
(s866 0)
(s867 1)
(s868 0)
(s869 0)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 23)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 1)
(s976 0)
(s977 1)
(s978 1)
(s979 0)
(s980 1)
(s981 0)
(s982 0)
(s983 1)
(s984 1)
(s985 0)
(s986 1)
(s987 0)
(s988 0)
(s989 0)
(s990 1)
(s991 1)
(s992 0)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 0)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 0)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 0)
(s1012 1)
(s1013 1)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 1)
(s1027 1)
(s1028 0)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 0)
(s1037 1)
(s1038 1)
(s1039 0)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 0)
(s1050 0)
(s1051 1)
(s1052 0)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 0)
(s1057 0)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 0)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 0)
(s1070 1)
(s1071 1)
(s1072 0)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 4)
(s1081 1)
(s1082 0)
(s1083 1)
(s1084 1)
(s1085 0)
(s1086 0)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 13)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 13)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 10)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 4)
(s1133 93)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 timeout
1)
(s1176 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2480/5488 variables, and 154 constraints, problems are : Problem set: 0 solved, 3006 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/64 constraints, Generalized P Invariants (flows): 154/202 constraints, State Equation: 0/2481 constraints, PredecessorRefiner: 0/3006 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60982ms problems are : Problem set: 0 solved, 3006 unsolved
Search for dead transitions found 0 dead transitions in 60989ms
Starting structural reductions in LTL mode, iteration 1 : 2481/2496 places, 3007/3050 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69498 ms. Remains : 2481/2496 places, 3007/3050 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-01
Stuttering criterion allowed to conclude after 4953 steps with 8 reset in 21 ms.
FORMULA ASLink-PT-06b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLCardinality-01 finished in 69731 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 3050/3050 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 463 transitions
Trivial Post-agglo rules discarded 463 transitions
Performed 463 trivial Post agglomeration. Transition count delta: 463
Iterating post reduction 0 with 463 rules applied. Total rules applied 463 place count 2495 transition count 2586
Reduce places removed 463 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 466 rules applied. Total rules applied 929 place count 2032 transition count 2583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 931 place count 2030 transition count 2583
Performed 673 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 673 Pre rules applied. Total rules applied 931 place count 2030 transition count 1910
Deduced a syphon composed of 673 places in 3 ms
Ensure Unique test removed 64 places
Reduce places removed 737 places and 0 transitions.
Iterating global reduction 3 with 1410 rules applied. Total rules applied 2341 place count 1293 transition count 1910
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 46 rules applied. Total rules applied 2387 place count 1287 transition count 1870
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 2427 place count 1247 transition count 1870
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 2427 place count 1247 transition count 1845
Deduced a syphon composed of 25 places in 4 ms
Ensure Unique test removed 25 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 75 rules applied. Total rules applied 2502 place count 1197 transition count 1845
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2502 place count 1197 transition count 1821
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2550 place count 1173 transition count 1821
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2553 place count 1170 transition count 1811
Iterating global reduction 5 with 3 rules applied. Total rules applied 2556 place count 1170 transition count 1811
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2556 place count 1170 transition count 1810
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2558 place count 1169 transition count 1810
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2559 place count 1168 transition count 1802
Iterating global reduction 5 with 1 rules applied. Total rules applied 2560 place count 1168 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2561 place count 1167 transition count 1794
Iterating global reduction 5 with 1 rules applied. Total rules applied 2562 place count 1167 transition count 1794
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2563 place count 1166 transition count 1786
Iterating global reduction 5 with 1 rules applied. Total rules applied 2564 place count 1166 transition count 1786
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Deduced a syphon composed of 198 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 5 with 398 rules applied. Total rules applied 2962 place count 966 transition count 1588
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2966 place count 962 transition count 1584
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2971 place count 961 transition count 1584
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2972 place count 961 transition count 1583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2973 place count 960 transition count 1583
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2973 place count 960 transition count 1582
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2975 place count 959 transition count 1582
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2977 place count 957 transition count 1580
Iterating global reduction 7 with 2 rules applied. Total rules applied 2979 place count 957 transition count 1580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2981 place count 957 transition count 1578
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2982 place count 956 transition count 1578
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2984 place count 955 transition count 1583
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2986 place count 953 transition count 1581
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 9 with 18 rules applied. Total rules applied 3004 place count 941 transition count 1575
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3010 place count 935 transition count 1575
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 18 Pre rules applied. Total rules applied 3010 place count 935 transition count 1557
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 11 with 37 rules applied. Total rules applied 3047 place count 916 transition count 1557
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 11 with 13 rules applied. Total rules applied 3060 place count 903 transition count 1557
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3060 place count 903 transition count 1556
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3062 place count 902 transition count 1556
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 38 rules applied. Total rules applied 3100 place count 883 transition count 1537
Discarding 12 places :
Symmetric choice reduction at 12 with 12 rule applications. Total rules 3112 place count 871 transition count 1525
Iterating global reduction 12 with 12 rules applied. Total rules applied 3124 place count 871 transition count 1525
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 3130 place count 865 transition count 1519
Iterating global reduction 12 with 6 rules applied. Total rules applied 3136 place count 865 transition count 1519
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3142 place count 865 transition count 1513
Applied a total of 3142 rules in 595 ms. Remains 865 /2496 variables (removed 1631) and now considering 1513/3050 (removed 1537) transitions.
// Phase 1: matrix 1513 rows 865 cols
[2025-05-30 07:48:22] [INFO ] Computed 142 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:48:22] [INFO ] Implicit Places using invariants in 622 ms returned [1, 18, 19, 31, 48, 66, 86, 139, 149, 150, 152, 169, 187, 207, 258, 259, 271, 272, 274, 291, 309, 329, 381, 382, 394, 395, 397, 414, 432, 452, 503, 504, 516, 517, 519, 536, 554, 574, 625, 626, 638, 639, 641, 658, 676, 696, 747, 748, 751, 762, 763, 764, 782, 803, 804, 805, 806]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 623 ms to find 57 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 808/2496 places, 1513/3050 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 808 transition count 1410
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 206 place count 705 transition count 1410
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 206 place count 705 transition count 1379
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 269 place count 673 transition count 1379
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 281 place count 669 transition count 1371
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 289 place count 661 transition count 1371
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 292 place count 658 transition count 1368
Iterating global reduction 4 with 3 rules applied. Total rules applied 295 place count 658 transition count 1368
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 298 place count 658 transition count 1365
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 5 with 96 rules applied. Total rules applied 394 place count 610 transition count 1317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 398 place count 608 transition count 1318
Applied a total of 398 rules in 82 ms. Remains 608 /808 variables (removed 200) and now considering 1318/1513 (removed 195) transitions.
// Phase 1: matrix 1318 rows 608 cols
[2025-05-30 07:48:22] [INFO ] Computed 80 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:48:23] [INFO ] Implicit Places using invariants in 405 ms returned [90, 96, 101, 176, 182, 187, 265, 271, 276, 353, 359, 364, 441, 447, 452, 529, 535, 540, 605]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 406 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 589/2496 places, 1318/3050 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 589 transition count 1317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 588 transition count 1317
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 576 transition count 1305
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 576 transition count 1305
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 37 place count 565 transition count 1294
Iterating global reduction 2 with 11 rules applied. Total rules applied 48 place count 565 transition count 1294
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 560 transition count 1289
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 560 transition count 1289
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 70 place count 554 transition count 1283
Applied a total of 70 rules in 76 ms. Remains 554 /589 variables (removed 35) and now considering 1283/1318 (removed 35) transitions.
// Phase 1: matrix 1283 rows 554 cols
[2025-05-30 07:48:23] [INFO ] Computed 61 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:48:23] [INFO ] Implicit Places using invariants in 369 ms returned []
[2025-05-30 07:48:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:48:24] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1376 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 554/2496 places, 1283/3050 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3159 ms. Remains : 554/2496 places, 1283/3050 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-02
Stuttering criterion allowed to conclude after 68 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-06b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLCardinality-02 finished in 3221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&(!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 2496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2496/2496 places, 3050/3050 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2492 transition count 3039
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2492 transition count 3039
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 2489 transition count 3036
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 2489 transition count 3036
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 2486 transition count 3026
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 2486 transition count 3026
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 2484 transition count 3017
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 2484 transition count 3017
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2483 transition count 3016
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2483 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2482 transition count 3008
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2482 transition count 3008
Applied a total of 28 rules in 1127 ms. Remains 2482 /2496 variables (removed 14) and now considering 3008/3050 (removed 42) transitions.
// Phase 1: matrix 3008 rows 2482 cols
[2025-05-30 07:48:25] [INFO ] Computed 266 invariants in 29 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:48:27] [INFO ] Implicit Places using invariants in 1371 ms returned []
[2025-05-30 07:48:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:48:35] [INFO ] Implicit Places using invariants and state equation in 7911 ms returned []
Implicit Place search using SMT with State Equation took 9284 ms to find 0 implicit places.
Running 3007 sub problems to find dead transitions.
[2025-05-30 07:48:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2481 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 3007 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2481/5490 variables, and 154 constraints, problems are : Problem set: 0 solved, 3007 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/67 constraints, Generalized P Invariants (flows): 154/199 constraints, State Equation: 0/2482 constraints, PredecessorRefiner: 3007/3007 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3007 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2481 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 3007 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2481/5490 variables, and 154 constraints, problems are : Problem set: 0 solved, 3007 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/67 constraints, Generalized P Invariants (flows): 154/199 constraints, State Equation: 0/2482 constraints, PredecessorRefiner: 0/3007 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60963ms problems are : Problem set: 0 solved, 3007 unsolved
Search for dead transitions found 0 dead transitions in 60967ms
Starting structural reductions in LTL mode, iteration 1 : 2482/2496 places, 3008/3050 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71391 ms. Remains : 2482/2496 places, 3008/3050 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-06b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLCardinality-06 finished in 71630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F(p1)&&F(p2)))'
Support contains 6 out of 2496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2496/2496 places, 3050/3050 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2492 transition count 3046
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2492 transition count 3046
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 2490 transition count 3044
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 2490 transition count 3044
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 2488 transition count 3042
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 2488 transition count 3042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 2487 transition count 3041
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 2487 transition count 3041
Applied a total of 18 rules in 834 ms. Remains 2487 /2496 variables (removed 9) and now considering 3041/3050 (removed 9) transitions.
// Phase 1: matrix 3041 rows 2487 cols
[2025-05-30 07:49:37] [INFO ] Computed 266 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:49:38] [INFO ] Implicit Places using invariants in 1402 ms returned []
[2025-05-30 07:49:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:49:46] [INFO ] Implicit Places using invariants and state equation in 8328 ms returned []
Implicit Place search using SMT with State Equation took 9732 ms to find 0 implicit places.
Running 3040 sub problems to find dead transitions.
[2025-05-30 07:49:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2486 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 3040 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2486/5528 variables, and 152 constraints, problems are : Problem set: 0 solved, 3040 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/65 constraints, Generalized P Invariants (flows): 152/201 constraints, State Equation: 0/2487 constraints, PredecessorRefiner: 3040/3040 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3040 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2486 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 3040 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2486/5528 variables, and 152 constraints, problems are : Problem set: 0 solved, 3040 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/65 constraints, Generalized P Invariants (flows): 152/201 constraints, State Equation: 0/2487 constraints, PredecessorRefiner: 0/3040 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60973ms problems are : Problem set: 0 solved, 3040 unsolved
Search for dead transitions found 0 dead transitions in 60978ms
Starting structural reductions in LTL mode, iteration 1 : 2487/2496 places, 3041/3050 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71556 ms. Remains : 2487/2496 places, 3041/3050 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-08
Stuttering criterion allowed to conclude after 948 steps with 0 reset in 11 ms.
FORMULA ASLink-PT-06b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLCardinality-08 finished in 71771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2496/2496 places, 3050/3050 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 2491 transition count 3038
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 2491 transition count 3038
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 2488 transition count 3035
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 2488 transition count 3035
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 2485 transition count 3025
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 2485 transition count 3025
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 2483 transition count 3016
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 2483 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2482 transition count 3015
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2482 transition count 3015
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2481 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2481 transition count 3007
Applied a total of 30 rules in 1181 ms. Remains 2481 /2496 variables (removed 15) and now considering 3007/3050 (removed 43) transitions.
// Phase 1: matrix 3007 rows 2481 cols
[2025-05-30 07:50:49] [INFO ] Computed 266 invariants in 27 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:50:50] [INFO ] Implicit Places using invariants in 1422 ms returned []
[2025-05-30 07:50:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:50:58] [INFO ] Implicit Places using invariants and state equation in 7611 ms returned []
Implicit Place search using SMT with State Equation took 9036 ms to find 0 implicit places.
Running 3006 sub problems to find dead transitions.
[2025-05-30 07:50:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2480 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2480/5488 variables, and 154 constraints, problems are : Problem set: 0 solved, 3006 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/64 constraints, Generalized P Invariants (flows): 154/202 constraints, State Equation: 0/2481 constraints, PredecessorRefiner: 3006/3006 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3006 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2480 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 3006 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2480/5488 variables, and 154 constraints, problems are : Problem set: 0 solved, 3006 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/64 constraints, Generalized P Invariants (flows): 154/202 constraints, State Equation: 0/2481 constraints, PredecessorRefiner: 0/3006 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60949ms problems are : Problem set: 0 solved, 3006 unsolved
Search for dead transitions found 0 dead transitions in 60955ms
Starting structural reductions in LTL mode, iteration 1 : 2481/2496 places, 3007/3050 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71180 ms. Remains : 2481/2496 places, 3007/3050 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 637 ms.
Product exploration explored 100000 steps with 50000 reset in 599 ms.
Computed a total of 101 stabilizing places and 101 stable transitions
Computed a total of 101 stabilizing places and 101 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-06b-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-06b-LTLCardinality-11 finished in 72566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 4 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 3050/3050 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 459 transitions
Trivial Post-agglo rules discarded 459 transitions
Performed 459 trivial Post agglomeration. Transition count delta: 459
Iterating post reduction 0 with 459 rules applied. Total rules applied 459 place count 2495 transition count 2590
Reduce places removed 459 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 462 rules applied. Total rules applied 921 place count 2036 transition count 2587
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 924 place count 2034 transition count 2586
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 925 place count 2033 transition count 2586
Performed 671 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 671 Pre rules applied. Total rules applied 925 place count 2033 transition count 1915
Deduced a syphon composed of 671 places in 4 ms
Ensure Unique test removed 63 places
Reduce places removed 734 places and 0 transitions.
Iterating global reduction 4 with 1405 rules applied. Total rules applied 2330 place count 1299 transition count 1915
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 4 with 46 rules applied. Total rules applied 2376 place count 1293 transition count 1875
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 2416 place count 1253 transition count 1875
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2416 place count 1253 transition count 1851
Deduced a syphon composed of 24 places in 3 ms
Ensure Unique test removed 24 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 2488 place count 1205 transition count 1851
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 23 Pre rules applied. Total rules applied 2488 place count 1205 transition count 1828
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 2534 place count 1182 transition count 1828
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2537 place count 1179 transition count 1818
Iterating global reduction 6 with 3 rules applied. Total rules applied 2540 place count 1179 transition count 1818
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2540 place count 1179 transition count 1817
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2542 place count 1178 transition count 1817
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2543 place count 1177 transition count 1809
Iterating global reduction 6 with 1 rules applied. Total rules applied 2544 place count 1177 transition count 1809
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2545 place count 1176 transition count 1801
Iterating global reduction 6 with 1 rules applied. Total rules applied 2546 place count 1176 transition count 1801
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2547 place count 1175 transition count 1793
Iterating global reduction 6 with 1 rules applied. Total rules applied 2548 place count 1175 transition count 1793
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Deduced a syphon composed of 201 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 6 with 405 rules applied. Total rules applied 2953 place count 971 transition count 1592
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2957 place count 967 transition count 1588
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2962 place count 966 transition count 1588
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2963 place count 966 transition count 1587
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2964 place count 965 transition count 1587
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2964 place count 965 transition count 1586
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2966 place count 964 transition count 1586
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2968 place count 962 transition count 1584
Iterating global reduction 8 with 2 rules applied. Total rules applied 2970 place count 962 transition count 1584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2972 place count 962 transition count 1582
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2973 place count 961 transition count 1582
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2975 place count 960 transition count 1587
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2977 place count 958 transition count 1585
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 10 with 18 rules applied. Total rules applied 2995 place count 946 transition count 1579
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3001 place count 940 transition count 1579
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 18 Pre rules applied. Total rules applied 3001 place count 940 transition count 1561
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 37 rules applied. Total rules applied 3038 place count 921 transition count 1561
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 12 with 13 rules applied. Total rules applied 3051 place count 908 transition count 1561
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3051 place count 908 transition count 1560
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3053 place count 907 transition count 1560
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 13 with 38 rules applied. Total rules applied 3091 place count 888 transition count 1541
Discarding 12 places :
Symmetric choice reduction at 13 with 12 rule applications. Total rules 3103 place count 876 transition count 1529
Iterating global reduction 13 with 12 rules applied. Total rules applied 3115 place count 876 transition count 1529
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 3121 place count 870 transition count 1523
Iterating global reduction 13 with 6 rules applied. Total rules applied 3127 place count 870 transition count 1523
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3133 place count 870 transition count 1517
Applied a total of 3133 rules in 629 ms. Remains 870 /2496 variables (removed 1626) and now considering 1517/3050 (removed 1533) transitions.
// Phase 1: matrix 1517 rows 870 cols
[2025-05-30 07:52:01] [INFO ] Computed 143 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:52:01] [INFO ] Implicit Places using invariants in 632 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 238, 259, 260, 272, 273, 275, 292, 310, 330, 381, 382, 394, 395, 397, 414, 432, 454, 505, 506, 518, 519, 521, 538, 556, 576, 627, 628, 640, 641, 643, 660, 678, 698, 749, 750, 753, 765, 766, 767, 785, 806, 807, 808, 809]
Discarding 58 places :
Implicit Place search using SMT only with invariants took 633 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 812/2496 places, 1517/3050 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 812 transition count 1415
Reduce places removed 102 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 104 rules applied. Total rules applied 206 place count 710 transition count 1413
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 208 place count 708 transition count 1413
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 208 place count 708 transition count 1382
Deduced a syphon composed of 31 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 271 place count 676 transition count 1382
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 283 place count 672 transition count 1374
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 291 place count 664 transition count 1374
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 294 place count 661 transition count 1371
Iterating global reduction 5 with 3 rules applied. Total rules applied 297 place count 661 transition count 1371
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 300 place count 661 transition count 1368
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 394 place count 614 transition count 1321
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 398 place count 612 transition count 1322
Applied a total of 398 rules in 103 ms. Remains 612 /812 variables (removed 200) and now considering 1322/1517 (removed 195) transitions.
// Phase 1: matrix 1322 rows 612 cols
[2025-05-30 07:52:02] [INFO ] Computed 80 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:52:02] [INFO ] Implicit Places using invariants in 440 ms returned [88, 94, 99, 182, 187, 264, 270, 275, 354, 360, 365, 442, 448, 453, 530, 536, 541, 609]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 441 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 594/2496 places, 1322/3050 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 594 transition count 1321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 593 transition count 1321
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 13 place count 582 transition count 1310
Iterating global reduction 2 with 11 rules applied. Total rules applied 24 place count 582 transition count 1310
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 35 place count 571 transition count 1299
Iterating global reduction 2 with 11 rules applied. Total rules applied 46 place count 571 transition count 1299
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 51 place count 566 transition count 1294
Iterating global reduction 2 with 5 rules applied. Total rules applied 56 place count 566 transition count 1294
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 68 place count 560 transition count 1288
Applied a total of 68 rules in 76 ms. Remains 560 /594 variables (removed 34) and now considering 1288/1322 (removed 34) transitions.
// Phase 1: matrix 1288 rows 560 cols
[2025-05-30 07:52:02] [INFO ] Computed 62 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:52:02] [INFO ] Implicit Places using invariants in 377 ms returned []
[2025-05-30 07:52:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:52:04] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1661 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 560/2496 places, 1288/3050 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3545 ms. Remains : 560/2496 places, 1288/3050 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-12
Product exploration explored 100000 steps with 1219 reset in 245 ms.
Product exploration explored 100000 steps with 1212 reset in 291 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 p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
RANDOM walk for 40000 steps (506 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (98 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 296365 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 1
Probabilistic random walk after 296365 steps, saw 129386 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2025-05-30 07:52:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 119/121 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/190 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/440 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/469 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 85/554 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/554 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/558 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/560 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1288/1848 variables, 560/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1848 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1848 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1848/1848 variables, and 622 constraints, problems are : Problem set: 0 solved, 1 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 119/121 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/190 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:52:08] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 250/440 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/469 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 85/554 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/554 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/558 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/558 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/560 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/560 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1288/1848 variables, 560/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1848 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1848 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1848 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1848/1848 variables, and 624 constraints, problems are : Problem set: 0 solved, 1 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1203ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 17479 steps, including 1041 resets, run visited all 1 properties in 41 ms. (steps per millisecond=426 )
Parikh walk visited 1 properties in 44 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Support contains 2 out of 560 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 560/560 places, 1288/1288 transitions.
Applied a total of 0 rules in 24 ms. Remains 560 /560 variables (removed 0) and now considering 1288/1288 (removed 0) transitions.
[2025-05-30 07:52:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:52:10] [INFO ] Implicit Places using invariants in 355 ms returned []
[2025-05-30 07:52:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:52:11] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1638 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:52:11] [INFO ] Redundant transitions in 17 ms returned []
Running 1243 sub problems to find dead transitions.
[2025-05-30 07:52:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1848 variables, and 37 constraints, problems are : Problem set: 0 solved, 1243 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/13 constraints, Generalized P Invariants (flows): 31/49 constraints, State Equation: 0/560 constraints, PredecessorRefiner: 1243/1243 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1243 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 31/37 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 3 (OVERLAPS) 3/556 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1243 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/1848 variables, and 48 constraints, problems are : Problem set: 0 solved, 1243 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 35/49 constraints, State Equation: 0/560 constraints, PredecessorRefiner: 0/1243 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60385ms problems are : Problem set: 0 solved, 1243 unsolved
Search for dead transitions found 0 dead transitions in 60387ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62072 ms. Remains : 560/560 places, 1288/1288 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
RANDOM walk for 40000 steps (490 resets) in 313 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (100 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 327447 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 1
Probabilistic random walk after 327447 steps, saw 138397 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
[2025-05-30 07:53:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 119/121 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/190 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/440 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/469 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/469 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 85/554 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/554 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/558 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/558 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/560 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1288/1848 variables, 560/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1848 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1848 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1848/1848 variables, and 622 constraints, problems are : Problem set: 0 solved, 1 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 119/121 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 69/190 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:53:15] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 250/440 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 29/469 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/469 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 85/554 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/554 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/558 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/558 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/560 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/560 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1288/1848 variables, 560/623 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1848 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1848 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1848 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1848/1848 variables, and 624 constraints, problems are : Problem set: 0 solved, 1 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1130ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 16653 steps, including 1023 resets, run visited all 1 properties in 35 ms. (steps per millisecond=475 )
Parikh walk visited 1 properties in 36 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1184 reset in 214 ms.
Product exploration explored 100000 steps with 1235 reset in 216 ms.
Built C files in :
/tmp/ltsmin4806626662571114863
[2025-05-30 07:53:16] [INFO ] Computing symmetric may disable matrix : 1288 transitions.
[2025-05-30 07:53:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:53:16] [INFO ] Computing symmetric may enable matrix : 1288 transitions.
[2025-05-30 07:53:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:53:17] [INFO ] Computing Do-Not-Accords matrix : 1288 transitions.
[2025-05-30 07:53:17] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:53:17] [INFO ] Built C files in 288ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4806626662571114863
Running compilation step : cd /tmp/ltsmin4806626662571114863;'/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/ltsmin4806626662571114863;'/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/ltsmin4806626662571114863;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 560 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 560/560 places, 1288/1288 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 560 transition count 1285
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 557 transition count 1285
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 557 transition count 1284
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 556 transition count 1284
Applied a total of 8 rules in 25 ms. Remains 556 /560 variables (removed 4) and now considering 1284/1288 (removed 4) transitions.
// Phase 1: matrix 1284 rows 556 cols
[2025-05-30 07:53:20] [INFO ] Computed 62 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:53:20] [INFO ] Implicit Places using invariants in 350 ms returned [165]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 350 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 555/560 places, 1284/1288 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 554 transition count 1283
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 553 transition count 1282
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 553 transition count 1282
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 552 transition count 1281
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 552 transition count 1281
Applied a total of 6 rules in 57 ms. Remains 552 /555 variables (removed 3) and now considering 1281/1284 (removed 3) transitions.
// Phase 1: matrix 1281 rows 552 cols
[2025-05-30 07:53:20] [INFO ] Computed 61 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:53:20] [INFO ] Implicit Places using invariants in 351 ms returned []
[2025-05-30 07:53:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:53:22] [INFO ] Implicit Places using invariants and state equation in 1163 ms returned []
Implicit Place search using SMT with State Equation took 1521 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 552/560 places, 1281/1288 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1955 ms. Remains : 552/560 places, 1281/1288 transitions.
Built C files in :
/tmp/ltsmin1124665050385336075
[2025-05-30 07:53:22] [INFO ] Computing symmetric may disable matrix : 1281 transitions.
[2025-05-30 07:53:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:53:22] [INFO ] Computing symmetric may enable matrix : 1281 transitions.
[2025-05-30 07:53:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:53:22] [INFO ] Computing Do-Not-Accords matrix : 1281 transitions.
[2025-05-30 07:53:22] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:53:22] [INFO ] Built C files in 279ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1124665050385336075
Running compilation step : cd /tmp/ltsmin1124665050385336075;'/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/ltsmin1124665050385336075;'/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/ltsmin1124665050385336075;'/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-05-30 07:53:25] [INFO ] Flatten gal took : 56 ms
[2025-05-30 07:53:25] [INFO ] Flatten gal took : 41 ms
[2025-05-30 07:53:25] [INFO ] Time to serialize gal into /tmp/LTL133696507012465045.gal : 7 ms
[2025-05-30 07:53:25] [INFO ] Time to serialize properties into /tmp/LTL17784939449475205368.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/LTL133696507012465045.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15031772161413703767.hoa' '-atoms' '/tmp/LTL17784939449475205368.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/LTL17784939449475205368.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15031772161413703767.hoa
Detected timeout of ITS tools.
[2025-05-30 07:53:40] [INFO ] Flatten gal took : 36 ms
[2025-05-30 07:53:40] [INFO ] Flatten gal took : 36 ms
[2025-05-30 07:53:40] [INFO ] Time to serialize gal into /tmp/LTL9146095629942502043.gal : 6 ms
[2025-05-30 07:53:40] [INFO ] Time to serialize properties into /tmp/LTL11024203335266276174.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/LTL9146095629942502043.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11024203335266276174.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("((p703==0)||(p2603==1))"))&&(F(G("((p1399==0)||(p2406==1))")))))
Formula 0 simplified : G!"((p703==0)||(p2603==1))" | GF!"((p1399==0)||(p2406==1))"
Detected timeout of ITS tools.
[2025-05-30 07:53:55] [INFO ] Flatten gal took : 36 ms
[2025-05-30 07:53:55] [INFO ] Applying decomposition
[2025-05-30 07:53:55] [INFO ] Flatten gal took : 36 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/graph3829765688432663671.txt' '-o' '/tmp/graph3829765688432663671.bin' '-w' '/tmp/graph3829765688432663671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3829765688432663671.bin' '-l' '-1' '-v' '-w' '/tmp/graph3829765688432663671.weights' '-q' '0' '-e' '0.001'
[2025-05-30 07:53:55] [INFO ] Decomposing Gal with order
[2025-05-30 07:53:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 07:53:56] [INFO ] Removed a total of 2510 redundant transitions.
[2025-05-30 07:53:56] [INFO ] Flatten gal took : 65 ms
[2025-05-30 07:53:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 85 labels/synchronizations in 30 ms.
[2025-05-30 07:53:56] [INFO ] Time to serialize gal into /tmp/LTL587912549812903253.gal : 7 ms
[2025-05-30 07:53:56] [INFO ] Time to serialize properties into /tmp/LTL5520613730785580500.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/LTL587912549812903253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5520613730785580500.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !(((F("((i3.u45.p703==0)||(i12.i1.u138.p2603==1))"))&&(F(G("((i4.u73.p1399==0)||(i12.i0.u120.p2406==1))")))))
Formula 0 simplified : G!"((i3.u45.p703==0)||(i12.i1.u138.p2603==1))" | GF!"((i4.u73.p1399==0)||(i12.i0.u120.p2406==1))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-06b-LTLCardinality-12 finished in 130481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2496/2496 places, 3050/3050 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 463 transitions
Trivial Post-agglo rules discarded 463 transitions
Performed 463 trivial Post agglomeration. Transition count delta: 463
Iterating post reduction 0 with 463 rules applied. Total rules applied 463 place count 2495 transition count 2586
Reduce places removed 463 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 466 rules applied. Total rules applied 929 place count 2032 transition count 2583
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 932 place count 2030 transition count 2582
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 933 place count 2029 transition count 2582
Performed 673 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 673 Pre rules applied. Total rules applied 933 place count 2029 transition count 1909
Deduced a syphon composed of 673 places in 4 ms
Ensure Unique test removed 64 places
Reduce places removed 737 places and 0 transitions.
Iterating global reduction 4 with 1410 rules applied. Total rules applied 2343 place count 1292 transition count 1909
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 4 with 46 rules applied. Total rules applied 2389 place count 1286 transition count 1869
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 2429 place count 1246 transition count 1869
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 2429 place count 1246 transition count 1844
Deduced a syphon composed of 25 places in 3 ms
Ensure Unique test removed 25 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 75 rules applied. Total rules applied 2504 place count 1196 transition count 1844
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2504 place count 1196 transition count 1820
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2552 place count 1172 transition count 1820
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2554 place count 1170 transition count 1811
Iterating global reduction 6 with 2 rules applied. Total rules applied 2556 place count 1170 transition count 1811
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2556 place count 1170 transition count 1810
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2558 place count 1169 transition count 1810
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2559 place count 1168 transition count 1802
Iterating global reduction 6 with 1 rules applied. Total rules applied 2560 place count 1168 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2561 place count 1167 transition count 1794
Iterating global reduction 6 with 1 rules applied. Total rules applied 2562 place count 1167 transition count 1794
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2563 place count 1166 transition count 1786
Iterating global reduction 6 with 1 rules applied. Total rules applied 2564 place count 1166 transition count 1786
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Deduced a syphon composed of 198 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 6 with 398 rules applied. Total rules applied 2962 place count 966 transition count 1588
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2966 place count 962 transition count 1584
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2971 place count 961 transition count 1584
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2972 place count 961 transition count 1583
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2973 place count 960 transition count 1583
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2973 place count 960 transition count 1582
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2975 place count 959 transition count 1582
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2977 place count 957 transition count 1580
Iterating global reduction 8 with 2 rules applied. Total rules applied 2979 place count 957 transition count 1580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2981 place count 957 transition count 1578
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2982 place count 956 transition count 1578
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2984 place count 955 transition count 1584
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2986 place count 953 transition count 1582
Reduce places removed 12 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 10 with 18 rules applied. Total rules applied 3004 place count 941 transition count 1576
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3010 place count 935 transition count 1576
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 18 Pre rules applied. Total rules applied 3010 place count 935 transition count 1558
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 37 rules applied. Total rules applied 3047 place count 916 transition count 1558
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 12 with 13 rules applied. Total rules applied 3060 place count 903 transition count 1558
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3060 place count 903 transition count 1557
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3062 place count 902 transition count 1557
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 13 with 38 rules applied. Total rules applied 3100 place count 883 transition count 1538
Discarding 12 places :
Symmetric choice reduction at 13 with 12 rule applications. Total rules 3112 place count 871 transition count 1526
Iterating global reduction 13 with 12 rules applied. Total rules applied 3124 place count 871 transition count 1526
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 3130 place count 865 transition count 1520
Iterating global reduction 13 with 6 rules applied. Total rules applied 3136 place count 865 transition count 1520
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3142 place count 865 transition count 1514
Applied a total of 3142 rules in 601 ms. Remains 865 /2496 variables (removed 1631) and now considering 1514/3050 (removed 1536) transitions.
// Phase 1: matrix 1514 rows 865 cols
[2025-05-30 07:54:11] [INFO ] Computed 142 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:54:12] [INFO ] Implicit Places using invariants in 641 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 500, 501, 513, 514, 516, 533, 551, 571, 622, 623, 635, 636, 638, 655, 673, 693, 745, 746, 749, 760, 761, 762, 780, 801, 802, 803, 804]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 643 ms to find 57 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 808/2496 places, 1514/3050 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 808 transition count 1411
Reduce places removed 103 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 104 rules applied. Total rules applied 207 place count 705 transition count 1410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 208 place count 704 transition count 1410
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 208 place count 704 transition count 1379
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 271 place count 672 transition count 1379
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 283 place count 668 transition count 1371
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 291 place count 660 transition count 1371
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 294 place count 657 transition count 1368
Iterating global reduction 5 with 3 rules applied. Total rules applied 297 place count 657 transition count 1368
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 300 place count 657 transition count 1365
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 396 place count 609 transition count 1317
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 398 place count 608 transition count 1318
Applied a total of 398 rules in 85 ms. Remains 608 /808 variables (removed 200) and now considering 1318/1514 (removed 196) transitions.
// Phase 1: matrix 1318 rows 608 cols
[2025-05-30 07:54:12] [INFO ] Computed 80 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:54:12] [INFO ] Implicit Places using invariants in 419 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 438, 444, 449, 526, 533, 538, 605]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 421 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 589/2496 places, 1318/3050 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 589 transition count 1317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 588 transition count 1317
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 576 transition count 1305
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 576 transition count 1305
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 38 place count 564 transition count 1293
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 564 transition count 1293
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 558 transition count 1287
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 558 transition count 1287
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 74 place count 552 transition count 1281
Applied a total of 74 rules in 77 ms. Remains 552 /589 variables (removed 37) and now considering 1281/1318 (removed 37) transitions.
// Phase 1: matrix 1281 rows 552 cols
[2025-05-30 07:54:13] [INFO ] Computed 61 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:54:13] [INFO ] Implicit Places using invariants in 372 ms returned []
[2025-05-30 07:54:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:54:14] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1420 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 552/2496 places, 1281/3050 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3248 ms. Remains : 552/2496 places, 1281/3050 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLCardinality-15
Product exploration explored 100000 steps with 1306 reset in 208 ms.
Product exploration explored 100000 steps with 1310 reset in 271 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 59 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 3976 steps (47 resets) in 32 ms. (120 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 1281/1281 transitions.
Applied a total of 0 rules in 20 ms. Remains 552 /552 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
[2025-05-30 07:54:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:54:15] [INFO ] Implicit Places using invariants in 361 ms returned []
[2025-05-30 07:54:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:54:16] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:54:16] [INFO ] Redundant transitions in 18 ms returned []
Running 1236 sub problems to find dead transitions.
[2025-05-30 07:54:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/545 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/545 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/1833 variables, and 39 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/12 constraints, Generalized P Invariants (flows): 32/49 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 1236/1236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/545 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/545 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/545 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 3 (OVERLAPS) 2/547 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/1833 variables, and 45 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 33/49 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 0/1236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60334ms problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 60336ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61788 ms. Remains : 552/552 places, 1281/1281 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 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 1068 steps (13 resets) in 13 ms. (76 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1260 reset in 208 ms.
Product exploration explored 100000 steps with 1253 reset in 243 ms.
Built C files in :
/tmp/ltsmin9056227032569202891
[2025-05-30 07:55:17] [INFO ] Computing symmetric may disable matrix : 1281 transitions.
[2025-05-30 07:55:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:55:17] [INFO ] Computing symmetric may enable matrix : 1281 transitions.
[2025-05-30 07:55:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:55:18] [INFO ] Computing Do-Not-Accords matrix : 1281 transitions.
[2025-05-30 07:55:18] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:55:18] [INFO ] Built C files in 277ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9056227032569202891
Running compilation step : cd /tmp/ltsmin9056227032569202891;'/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/ltsmin9056227032569202891;'/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/ltsmin9056227032569202891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 1281/1281 transitions.
Applied a total of 0 rules in 17 ms. Remains 552 /552 variables (removed 0) and now considering 1281/1281 (removed 0) transitions.
[2025-05-30 07:55:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:55:21] [INFO ] Implicit Places using invariants in 341 ms returned []
[2025-05-30 07:55:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 07:55:22] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 07:55:22] [INFO ] Redundant transitions in 12 ms returned []
Running 1236 sub problems to find dead transitions.
[2025-05-30 07:55:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/545 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/545 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/1833 variables, and 39 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 7/12 constraints, Generalized P Invariants (flows): 32/49 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 1236/1236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/545 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/545 variables, 32/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/545 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 3 (OVERLAPS) 2/547 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/547 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1236 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 547/1833 variables, and 45 constraints, problems are : Problem set: 0 solved, 1236 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 33/49 constraints, State Equation: 0/552 constraints, PredecessorRefiner: 0/1236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60355ms problems are : Problem set: 0 solved, 1236 unsolved
Search for dead transitions found 0 dead transitions in 60357ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61725 ms. Remains : 552/552 places, 1281/1281 transitions.
Built C files in :
/tmp/ltsmin11689713373959000706
[2025-05-30 07:56:22] [INFO ] Computing symmetric may disable matrix : 1281 transitions.
[2025-05-30 07:56:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:56:22] [INFO ] Computing symmetric may enable matrix : 1281 transitions.
[2025-05-30 07:56:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:56:23] [INFO ] Computing Do-Not-Accords matrix : 1281 transitions.
[2025-05-30 07:56:23] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 07:56:23] [INFO ] Built C files in 289ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11689713373959000706
Running compilation step : cd /tmp/ltsmin11689713373959000706;'/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/ltsmin11689713373959000706;'/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/ltsmin11689713373959000706;'/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-05-30 07:56:26] [INFO ] Flatten gal took : 36 ms
[2025-05-30 07:56:26] [INFO ] Flatten gal took : 35 ms
[2025-05-30 07:56:26] [INFO ] Time to serialize gal into /tmp/LTL14026094595403085849.gal : 9 ms
[2025-05-30 07:56:26] [INFO ] Time to serialize properties into /tmp/LTL4638460214400544804.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/LTL14026094595403085849.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13308962658462485401.hoa' '-atoms' '/tmp/LTL4638460214400544804.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/LTL4638460214400544804.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13308962658462485401.hoa
Detected timeout of ITS tools.
[2025-05-30 07:56:41] [INFO ] Flatten gal took : 33 ms
[2025-05-30 07:56:41] [INFO ] Flatten gal took : 33 ms
[2025-05-30 07:56:41] [INFO ] Time to serialize gal into /tmp/LTL1817749426372319684.gal : 6 ms
[2025-05-30 07:56:41] [INFO ] Time to serialize properties into /tmp/LTL16516221701502800879.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/LTL1817749426372319684.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16516221701502800879.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p2720==0)||(p2305==1))"))))
Formula 0 simplified : GF!"((p2720==0)||(p2305==1))"
Detected timeout of ITS tools.
[2025-05-30 07:56:56] [INFO ] Flatten gal took : 33 ms
[2025-05-30 07:56:56] [INFO ] Applying decomposition
[2025-05-30 07:56:56] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1173839185264071499.txt' '-o' '/tmp/graph1173839185264071499.bin' '-w' '/tmp/graph1173839185264071499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1173839185264071499.bin' '-l' '-1' '-v' '-w' '/tmp/graph1173839185264071499.weights' '-q' '0' '-e' '0.001'
[2025-05-30 07:56:56] [INFO ] Decomposing Gal with order
[2025-05-30 07:56:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 07:56:56] [INFO ] Removed a total of 2537 redundant transitions.
[2025-05-30 07:56:56] [INFO ] Flatten gal took : 58 ms
[2025-05-30 07:56:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 12 ms.
[2025-05-30 07:56:56] [INFO ] Time to serialize gal into /tmp/LTL13077120245792521638.gal : 8 ms
[2025-05-30 07:56:56] [INFO ] Time to serialize properties into /tmp/LTL14913505653519507704.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/LTL13077120245792521638.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14913505653519507704.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i12.u138.p2720==0)||(i12.u118.p2305==1))"))))
Formula 0 simplified : GF!"((i12.u138.p2720==0)||(i12.u118.p2305==1))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-06b-LTLCardinality-15 finished in 180701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2025-05-30 07:57:12] [INFO ] Flatten gal took : 65 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14204202679179835520
[2025-05-30 07:57:12] [INFO ] Too many transitions (3050) to apply POR reductions. Disabling POR matrices.
[2025-05-30 07:57:12] [INFO ] Applying decomposition
[2025-05-30 07:57:12] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14204202679179835520
Running compilation step : cd /tmp/ltsmin14204202679179835520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 07:57:12] [INFO ] Flatten gal took : 86 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/graph5116121641952150534.txt' '-o' '/tmp/graph5116121641952150534.bin' '-w' '/tmp/graph5116121641952150534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5116121641952150534.bin' '-l' '-1' '-v' '-w' '/tmp/graph5116121641952150534.weights' '-q' '0' '-e' '0.001'
[2025-05-30 07:57:12] [INFO ] Decomposing Gal with order
[2025-05-30 07:57:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 07:57:13] [INFO ] Removed a total of 2295 redundant transitions.
[2025-05-30 07:57:13] [INFO ] Flatten gal took : 137 ms
[2025-05-30 07:57:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 18 ms.
[2025-05-30 07:57:13] [INFO ] Time to serialize gal into /tmp/LTLCardinality16322817637884264335.gal : 25 ms
[2025-05-30 07:57:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality17179128560461064759.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/LTLCardinality16322817637884264335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17179128560461064759.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((F(G("((i17.i1.i1.u501.p1449==0)||(i24.i1.i1.u840.p2400==1))"))))
Formula 0 simplified : GF!"((i17.i1.i1.u501.p1449==0)||(i24.i1.i1.u840.p2400==1))"
Compilation finished in 7654 ms.
Running link step : cd /tmp/ltsmin14204202679179835520;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin14204202679179835520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin14204202679179835520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14204202679179835520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp1==true))&&<>([]((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin14204202679179835520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp1==true))&&<>([]((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14204202679179835520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin14204202679179835520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp3==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin14204202679179835520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 08:23:09] [INFO ] Applying decomposition
[2025-05-30 08:23:09] [INFO ] Flatten gal took : 145 ms
[2025-05-30 08:23:09] [INFO ] Decomposing Gal with order
[2025-05-30 08:23:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 08:23:09] [INFO ] Removed a total of 2102 redundant transitions.
[2025-05-30 08:23:10] [INFO ] Flatten gal took : 384 ms
[2025-05-30 08:23:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 3410 labels/synchronizations in 237 ms.
[2025-05-30 08:23:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality8632188053035620453.gal : 42 ms
[2025-05-30 08:23:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality9261051813351266868.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8632188053035620453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9261051813351266868.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((F(G("((i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i1.i0.u169.p1449==0)||(i0.i1.i0.i0.i0.i0.i1.u289.p2400==1))"))))
Formula 0 simplified : GF!"((i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.i1.i0.u169.p1449==0)||(i0.i1.i0.i0.i0.i0.i1.u289.p2400==1))"

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="ASLink-PT-06b"
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 ASLink-PT-06b, 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 r002-tall-174853729100371"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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