Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.2K Jun 6 09:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 6 09:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 6 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 12:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 12:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 6 09:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 6 09:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 6 09:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 155K Jun 5 20:08 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 MedleyB-PT-B01-LTLCardinality-00
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-01
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-02
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-03
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-04
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-05
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-06
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-07
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-08
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-09
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-10
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-11
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-12
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-13
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-14
FORMULA_NAME MedleyB-PT-B01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749385548978

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 12:25:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 12:25:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 12:25:50] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2025-06-08 12:25:50] [INFO ] Transformed 925 places.
[2025-06-08 12:25:50] [INFO ] Transformed 1037 transitions.
[2025-06-08 12:25:50] [INFO ] Found NUPN structural information;
[2025-06-08 12:25:50] [INFO ] Parsed PT model containing 925 places and 1037 transitions and 2433 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MedleyB-PT-B01-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B01-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 925 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 925/925 places, 1037/1037 transitions.
Discarding 69 places :
Symmetric choice reduction at 0 with 69 rule applications. Total rules 69 place count 856 transition count 968
Iterating global reduction 0 with 69 rules applied. Total rules applied 138 place count 856 transition count 968
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 179 place count 815 transition count 927
Iterating global reduction 0 with 41 rules applied. Total rules applied 220 place count 815 transition count 927
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 244 place count 791 transition count 903
Iterating global reduction 0 with 24 rules applied. Total rules applied 268 place count 791 transition count 903
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 288 place count 771 transition count 883
Iterating global reduction 0 with 20 rules applied. Total rules applied 308 place count 771 transition count 883
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 325 place count 754 transition count 866
Iterating global reduction 0 with 17 rules applied. Total rules applied 342 place count 754 transition count 866
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 357 place count 739 transition count 851
Iterating global reduction 0 with 15 rules applied. Total rules applied 372 place count 739 transition count 851
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 387 place count 724 transition count 836
Iterating global reduction 0 with 15 rules applied. Total rules applied 402 place count 724 transition count 836
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 417 place count 709 transition count 821
Iterating global reduction 0 with 15 rules applied. Total rules applied 432 place count 709 transition count 821
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 445 place count 696 transition count 808
Iterating global reduction 0 with 13 rules applied. Total rules applied 458 place count 696 transition count 808
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 468 place count 686 transition count 798
Iterating global reduction 0 with 10 rules applied. Total rules applied 478 place count 686 transition count 798
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 480 place count 686 transition count 796
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 484 place count 682 transition count 792
Iterating global reduction 1 with 4 rules applied. Total rules applied 488 place count 682 transition count 792
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 492 place count 678 transition count 788
Iterating global reduction 1 with 4 rules applied. Total rules applied 496 place count 678 transition count 788
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 498 place count 676 transition count 786
Iterating global reduction 1 with 2 rules applied. Total rules applied 500 place count 676 transition count 786
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 502 place count 674 transition count 784
Iterating global reduction 1 with 2 rules applied. Total rules applied 504 place count 674 transition count 784
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 506 place count 672 transition count 782
Iterating global reduction 1 with 2 rules applied. Total rules applied 508 place count 672 transition count 782
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 510 place count 670 transition count 780
Iterating global reduction 1 with 2 rules applied. Total rules applied 512 place count 670 transition count 780
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 514 place count 668 transition count 778
Iterating global reduction 1 with 2 rules applied. Total rules applied 516 place count 668 transition count 778
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 518 place count 666 transition count 776
Iterating global reduction 1 with 2 rules applied. Total rules applied 520 place count 666 transition count 776
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 522 place count 664 transition count 774
Iterating global reduction 1 with 2 rules applied. Total rules applied 524 place count 664 transition count 774
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 525 place count 663 transition count 773
Iterating global reduction 1 with 1 rules applied. Total rules applied 526 place count 663 transition count 773
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 527 place count 662 transition count 772
Iterating global reduction 1 with 1 rules applied. Total rules applied 528 place count 662 transition count 772
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 529 place count 661 transition count 771
Iterating global reduction 1 with 1 rules applied. Total rules applied 530 place count 661 transition count 771
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 531 place count 661 transition count 770
Applied a total of 531 rules in 900 ms. Remains 661 /925 variables (removed 264) and now considering 770/1037 (removed 267) transitions.
// Phase 1: matrix 770 rows 661 cols
[2025-06-08 12:25:51] [INFO ] Computed 4 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:25:51] [INFO ] Implicit Places using invariants in 484 ms returned []
[2025-06-08 12:25:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:25:52] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
Running 769 sub problems to find dead transitions.
[2025-06-08 12:25:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/660 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 1 (OVERLAPS) 1/661 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 769 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:15] [INFO ] Deduced a trap composed of 291 places in 491 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:16] [INFO ] Deduced a trap composed of 292 places in 435 ms of which 168 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:16] [INFO ] Deduced a trap composed of 317 places in 539 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:16] [INFO ] Deduced a trap composed of 328 places in 164 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:17] [INFO ] Deduced a trap composed of 321 places in 160 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:20] [INFO ] Deduced a trap composed of 297 places in 328 ms of which 150 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:21] [INFO ] Deduced a trap composed of 320 places in 244 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:21] [INFO ] Deduced a trap composed of 298 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:21] [INFO ] Deduced a trap composed of 299 places in 190 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:22] [INFO ] Deduced a trap composed of 318 places in 227 ms of which 75 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)timeout

(s53 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 661/1431 variables, and 14 constraints, problems are : Problem set: 0 solved, 769 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/661 constraints, PredecessorRefiner: 769/769 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 769 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/660 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 1 (OVERLAPS) 1/661 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 769 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/661 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 769 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:34] [INFO ] Deduced a trap composed of 291 places in 228 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:40] [INFO ] Deduced a trap composed of 317 places in 327 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:41] [INFO ] Deduced a trap composed of 321 places in 296 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:41] [INFO ] Deduced a trap composed of 325 places in 238 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:41] [INFO ] Deduced a trap composed of 325 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:42] [INFO ] Deduced a trap composed of 328 places in 179 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:44] [INFO ] Deduced a trap composed of 326 places in 198 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:44] [INFO ] Deduced a trap composed of 330 places in 165 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/661 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 769 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 661/1431 variables, and 22 constraints, problems are : Problem set: 0 solved, 769 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/661 constraints, PredecessorRefiner: 0/769 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60230ms problems are : Problem set: 0 solved, 769 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
Starting structural reductions in LTL mode, iteration 1 : 661/925 places, 770/1037 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62328 ms. Remains : 661/925 places, 770/1037 transitions.
Support contains 26 out of 661 places after structural reductions.
[2025-06-08 12:26:53] [INFO ] Flatten gal took : 108 ms
[2025-06-08 12:26:53] [INFO ] Flatten gal took : 82 ms
[2025-06-08 12:26:53] [INFO ] Input system was already deterministic with 770 transitions.
RANDOM walk for 40000 steps (627 resets) in 1074 ms. (37 steps per ms) remains 8/15 properties
BEST_FIRST walk for 40002 steps (163 resets) in 226 ms. (176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (164 resets) in 176 ms. (226 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (161 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (164 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (163 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (165 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (166 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (165 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
[2025-06-08 12:26:54] [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/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 634/647 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/647 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/661 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/661 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 770/1431 variables, 661/665 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1431 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/1431 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1431/1431 variables, and 665 constraints, problems are : Problem set: 0 solved, 8 unsolved in 947 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 661/661 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 634/647 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:55] [INFO ] Deduced a trap composed of 291 places in 292 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:55] [INFO ] Deduced a trap composed of 291 places in 205 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:26:56] [INFO ] Deduced a trap composed of 297 places in 239 ms of which 68 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/647 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 14/661 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/661 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 770/1431 variables, 661/668 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1431 variables, 8/676 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1431 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/1431 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1431/1431 variables, and 676 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3547 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 661/661 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4512ms problems are : Problem set: 0 solved, 8 unsolved
Finished Parikh walk after 349 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=174 )
Parikh walk visited 8 properties in 875 ms.
Computed a total of 133 stabilizing places and 139 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(p0)&&X(X(p1))))'
Support contains 4 out of 661 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 661/661 places, 770/770 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 651 transition count 760
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 651 transition count 760
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 643 transition count 752
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 643 transition count 752
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 637 transition count 746
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 637 transition count 746
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 637 transition count 745
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 632 transition count 740
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 632 transition count 740
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 64 place count 627 transition count 735
Iterating global reduction 1 with 5 rules applied. Total rules applied 69 place count 627 transition count 735
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 627 transition count 734
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 624 transition count 731
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 624 transition count 731
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 79 place count 621 transition count 728
Iterating global reduction 2 with 3 rules applied. Total rules applied 82 place count 621 transition count 728
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 618 transition count 725
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 618 transition count 725
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 616 transition count 723
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 616 transition count 723
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 614 transition count 721
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 614 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 612 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 612 transition count 719
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 610 transition count 717
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 610 transition count 717
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 105 place count 609 transition count 716
Iterating global reduction 2 with 1 rules applied. Total rules applied 106 place count 609 transition count 716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 107 place count 608 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 108 place count 608 transition count 715
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 607 transition count 714
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 607 transition count 714
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 606 transition count 713
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 606 transition count 713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 605 transition count 712
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 605 transition count 712
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 115 place count 604 transition count 711
Iterating global reduction 2 with 1 rules applied. Total rules applied 116 place count 604 transition count 711
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 117 place count 603 transition count 710
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 603 transition count 710
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 119 place count 603 transition count 709
Applied a total of 119 rules in 216 ms. Remains 603 /661 variables (removed 58) and now considering 709/770 (removed 61) transitions.
// Phase 1: matrix 709 rows 603 cols
[2025-06-08 12:27:00] [INFO ] Computed 4 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:27:00] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-06-08 12:27:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:27:00] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
Running 708 sub problems to find dead transitions.
[2025-06-08 12:27: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/602 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (OVERLAPS) 1/603 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:19] [INFO ] Deduced a trap composed of 289 places in 265 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:19] [INFO ] Deduced a trap composed of 290 places in 274 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:19] [INFO ] Deduced a trap composed of 290 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:20] [INFO ] Deduced a trap composed of 290 places in 251 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:20] [INFO ] Deduced a trap composed of 291 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:21] [INFO ] Deduced a trap composed of 296 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:23] [INFO ] Deduced a trap composed of 289 places in 153 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:23] [INFO ] Deduced a trap composed of 296 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:25] [INFO ] Deduced a trap composed of 291 places in 198 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:29] [INFO ] Deduced a trap composed of 291 places in 223 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:29] [INFO ] Deduced a trap composed of 290 places in 303 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:29] [INFO ] Deduced a trap composed of 296 places in 293 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:30] [INFO ] Deduced a trap composed of 297 places in 179 ms of which 23 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 603/1312 variables, and 17 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/603 constraints, PredecessorRefiner: 708/708 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 1 (OVERLAPS) 1/603 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 708 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/603 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:41] [INFO ] Deduced a trap composed of 297 places in 158 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:27:46] [INFO ] Deduced a trap composed of 297 places in 142 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/603 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 708 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 603/1312 variables, and 19 constraints, problems are : Problem set: 0 solved, 708 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/603 constraints, PredecessorRefiner: 0/708 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 708 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 603/661 places, 709/770 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61098 ms. Remains : 603/661 places, 709/770 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyB-PT-B01-LTLCardinality-02
Product exploration explored 100000 steps with 33333 reset in 237 ms.
Product exploration explored 100000 steps with 33333 reset in 192 ms.
Computed a total of 133 stabilizing places and 139 stable transitions
Computed a total of 133 stabilizing places and 139 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyB-PT-B01-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B01-LTLCardinality-02 finished in 61948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((!p0&&G(!p1))) U X(X(X(p2))))))'
Support contains 5 out of 661 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 661/661 places, 770/770 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 652 transition count 761
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 652 transition count 761
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 645 transition count 754
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 645 transition count 754
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 639 transition count 748
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 639 transition count 748
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 633 transition count 742
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 633 transition count 742
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 627 transition count 736
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 627 transition count 736
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 627 transition count 735
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 623 transition count 731
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 623 transition count 731
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 81 place count 619 transition count 727
Iterating global reduction 1 with 4 rules applied. Total rules applied 85 place count 619 transition count 727
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 615 transition count 723
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 615 transition count 723
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 612 transition count 720
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 612 transition count 720
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 102 place count 609 transition count 717
Iterating global reduction 1 with 3 rules applied. Total rules applied 105 place count 609 transition count 717
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 607 transition count 715
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 607 transition count 715
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 605 transition count 713
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 605 transition count 713
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 604 transition count 712
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 604 transition count 712
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 603 transition count 711
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 603 transition count 711
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 118 place count 602 transition count 710
Iterating global reduction 1 with 1 rules applied. Total rules applied 119 place count 602 transition count 710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 601 transition count 709
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 601 transition count 709
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 600 transition count 708
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 600 transition count 708
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 124 place count 599 transition count 707
Iterating global reduction 1 with 1 rules applied. Total rules applied 125 place count 599 transition count 707
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 126 place count 598 transition count 706
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 598 transition count 706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 128 place count 598 transition count 705
Applied a total of 128 rules in 201 ms. Remains 598 /661 variables (removed 63) and now considering 705/770 (removed 65) transitions.
// Phase 1: matrix 705 rows 598 cols
[2025-06-08 12:28:02] [INFO ] Computed 4 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:28:02] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-06-08 12:28:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:28:02] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Running 704 sub problems to find dead transitions.
[2025-06-08 12:28:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (OVERLAPS) 1/598 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:24] [INFO ] Deduced a trap composed of 290 places in 217 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:26] [INFO ] Deduced a trap composed of 290 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:29] [INFO ] Deduced a trap composed of 290 places in 218 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:29] [INFO ] Deduced a trap composed of 291 places in 290 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:29] [INFO ] Deduced a trap composed of 291 places in 201 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:30] [INFO ] Deduced a trap composed of 290 places in 289 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:30] [INFO ] Deduced a trap composed of 293 places in 292 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:30] [INFO ] Deduced a trap composed of 296 places in 223 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:31] [INFO ] Deduced a trap composed of 293 places in 278 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:31] [INFO ] Deduced a trap composed of 297 places in 202 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:31] [INFO ] Deduced a trap composed of 297 places in 175 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:32] [INFO ] Deduced a trap composed of 297 places in 207 ms of which 52 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/1303 variables, and 16 constraints, problems are : Problem set: 0 solved, 704 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/598 constraints, PredecessorRefiner: 704/704 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 704 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (OVERLAPS) 1/598 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:40] [INFO ] Deduced a trap composed of 291 places in 206 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:41] [INFO ] Deduced a trap composed of 296 places in 160 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:28:44] [INFO ] Deduced a trap composed of 294 places in 203 ms of which 63 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/598 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/1303 variables, and 19 constraints, problems are : Problem set: 0 solved, 704 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/598 constraints, PredecessorRefiner: 0/704 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 704 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 598/661 places, 705/770 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61068 ms. Remains : 598/661 places, 705/770 transitions.
Stuttering acceptance computed with spot in 881 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR p1 p0), p1]
Running random walk in product with property : MedleyB-PT-B01-LTLCardinality-04
Product exploration explored 100000 steps with 22248 reset in 179 ms.
Product exploration explored 100000 steps with 22248 reset in 163 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (OR p0 p1)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (OR p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 18 states, 41 edges and 3 AP (stutter sensitive) to 18 states, 41 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 773 ms :[(NOT p2), (AND p1 (NOT p2)), (NOT p2), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND p1 (NOT p2)), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND p1 (NOT p2)), (NOT p2), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (OR p0 p1), p1]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (667 resets) in 385 ms. (103 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (159 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (161 resets) in 365 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (164 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (163 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (164 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (162 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
[2025-06-08 12:29:05] [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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 579/584 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/598 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 705/1303 variables, 598/602 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1303 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/1303 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1303/1303 variables, and 602 constraints, problems are : Problem set: 0 solved, 6 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 598/598 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 579/584 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:06] [INFO ] Deduced a trap composed of 290 places in 204 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:06] [INFO ] Deduced a trap composed of 297 places in 141 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 2/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 14/598 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 705/1303 variables, 598/604 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1303 variables, 4/608 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1303 variables, 0/608 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/1303 variables, 0/608 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1303/1303 variables, and 608 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1495 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 598/598 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2189ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 429 ms.
Support contains 5 out of 598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 598/598 places, 705/705 transitions.
Graph (trivial) has 588 edges and 598 vertex of which 41 / 598 are part of one of the 8 SCC in 3 ms
Free SCC test removed 33 places
Drop transitions (Empty/Sink Transition effects.) removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Graph (complete) has 837 edges and 565 vertex of which 562 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 412 transitions
Trivial Post-agglo rules discarded 412 transitions
Performed 412 trivial Post agglomeration. Transition count delta: 412
Iterating post reduction 0 with 415 rules applied. Total rules applied 417 place count 562 transition count 244
Reduce places removed 412 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 1 with 424 rules applied. Total rules applied 841 place count 150 transition count 232
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 8 rules applied. Total rules applied 849 place count 145 transition count 229
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 852 place count 142 transition count 229
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 852 place count 142 transition count 194
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 922 place count 107 transition count 194
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 923 place count 107 transition count 193
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 967 place count 85 transition count 171
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 972 place count 85 transition count 166
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 990 place count 67 transition count 111
Iterating global reduction 6 with 18 rules applied. Total rules applied 1008 place count 67 transition count 111
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 1018 place count 67 transition count 101
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1026 place count 59 transition count 93
Iterating global reduction 7 with 8 rules applied. Total rules applied 1034 place count 59 transition count 93
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1040 place count 53 transition count 87
Iterating global reduction 7 with 6 rules applied. Total rules applied 1046 place count 53 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1049 place count 53 transition count 84
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1057 place count 49 transition count 80
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 1067 place count 44 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1068 place count 44 transition count 106
Free-agglomeration rule applied 15 times with reduction of 11 identical transitions.
Iterating global reduction 9 with 15 rules applied. Total rules applied 1083 place count 44 transition count 80
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 1105 place count 29 transition count 73
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1108 place count 26 transition count 70
Iterating global reduction 10 with 3 rules applied. Total rules applied 1111 place count 26 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1112 place count 26 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 11 with 12 rules applied. Total rules applied 1124 place count 26 transition count 57
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1126 place count 26 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1127 place count 26 transition count 56
Applied a total of 1127 rules in 66 ms. Remains 26 /598 variables (removed 572) and now considering 56/705 (removed 649) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 26/598 places, 56/705 transitions.
RANDOM walk for 3172 steps (95 resets) in 56 ms. (55 steps per ms) remains 0/4 properties
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (OR p0 p1)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (OR p0 p1))), (X (X p1)), (G (OR p1 p0)), (G (OR p1 p0)), (G (OR p1 p0 p2))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (OR (NOT p1) p2) (OR (NOT p0) p2)))), (F (NOT p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p2)))
Knowledge based reduction with 12 factoid took 134 ms. Reduced automaton from 18 states, 41 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyB-PT-B01-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B01-LTLCardinality-04 finished in 66552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(F(p0))))||F(p1))))'
Support contains 3 out of 661 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 661/661 places, 770/770 transitions.
Graph (trivial) has 653 edges and 661 vertex of which 50 / 661 are part of one of the 9 SCC in 4 ms
Free SCC test removed 41 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 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 460 place count 619 transition count 264
Reduce places removed 459 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 468 rules applied. Total rules applied 928 place count 160 transition count 255
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 932 place count 157 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 933 place count 156 transition count 254
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 32 Pre rules applied. Total rules applied 933 place count 156 transition count 222
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 997 place count 124 transition count 222
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1003 place count 118 transition count 216
Iterating global reduction 4 with 6 rules applied. Total rules applied 1009 place count 118 transition count 216
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1009 place count 118 transition count 213
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1015 place count 115 transition count 213
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1017 place count 113 transition count 211
Iterating global reduction 4 with 2 rules applied. Total rules applied 1019 place count 113 transition count 211
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 1063 place count 91 transition count 188
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1080 place count 74 transition count 137
Iterating global reduction 4 with 17 rules applied. Total rules applied 1097 place count 74 transition count 137
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1106 place count 74 transition count 128
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1114 place count 66 transition count 118
Iterating global reduction 5 with 8 rules applied. Total rules applied 1122 place count 66 transition count 118
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1130 place count 58 transition count 108
Iterating global reduction 5 with 8 rules applied. Total rules applied 1138 place count 58 transition count 108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1141 place count 58 transition count 105
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 1157 place count 50 transition count 117
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1158 place count 49 transition count 109
Iterating global reduction 6 with 1 rules applied. Total rules applied 1159 place count 49 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1160 place count 49 transition count 108
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1164 place count 49 transition count 104
Applied a total of 1164 rules in 54 ms. Remains 49 /661 variables (removed 612) and now considering 104/770 (removed 666) transitions.
[2025-06-08 12:29:08] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
// Phase 1: matrix 99 rows 49 cols
[2025-06-08 12:29:08] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:29:08] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-08 12:29:08] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2025-06-08 12:29:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:29:08] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-08 12:29:08] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:29:08] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2025-06-08 12:29:08] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2025-06-08 12:29:08] [INFO ] Invariant cache hit.
[2025-06-08 12:29:08] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:08] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:09] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:09] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:09] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:09] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:09] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:09] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:09] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:09] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 98/147 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/148 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 79 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4101 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 98/147 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 95/173 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/148 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 174 constraints, problems are : Problem set: 0 solved, 95 unsolved in 7786 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11916ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 11916ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/661 places, 104/770 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12086 ms. Remains : 49/661 places, 104/770 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyB-PT-B01-LTLCardinality-05
Product exploration explored 100000 steps with 183 reset in 76 ms.
Product exploration explored 100000 steps with 111 reset in 69 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 24128 steps (3965 resets) in 355 ms. (67 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 104/104 transitions.
Applied a total of 0 rules in 8 ms. Remains 49 /49 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2025-06-08 12:29:21] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2025-06-08 12:29:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:29:21] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-08 12:29:21] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2025-06-08 12:29:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:29:21] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-08 12:29:21] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:29:21] [INFO ] Redundant transitions in 2 ms returned []
Running 95 sub problems to find dead transitions.
[2025-06-08 12:29:21] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2025-06-08 12:29:21] [INFO ] Invariant cache hit.
[2025-06-08 12:29:21] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:21] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:22] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:22] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:22] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:22] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:22] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:22] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:22] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:22] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 98/147 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/148 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 79 constraints, problems are : Problem set: 0 solved, 95 unsolved in 4141 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/49 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 98/147 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 18/78 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 95/173 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 1/148 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 174 constraints, problems are : Problem set: 0 solved, 95 unsolved in 7541 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 49/49 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11701ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 11702ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11828 ms. Remains : 49/49 places, 104/104 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 10853 steps (1801 resets) in 41 ms. (258 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 1818 steps with 301 reset in 7 ms.
FORMULA MedleyB-PT-B01-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLCardinality-05 finished in 25656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 661 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 661/661 places, 770/770 transitions.
Graph (trivial) has 655 edges and 661 vertex of which 48 / 661 are part of one of the 9 SCC in 2 ms
Free SCC test removed 39 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 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 464 place count 621 transition count 262
Reduce places removed 463 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 1 with 474 rules applied. Total rules applied 938 place count 158 transition count 251
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 942 place count 154 transition count 251
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 942 place count 154 transition count 221
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1002 place count 124 transition count 221
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1009 place count 117 transition count 214
Iterating global reduction 3 with 7 rules applied. Total rules applied 1016 place count 117 transition count 214
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1016 place count 117 transition count 211
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 1022 place count 114 transition count 211
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1024 place count 112 transition count 209
Iterating global reduction 3 with 2 rules applied. Total rules applied 1026 place count 112 transition count 209
Performed 22 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 1070 place count 90 transition count 186
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1088 place count 72 transition count 134
Iterating global reduction 3 with 18 rules applied. Total rules applied 1106 place count 72 transition count 134
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 1115 place count 72 transition count 125
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1124 place count 63 transition count 114
Iterating global reduction 4 with 9 rules applied. Total rules applied 1133 place count 63 transition count 114
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1142 place count 54 transition count 103
Iterating global reduction 4 with 9 rules applied. Total rules applied 1151 place count 54 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1154 place count 54 transition count 100
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1170 place count 46 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1171 place count 45 transition count 104
Iterating global reduction 5 with 1 rules applied. Total rules applied 1172 place count 45 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1173 place count 45 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 1177 place count 45 transition count 99
Applied a total of 1177 rules in 37 ms. Remains 45 /661 variables (removed 616) and now considering 99/770 (removed 671) transitions.
[2025-06-08 12:29:34] [INFO ] Flow matrix only has 94 transitions (discarded 5 similar events)
// Phase 1: matrix 94 rows 45 cols
[2025-06-08 12:29:34] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:29:34] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-08 12:29:34] [INFO ] Flow matrix only has 94 transitions (discarded 5 similar events)
[2025-06-08 12:29:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:29:34] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-08 12:29:34] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:29:34] [INFO ] Redundant transitions in 1 ms returned []
Running 86 sub problems to find dead transitions.
[2025-06-08 12:29:34] [INFO ] Flow matrix only has 94 transitions (discarded 5 similar events)
[2025-06-08 12:29:34] [INFO ] Invariant cache hit.
[2025-06-08 12:29:34] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:34] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:34] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:34] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:34] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:34] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:34] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:34] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:35] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:29:35] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 93/138 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 72 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3398 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 1/45 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 93/138 variables, 45/56 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 86/157 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 158 constraints, problems are : Problem set: 0 solved, 86 unsolved in 6377 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 45/45 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9794ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 9794ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/661 places, 99/770 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9960 ms. Remains : 45/661 places, 99/770 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B01-LTLCardinality-07
Stuttering criterion allowed to conclude after 14 steps with 2 reset in 0 ms.
FORMULA MedleyB-PT-B01-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLCardinality-07 finished in 10062 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))||(p1 U X(X(X(G(p2)))))))'
Support contains 5 out of 661 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 661/661 places, 770/770 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 652 transition count 761
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 652 transition count 761
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 645 transition count 754
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 645 transition count 754
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 640 transition count 749
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 640 transition count 749
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 640 transition count 748
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 636 transition count 744
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 636 transition count 744
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 632 transition count 740
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 632 transition count 740
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 628 transition count 736
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 628 transition count 736
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 624 transition count 732
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 624 transition count 732
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 79 place count 620 transition count 728
Iterating global reduction 1 with 4 rules applied. Total rules applied 83 place count 620 transition count 728
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 617 transition count 725
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 617 transition count 725
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 614 transition count 722
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 614 transition count 722
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 612 transition count 720
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 612 transition count 720
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 610 transition count 718
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 610 transition count 718
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 609 transition count 717
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 609 transition count 717
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 608 transition count 716
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 608 transition count 716
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 108 place count 607 transition count 715
Iterating global reduction 1 with 1 rules applied. Total rules applied 109 place count 607 transition count 715
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 110 place count 606 transition count 714
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 606 transition count 714
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 112 place count 605 transition count 713
Iterating global reduction 1 with 1 rules applied. Total rules applied 113 place count 605 transition count 713
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 604 transition count 712
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 604 transition count 712
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 603 transition count 711
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 603 transition count 711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 118 place count 603 transition count 710
Applied a total of 118 rules in 264 ms. Remains 603 /661 variables (removed 58) and now considering 710/770 (removed 60) transitions.
// Phase 1: matrix 710 rows 603 cols
[2025-06-08 12:29:44] [INFO ] Computed 4 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:29:44] [INFO ] Implicit Places using invariants in 344 ms returned []
[2025-06-08 12:29:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:29:45] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
Running 709 sub problems to find dead transitions.
[2025-06-08 12:29:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (OVERLAPS) 1/603 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:06] [INFO ] Deduced a trap composed of 289 places in 233 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:07] [INFO ] Deduced a trap composed of 297 places in 152 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:08] [INFO ] Deduced a trap composed of 291 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:09] [INFO ] Deduced a trap composed of 289 places in 301 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:10] [INFO ] Deduced a trap composed of 290 places in 290 ms of which 137 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:10] [INFO ] Deduced a trap composed of 290 places in 279 ms of which 123 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:11] [INFO ] Deduced a trap composed of 297 places in 223 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:11] [INFO ] Deduced a trap composed of 297 places in 172 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:14] [INFO ] Deduced a trap composed of 296 places in 324 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:14] [INFO ] Deduced a trap composed of 297 places in 209 ms of which 57 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 603/1313 variables, and 14 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/603 constraints, PredecessorRefiner: 709/709 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 709 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 1 (OVERLAPS) 1/603 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 709 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/603 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:28] [INFO ] Deduced a trap composed of 290 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:31] [INFO ] Deduced a trap composed of 300 places in 207 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:31] [INFO ] Deduced a trap composed of 297 places in 154 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/603 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:35] [INFO ] Deduced a trap composed of 301 places in 203 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:30:43] [INFO ] Deduced a trap composed of 307 places in 182 ms of which 25 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/603 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 709 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 603/1313 variables, and 19 constraints, problems are : Problem set: 0 solved, 709 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/603 constraints, PredecessorRefiner: 0/709 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 709 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 603/661 places, 710/770 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61295 ms. Remains : 603/661 places, 710/770 transitions.
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : MedleyB-PT-B01-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Product exploration explored 100000 steps with 50000 reset in 193 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 18 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyB-PT-B01-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B01-LTLCardinality-08 finished in 61980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p0 U (G(p0)||((X(X(p1)) U ((!p1&&X(X(p1)))||X(X(G(p1))))) U (G((X(X(p1)) U ((!p1&&X(X(p1)))||X(X(G(p1))))))||(!p2&&(X(X(p1)) U ((!p1&&X(X(p1)))||X(X(G(p1))))))))))))))'
Support contains 5 out of 661 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 661/661 places, 770/770 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 652 transition count 761
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 652 transition count 761
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 645 transition count 754
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 645 transition count 754
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 640 transition count 749
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 640 transition count 749
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 640 transition count 748
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 636 transition count 744
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 636 transition count 744
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 55 place count 632 transition count 740
Iterating global reduction 1 with 4 rules applied. Total rules applied 59 place count 632 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 632 transition count 739
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 630 transition count 737
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 630 transition count 737
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 66 place count 628 transition count 735
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 628 transition count 735
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 626 transition count 733
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 626 transition count 733
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 624 transition count 731
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 624 transition count 731
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 622 transition count 729
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 622 transition count 729
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 621 transition count 728
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 621 transition count 728
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 620 transition count 727
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 620 transition count 727
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 619 transition count 726
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 619 transition count 726
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 618 transition count 725
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 618 transition count 725
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 617 transition count 724
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 617 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 616 transition count 723
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 616 transition count 723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 615 transition count 722
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 615 transition count 722
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 614 transition count 721
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 614 transition count 721
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 613 transition count 720
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 613 transition count 720
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 613 transition count 719
Applied a total of 99 rules in 280 ms. Remains 613 /661 variables (removed 48) and now considering 719/770 (removed 51) transitions.
// Phase 1: matrix 719 rows 613 cols
[2025-06-08 12:30:46] [INFO ] Computed 4 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:30:46] [INFO ] Implicit Places using invariants in 273 ms returned []
[2025-06-08 12:30:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:30:47] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Running 718 sub problems to find dead transitions.
[2025-06-08 12:30:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 718 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:06] [INFO ] Deduced a trap composed of 290 places in 290 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:06] [INFO ] Deduced a trap composed of 291 places in 293 ms of which 149 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:06] [INFO ] Deduced a trap composed of 297 places in 187 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:07] [INFO ] Deduced a trap composed of 298 places in 183 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:07] [INFO ] Deduced a trap composed of 305 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:07] [INFO ] Deduced a trap composed of 290 places in 155 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:07] [INFO ] Deduced a trap composed of 291 places in 147 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:10] [INFO ] Deduced a trap composed of 296 places in 162 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:10] [INFO ] Deduced a trap composed of 296 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:11] [INFO ] Deduced a trap composed of 297 places in 224 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:11] [INFO ] Deduced a trap composed of 298 places in 207 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:12] [INFO ] Deduced a trap composed of 305 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:14] [INFO ] Deduced a trap composed of 297 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:16] [INFO ] Deduced a trap composed of 303 places in 208 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:16] [INFO ] Deduced a trap composed of 303 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:17] [INFO ] Deduced a trap composed of 302 places in 156 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:17] [INFO ] Deduced a trap composed of 302 places in 134 ms of which 11 ms to minimize.
SMT process timed out in 30166ms, After SMT, problems are : Problem set: 0 solved, 718 unsolved
Search for dead transitions found 0 dead transitions in 30170ms
Starting structural reductions in LTL mode, iteration 1 : 613/661 places, 719/770 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31259 ms. Remains : 613/661 places, 719/770 transitions.
Stuttering acceptance computed with spot in 765 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B01-LTLCardinality-12
Product exploration explored 100000 steps with 1687 reset in 145 ms.
Product exploration explored 100000 steps with 959 reset in 140 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 171 ms. Reduced automaton from 16 states, 41 edges and 3 AP (stutter sensitive) to 16 states, 40 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 781 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (650 resets) in 180 ms. (220 steps per ms) remains 8/17 properties
BEST_FIRST walk for 40002 steps (165 resets) in 92 ms. (430 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (160 resets) in 101 ms. (392 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (160 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (159 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (161 resets) in 80 ms. (493 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (162 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (160 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
[2025-06-08 12:31:19] [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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 402/407 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 206/613 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 719/1332 variables, 613/617 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1332 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/1332 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1332/1332 variables, and 617 constraints, problems are : Problem set: 0 solved, 7 unsolved in 851 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 613/613 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 402/407 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 206/613 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 719/1332 variables, 613/617 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1332 variables, 6/623 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1332 variables, 0/623 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1332 variables, 0/623 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1332/1332 variables, and 623 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1681 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 613/613 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2542ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 96 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=32 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 p2))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p2)), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 904 ms. Reduced automaton from 16 states, 40 edges and 3 AP (stutter sensitive) to 15 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 668 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 693 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 719/719 transitions.
Applied a total of 0 rules in 19 ms. Remains 613 /613 variables (removed 0) and now considering 719/719 (removed 0) transitions.
[2025-06-08 12:31:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:31:24] [INFO ] Implicit Places using invariants in 273 ms returned []
[2025-06-08 12:31:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:31:25] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
Running 718 sub problems to find dead transitions.
[2025-06-08 12:31:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 718 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:44] [INFO ] Deduced a trap composed of 290 places in 307 ms of which 125 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:44] [INFO ] Deduced a trap composed of 291 places in 330 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:45] [INFO ] Deduced a trap composed of 297 places in 221 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:45] [INFO ] Deduced a trap composed of 298 places in 209 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:45] [INFO ] Deduced a trap composed of 305 places in 175 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:46] [INFO ] Deduced a trap composed of 290 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:46] [INFO ] Deduced a trap composed of 291 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:49] [INFO ] Deduced a trap composed of 296 places in 171 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:49] [INFO ] Deduced a trap composed of 296 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:49] [INFO ] Deduced a trap composed of 297 places in 220 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:50] [INFO ] Deduced a trap composed of 298 places in 221 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:50] [INFO ] Deduced a trap composed of 305 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:53] [INFO ] Deduced a trap composed of 297 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:54] [INFO ] Deduced a trap composed of 303 places in 232 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:54] [INFO ] Deduced a trap composed of 303 places in 183 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:31:55] [INFO ] Deduced a trap composed of 302 places in 167 ms of which 20 ms to minimize.
SMT process timed out in 30202ms, After SMT, problems are : Problem set: 0 solved, 718 unsolved
Search for dead transitions found 0 dead transitions in 30206ms
Finished structural reductions in LTL mode , in 1 iterations and 31026 ms. Remains : 613/613 places, 719/719 transitions.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 137 ms. Reduced automaton from 15 states, 36 edges and 3 AP (stutter sensitive) to 15 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 575 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (649 resets) in 206 ms. (193 steps per ms) remains 6/14 properties
BEST_FIRST walk for 40002 steps (165 resets) in 47 ms. (833 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (161 resets) in 81 ms. (487 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (159 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (159 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (167 resets) in 32 ms. (1212 steps per ms) remains 5/5 properties
[2025-06-08 12:31:56] [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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 402/407 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 206/613 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 719/1332 variables, 613/617 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1332 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/1332 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1332/1332 variables, and 617 constraints, problems are : Problem set: 0 solved, 5 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 613/613 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 402/407 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/407 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 206/613 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 719/1332 variables, 613/617 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1332 variables, 5/622 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1332 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1332 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1332/1332 variables, and 622 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1465 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 613/613 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2126ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 318 ms.
Support contains 5 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 719/719 transitions.
Graph (trivial) has 602 edges and 613 vertex of which 48 / 613 are part of one of the 9 SCC in 1 ms
Free SCC test removed 39 places
Drop transitions (Empty/Sink Transition effects.) removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Graph (complete) has 845 edges and 574 vertex of which 571 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 425 transitions
Trivial Post-agglo rules discarded 425 transitions
Performed 425 trivial Post agglomeration. Transition count delta: 425
Iterating post reduction 0 with 428 rules applied. Total rules applied 430 place count 571 transition count 237
Reduce places removed 425 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 434 rules applied. Total rules applied 864 place count 146 transition count 228
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 870 place count 143 transition count 225
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 873 place count 140 transition count 225
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 873 place count 140 transition count 192
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 939 place count 107 transition count 192
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 985 place count 84 transition count 169
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 992 place count 84 transition count 162
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1010 place count 66 transition count 107
Iterating global reduction 5 with 18 rules applied. Total rules applied 1028 place count 66 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1034 place count 66 transition count 101
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1043 place count 57 transition count 92
Iterating global reduction 6 with 9 rules applied. Total rules applied 1052 place count 57 transition count 92
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1058 place count 51 transition count 86
Iterating global reduction 6 with 6 rules applied. Total rules applied 1064 place count 51 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1067 place count 51 transition count 83
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1073 place count 48 transition count 80
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1081 place count 44 transition count 107
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 1082 place count 44 transition count 106
Free-agglomeration rule applied 16 times with reduction of 11 identical transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1098 place count 44 transition count 79
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 1121 place count 28 transition count 72
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1124 place count 25 transition count 69
Iterating global reduction 8 with 3 rules applied. Total rules applied 1127 place count 25 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1129 place count 25 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 1151 place count 25 transition count 45
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1153 place count 25 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1154 place count 25 transition count 44
Applied a total of 1154 rules in 30 ms. Remains 25 /613 variables (removed 588) and now considering 44/719 (removed 675) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 25/613 places, 44/719 transitions.
RANDOM walk for 1082 steps (60 resets) in 8 ms. (120 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p2 p1), (X (X p2)), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 p1))), (F (NOT (AND p0 p2))), (F (NOT (OR p0 (NOT p2)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 8 factoid took 674 ms. Reduced automaton from 15 states, 36 edges and 3 AP (stutter sensitive) to 15 states, 36 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 677 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 692 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 710 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1702 reset in 147 ms.
Product exploration explored 100000 steps with 1674 reset in 148 ms.
Applying partial POR strategy [false, false, true, false, false, false, false, false, false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 603 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 719/719 transitions.
Graph (trivial) has 602 edges and 613 vertex of which 48 / 613 are part of one of the 9 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Performed 422 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 422 rules applied. Total rules applied 423 place count 574 transition count 674
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 429 place count 574 transition count 668
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 429 place count 574 transition count 671
Deduced a syphon composed of 447 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 454 place count 574 transition count 671
Discarding 378 places :
Symmetric choice reduction at 2 with 378 rule applications. Total rules 832 place count 196 transition count 293
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 2 with 378 rules applied. Total rules applied 1210 place count 196 transition count 293
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 1243 place count 196 transition count 302
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 1297 place count 142 transition count 208
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 1351 place count 142 transition count 208
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1358 place count 142 transition count 201
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 1381 place count 119 transition count 175
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 3 with 23 rules applied. Total rules applied 1404 place count 119 transition count 175
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1413 place count 110 transition count 166
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 1422 place count 110 transition count 166
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1425 place count 110 transition count 163
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1431 place count 104 transition count 157
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1437 place count 104 transition count 157
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1444 place count 104 transition count 199
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1453 place count 95 transition count 181
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 1462 place count 95 transition count 181
Deduced a syphon composed of 46 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 1468 place count 95 transition count 175
Deduced a syphon composed of 46 places in 0 ms
Applied a total of 1468 rules in 50 ms. Remains 95 /613 variables (removed 518) and now considering 175/719 (removed 544) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:32:02] [INFO ] Redundant transitions in 4 ms returned []
Running 167 sub problems to find dead transitions.
[2025-06-08 12:32:02] [INFO ] Flow matrix only has 171 transitions (discarded 4 similar events)
// Phase 1: matrix 171 rows 95 cols
[2025-06-08 12:32:02] [INFO ] Computed 2 invariants in 3 ms
[2025-06-08 12:32:02] [INFO ] State equation strengthened by 36 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:03] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:04] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:04] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:04] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
Problem TDEAD105 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:04] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:04] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:04] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 3 ms to minimize.
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD2 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 7/9 constraints. Problems are: Problem set: 10 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 10 solved, 157 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
At refinement iteration 4 (OVERLAPS) 170/265 variables, 95/104 constraints. Problems are: Problem set: 71 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 35/139 constraints. Problems are: Problem set: 71 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/139 constraints. Problems are: Problem set: 71 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 1/266 variables, 1/140 constraints. Problems are: Problem set: 71 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:08] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 1/141 constraints. Problems are: Problem set: 71 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/141 constraints. Problems are: Problem set: 71 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/266 variables, 0/141 constraints. Problems are: Problem set: 71 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 141 constraints, problems are : Problem set: 71 solved, 96 unsolved in 9814 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 71 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 71 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 47/95 variables, 2/2 constraints. Problems are: Problem set: 71 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 8/10 constraints. Problems are: Problem set: 71 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/10 constraints. Problems are: Problem set: 71 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 170/265 variables, 95/105 constraints. Problems are: Problem set: 71 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 35/140 constraints. Problems are: Problem set: 71 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 96/236 constraints. Problems are: Problem set: 71 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:15] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 1/237 constraints. Problems are: Problem set: 71 solved, 96 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:32:17] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/265 variables, 1/238 constraints. Problems are: Problem set: 71 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 0/238 constraints. Problems are: Problem set: 71 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 1/266 variables, 1/239 constraints. Problems are: Problem set: 71 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/266 variables, 0/239 constraints. Problems are: Problem set: 71 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/266 variables, 0/239 constraints. Problems are: Problem set: 71 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 239 constraints, problems are : Problem set: 71 solved, 96 unsolved in 16283 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 96/167 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26124ms problems are : Problem set: 71 solved, 96 unsolved
Search for dead transitions found 71 dead transitions in 26124ms
Found 71 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 71 transitions
Dead transitions reduction (with SMT) removed 71 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 95/613 places, 104/719 transitions.
Graph (complete) has 199 edges and 95 vertex of which 49 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.1 ms
Discarding 46 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 49 /95 variables (removed 46) and now considering 104/104 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/613 places, 104/719 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 26208 ms. Remains : 49/613 places, 104/719 transitions.
Built C files in :
/tmp/ltsmin7186245468701968185
[2025-06-08 12:32:29] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7186245468701968185
Running compilation step : cd /tmp/ltsmin7186245468701968185;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1195 ms.
Running link step : cd /tmp/ltsmin7186245468701968185;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin7186245468701968185;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2754384610236245605.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 719/719 transitions.
Applied a total of 0 rules in 19 ms. Remains 613 /613 variables (removed 0) and now considering 719/719 (removed 0) transitions.
// Phase 1: matrix 719 rows 613 cols
[2025-06-08 12:32:44] [INFO ] Computed 4 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:32:44] [INFO ] Implicit Places using invariants in 244 ms returned []
[2025-06-08 12:32:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:32:44] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
Running 718 sub problems to find dead transitions.
[2025-06-08 12:32:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 718 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:03] [INFO ] Deduced a trap composed of 290 places in 274 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:04] [INFO ] Deduced a trap composed of 291 places in 317 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:04] [INFO ] Deduced a trap composed of 297 places in 189 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:04] [INFO ] Deduced a trap composed of 298 places in 196 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:04] [INFO ] Deduced a trap composed of 305 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:05] [INFO ] Deduced a trap composed of 290 places in 162 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:05] [INFO ] Deduced a trap composed of 291 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:08] [INFO ] Deduced a trap composed of 296 places in 153 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:08] [INFO ] Deduced a trap composed of 296 places in 151 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:09] [INFO ] Deduced a trap composed of 297 places in 203 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:09] [INFO ] Deduced a trap composed of 298 places in 195 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:09] [INFO ] Deduced a trap composed of 305 places in 150 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:12] [INFO ] Deduced a trap composed of 297 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:13] [INFO ] Deduced a trap composed of 303 places in 196 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:13] [INFO ] Deduced a trap composed of 303 places in 157 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:14] [INFO ] Deduced a trap composed of 302 places in 158 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:33:14] [INFO ] Deduced a trap composed of 302 places in 135 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1332 variables, and 21 constraints, problems are : Problem set: 0 solved, 718 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/613 constraints, PredecessorRefiner: 718/718 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 718 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 1 (OVERLAPS) 1/613 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 4 (OVERLAPS) 719/1332 variables, 613/634 constraints. Problems are: Problem set: 0 solved, 718 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1332 variables, 718/1352 constraints. Problems are: Problem set: 0 solved, 718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1332/1332 variables, and 1352 constraints, problems are : Problem set: 0 solved, 718 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 613/613 constraints, PredecessorRefiner: 718/718 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 718 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Finished structural reductions in LTL mode , in 1 iterations and 60909 ms. Remains : 613/613 places, 719/719 transitions.
Built C files in :
/tmp/ltsmin9467683039532684568
[2025-06-08 12:33:45] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9467683039532684568
Running compilation step : cd /tmp/ltsmin9467683039532684568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1053 ms.
Running link step : cd /tmp/ltsmin9467683039532684568;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9467683039532684568;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6110536674897976707.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-08 12:34:00] [INFO ] Flatten gal took : 27 ms
[2025-06-08 12:34:00] [INFO ] Flatten gal took : 24 ms
[2025-06-08 12:34:00] [INFO ] Time to serialize gal into /tmp/LTL18340495094786090613.gal : 6 ms
[2025-06-08 12:34:00] [INFO ] Time to serialize properties into /tmp/LTL8875882099513602776.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/LTL18340495094786090613.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14869109452025303908.hoa' '-atoms' '/tmp/LTL8875882099513602776.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/LTL8875882099513602776.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14869109452025303908.hoa
Detected timeout of ITS tools.
[2025-06-08 12:34:15] [INFO ] Flatten gal took : 24 ms
[2025-06-08 12:34:15] [INFO ] Flatten gal took : 22 ms
[2025-06-08 12:34:15] [INFO ] Time to serialize gal into /tmp/LTL3076720567202178585.gal : 4 ms
[2025-06-08 12:34:15] [INFO ] Time to serialize properties into /tmp/LTL1157326117772812437.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3076720567202178585.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1157326117772812437.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(("(p135!=1)")&&(X(("(p135!=1)")U((G("(p135!=1)"))||(((X(X("((p753==0)||(p746==1))")))U((X(X(G("((p753==0)||(p746==1))"))))||((!("...543
Formula 0 simplified : X(!"(p135!=1)" | X(!"(p135!=1)" M ("((p656==0)||(p170==1))" U (XX!"((p753==0)||(p746==1))" R (XXF!"((p753==0)||(p746==1))" & ("((p75...209
Detected timeout of ITS tools.
[2025-06-08 12:34:30] [INFO ] Flatten gal took : 22 ms
[2025-06-08 12:34:30] [INFO ] Applying decomposition
[2025-06-08 12:34:30] [INFO ] Flatten gal took : 23 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/graph4017288808785472947.txt' '-o' '/tmp/graph4017288808785472947.bin' '-w' '/tmp/graph4017288808785472947.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4017288808785472947.bin' '-l' '-1' '-v' '-w' '/tmp/graph4017288808785472947.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:34:30] [INFO ] Decomposing Gal with order
[2025-06-08 12:34:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:34:30] [INFO ] Removed a total of 384 redundant transitions.
[2025-06-08 12:34:30] [INFO ] Flatten gal took : 133 ms
[2025-06-08 12:34:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 14 ms.
[2025-06-08 12:34:30] [INFO ] Time to serialize gal into /tmp/LTL12471421519008381216.gal : 9 ms
[2025-06-08 12:34:30] [INFO ] Time to serialize properties into /tmp/LTL15968842399275931492.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/LTL12471421519008381216.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15968842399275931492.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 : !((X(("(i4.u47.p135!=1)")&&(X(("(i4.u47.p135!=1)")U((G("(i4.u47.p135!=1)"))||(((X(X("((i25.u214.p753==0)||(i25.u211.p746==1))")))U((X(...796
Formula 0 simplified : X(!"(i4.u47.p135!=1)" | X(!"(i4.u47.p135!=1)" M ("((i21.u180.p656==0)||(i6.u56.p170==1))" U (XX!"((i25.u214.p753==0)||(i25.u211.p746...311
Reverse transition relation is NOT exact ! Due to transitions t117, t175, t231, t293, t348, t404, t443, t477, t547, t603, t620, t626, t629, t634, t637, t63...530
Computing Next relation with stutter on 6502 deadlock states
Detected timeout of ITS tools.
Treatment of property MedleyB-PT-B01-LTLCardinality-12 finished in 239974 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 661 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 661/661 places, 770/770 transitions.
Graph (trivial) has 656 edges and 661 vertex of which 51 / 661 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 461 transitions
Trivial Post-agglo rules discarded 461 transitions
Performed 461 trivial Post agglomeration. Transition count delta: 461
Iterating post reduction 0 with 461 rules applied. Total rules applied 462 place count 618 transition count 260
Reduce places removed 461 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 1 with 472 rules applied. Total rules applied 934 place count 157 transition count 249
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 939 place count 153 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 940 place count 152 transition count 248
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 940 place count 152 transition count 218
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1000 place count 122 transition count 218
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1006 place count 116 transition count 212
Iterating global reduction 4 with 6 rules applied. Total rules applied 1012 place count 116 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1012 place count 116 transition count 210
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1016 place count 114 transition count 210
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1018 place count 112 transition count 208
Iterating global reduction 4 with 2 rules applied. Total rules applied 1020 place count 112 transition count 208
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1066 place count 89 transition count 184
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1085 place count 70 transition count 130
Iterating global reduction 4 with 19 rules applied. Total rules applied 1104 place count 70 transition count 130
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1113 place count 70 transition count 121
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1123 place count 60 transition count 108
Iterating global reduction 5 with 10 rules applied. Total rules applied 1133 place count 60 transition count 108
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 1143 place count 50 transition count 95
Iterating global reduction 5 with 10 rules applied. Total rules applied 1153 place count 50 transition count 95
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1157 place count 50 transition count 91
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1171 place count 43 transition count 100
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1172 place count 42 transition count 94
Iterating global reduction 6 with 1 rules applied. Total rules applied 1173 place count 42 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1174 place count 42 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1177 place count 42 transition count 90
Applied a total of 1177 rules in 24 ms. Remains 42 /661 variables (removed 619) and now considering 90/770 (removed 680) transitions.
[2025-06-08 12:34:46] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
// Phase 1: matrix 87 rows 42 cols
[2025-06-08 12:34:46] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:34:46] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-08 12:34:46] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2025-06-08 12:34:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 12:34:46] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-08 12:34:46] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 12:34:46] [INFO ] Redundant transitions in 1 ms returned []
Running 81 sub problems to find dead transitions.
[2025-06-08 12:34:46] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2025-06-08 12:34:46] [INFO ] Invariant cache hit.
[2025-06-08 12:34:46] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:46] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:46] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:46] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:46] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:46] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:46] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 86/128 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/129 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 63 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2871 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 86/128 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 81/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/129 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:51] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:53] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 12:34:53] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/129 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 14 (OVERLAPS) 0/129 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 147 constraints, problems are : Problem set: 0 solved, 81 unsolved in 8012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10906ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 10907ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/661 places, 90/770 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11054 ms. Remains : 42/661 places, 90/770 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : MedleyB-PT-B01-LTLCardinality-15
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B01-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B01-LTLCardinality-15 finished in 11122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p0 U (G(p0)||((X(X(p1)) U ((!p1&&X(X(p1)))||X(X(G(p1))))) U (G((X(X(p1)) U ((!p1&&X(X(p1)))||X(X(G(p1))))))||(!p2&&(X(X(p1)) U ((!p1&&X(X(p1)))||X(X(G(p1))))))))))))))'
[2025-06-08 12:34:57] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3670470209366839700
[2025-06-08 12:34:57] [INFO ] Applying decomposition
[2025-06-08 12:34:57] [INFO ] Computing symmetric may disable matrix : 770 transitions.
[2025-06-08 12:34:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 12:34:57] [INFO ] Computing symmetric may enable matrix : 770 transitions.
[2025-06-08 12:34:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 12:34:57] [INFO ] Flatten gal took : 19 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/graph18174639326007503595.txt' '-o' '/tmp/graph18174639326007503595.bin' '-w' '/tmp/graph18174639326007503595.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18174639326007503595.bin' '-l' '-1' '-v' '-w' '/tmp/graph18174639326007503595.weights' '-q' '0' '-e' '0.001'
[2025-06-08 12:34:57] [INFO ] Decomposing Gal with order
[2025-06-08 12:34:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 12:34:57] [INFO ] Removed a total of 386 redundant transitions.
[2025-06-08 12:34:57] [INFO ] Flatten gal took : 36 ms
[2025-06-08 12:34:57] [INFO ] Computing Do-Not-Accords matrix : 770 transitions.
[2025-06-08 12:34:57] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-08 12:34:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2025-06-08 12:34:57] [INFO ] Built C files in 176ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3670470209366839700
Running compilation step : cd /tmp/ltsmin3670470209366839700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-08 12:34:57] [INFO ] Time to serialize gal into /tmp/LTLCardinality237983946687331836.gal : 7 ms
[2025-06-08 12:34:57] [INFO ] Time to serialize properties into /tmp/LTLCardinality14792350410055334039.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/LTLCardinality237983946687331836.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14792350410055334039.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 1 LTL properties
Checking formula 0 : !((X(("(i4.i1.i1.u51.p135!=1)")&&(X(("(i4.i1.i1.u51.p135!=1)")U((G("(i4.i1.i1.u51.p135!=1)"))||(((X(X("((i25.u227.p753==0)||(i25.u225....820
Formula 0 simplified : X(!"(i4.i1.i1.u51.p135!=1)" | X(!"(i4.i1.i1.u51.p135!=1)" M ("((i21.i0.i1.u190.p656==0)||(i6.u60.p170==1))" U (XX!"((i25.u227.p753==...329
Reverse transition relation is NOT exact ! Due to transitions t117, t174, t175, t231, t265, t401, t404, t444, t477, t492, t547, t620, t626, t629, t645, t64...534
Computing Next relation with stutter on 7294 deadlock states
Compilation finished in 1897 ms.
Running link step : cd /tmp/ltsmin3670470209366839700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3670470209366839700;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((LTLAPp0==true)&&X(((LTLAPp0==true) U ([]((LTLAPp0==true))||((X(X((LTLAPp1==true))) U ((!(LTLAPp1==true)&&X(X((LTLAPp1==true))))||X(X([]((LTLAPp1==true)))))) U ([]((X(X((LTLAPp1==true))) U ((!(LTLAPp1==true)&&X(X((LTLAPp1==true))))||X(X([]((LTLAPp1==true)))))))||(!(LTLAPp2==true)&&(X(X((LTLAPp1==true))) U ((!(LTLAPp1==true)&&X(X((LTLAPp1==true))))||X(X([]((LTLAPp1==true))))))))))))))' '--buchi-type=spotba'
180 unique states visited
180 strongly connected components in search stack
183 transitions explored
180 items max in DFS search stack
4578 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,45.8594,791944,1,0,1.24806e+06,1039,8800,3.67503e+06,273,5807,2541232
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA MedleyB-PT-B01-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 666354 ms.

BK_STOP 1749386216668

--------------------
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="MedleyB-PT-B01"
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 MedleyB-PT-B01, 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 r254-tall-174931339900427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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