Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 924K
-rw-r--r-- 1 mcc users 6.3K Jun 6 09:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 6 09:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 6 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 6 09:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 12:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 12:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 6 09:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 6 09:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Jun 6 09:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:09 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 482K 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-B03-LTLCardinality-00
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-01
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-02
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-03
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-04
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-05
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-06
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-07
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-08
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-09
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-10
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-11
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-12
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-13
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-14
FORMULA_NAME MedleyB-PT-B03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749387842850

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-B03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-08 13:04:03] [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 13:04:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 13:04:04] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2025-06-08 13:04:04] [INFO ] Transformed 1529 places.
[2025-06-08 13:04:04] [INFO ] Transformed 2131 transitions.
[2025-06-08 13:04:04] [INFO ] Found NUPN structural information;
[2025-06-08 13:04:04] [INFO ] Parsed PT model containing 1529 places and 2131 transitions and 8591 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA MedleyB-PT-B03-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyB-PT-B03-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 1529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1529/1529 places, 2131/2131 transitions.
Discarding 122 places :
Symmetric choice reduction at 0 with 122 rule applications. Total rules 122 place count 1407 transition count 2009
Iterating global reduction 0 with 122 rules applied. Total rules applied 244 place count 1407 transition count 2009
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 319 place count 1332 transition count 1934
Iterating global reduction 0 with 75 rules applied. Total rules applied 394 place count 1332 transition count 1934
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 436 place count 1290 transition count 1892
Iterating global reduction 0 with 42 rules applied. Total rules applied 478 place count 1290 transition count 1892
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 514 place count 1254 transition count 1856
Iterating global reduction 0 with 36 rules applied. Total rules applied 550 place count 1254 transition count 1856
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 581 place count 1223 transition count 1825
Iterating global reduction 0 with 31 rules applied. Total rules applied 612 place count 1223 transition count 1825
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 643 place count 1192 transition count 1794
Iterating global reduction 0 with 31 rules applied. Total rules applied 674 place count 1192 transition count 1794
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 705 place count 1161 transition count 1763
Iterating global reduction 0 with 31 rules applied. Total rules applied 736 place count 1161 transition count 1763
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 766 place count 1131 transition count 1733
Iterating global reduction 0 with 30 rules applied. Total rules applied 796 place count 1131 transition count 1733
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 822 place count 1105 transition count 1707
Iterating global reduction 0 with 26 rules applied. Total rules applied 848 place count 1105 transition count 1707
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 869 place count 1084 transition count 1686
Iterating global reduction 0 with 21 rules applied. Total rules applied 890 place count 1084 transition count 1686
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 895 place count 1084 transition count 1681
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 902 place count 1077 transition count 1674
Iterating global reduction 1 with 7 rules applied. Total rules applied 909 place count 1077 transition count 1674
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 916 place count 1070 transition count 1667
Iterating global reduction 1 with 7 rules applied. Total rules applied 923 place count 1070 transition count 1667
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 926 place count 1067 transition count 1664
Iterating global reduction 1 with 3 rules applied. Total rules applied 929 place count 1067 transition count 1664
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 931 place count 1065 transition count 1662
Iterating global reduction 1 with 2 rules applied. Total rules applied 933 place count 1065 transition count 1662
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 935 place count 1063 transition count 1660
Iterating global reduction 1 with 2 rules applied. Total rules applied 937 place count 1063 transition count 1660
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 939 place count 1061 transition count 1658
Iterating global reduction 1 with 2 rules applied. Total rules applied 941 place count 1061 transition count 1658
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 943 place count 1059 transition count 1656
Iterating global reduction 1 with 2 rules applied. Total rules applied 945 place count 1059 transition count 1656
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 947 place count 1057 transition count 1654
Iterating global reduction 1 with 2 rules applied. Total rules applied 949 place count 1057 transition count 1654
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 951 place count 1055 transition count 1652
Iterating global reduction 1 with 2 rules applied. Total rules applied 953 place count 1055 transition count 1652
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 955 place count 1053 transition count 1650
Iterating global reduction 1 with 2 rules applied. Total rules applied 957 place count 1053 transition count 1650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 959 place count 1051 transition count 1648
Iterating global reduction 1 with 2 rules applied. Total rules applied 961 place count 1051 transition count 1648
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 963 place count 1049 transition count 1646
Iterating global reduction 1 with 2 rules applied. Total rules applied 965 place count 1049 transition count 1646
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 967 place count 1049 transition count 1644
Applied a total of 967 rules in 1529 ms. Remains 1049 /1529 variables (removed 480) and now considering 1644/2131 (removed 487) transitions.
// Phase 1: matrix 1644 rows 1049 cols
[2025-06-08 13:04:06] [INFO ] Computed 6 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:04:06] [INFO ] Implicit Places using invariants in 895 ms returned []
[2025-06-08 13:04:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:04:08] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 2181 ms to find 0 implicit places.
Running 1643 sub problems to find dead transitions.
[2025-06-08 13:04:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1048/2693 variables, and 0 constraints, problems are : Problem set: 0 solved, 1643 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1049 constraints, PredecessorRefiner: 1643/1643 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1643 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1048/2693 variables, and 0 constraints, problems are : Problem set: 0 solved, 1643 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1049 constraints, PredecessorRefiner: 0/1643 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61672ms problems are : Problem set: 0 solved, 1643 unsolved
Search for dead transitions found 0 dead transitions in 61691ms
Starting structural reductions in LTL mode, iteration 1 : 1049/1529 places, 1644/2131 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65432 ms. Remains : 1049/1529 places, 1644/2131 transitions.
Support contains 21 out of 1049 places after structural reductions.
[2025-06-08 13:05:10] [INFO ] Flatten gal took : 164 ms
[2025-06-08 13:05:10] [INFO ] Flatten gal took : 102 ms
[2025-06-08 13:05:10] [INFO ] Input system was already deterministic with 1644 transitions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (419 resets) in 1250 ms. (31 steps per ms) remains 7/14 properties
BEST_FIRST walk for 40003 steps (77 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (78 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (77 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (75 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (76 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (74 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (76 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
[2025-06-08 13:05:11] [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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 845/857 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/857 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 192/1049 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1049 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1644/2693 variables, 1049/1055 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2693 variables, 0/1055 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/2693 variables, 0/1055 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2693/2693 variables, and 1055 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1604 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1049/1049 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 845/857 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:05:13] [INFO ] Deduced a trap composed of 326 places in 462 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:05:13] [INFO ] Deduced a trap composed of 326 places in 424 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:05:14] [INFO ] Deduced a trap composed of 334 places in 416 ms of which 147 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:05:14] [INFO ] Deduced a trap composed of 318 places in 362 ms of which 81 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/857 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/857 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 192/1049 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1049 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1644/2693 variables, 1049/1059 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2693 variables, 7/1066 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:05:16] [INFO ] Deduced a trap composed of 298 places in 354 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:05:17] [INFO ] Deduced a trap composed of 301 places in 539 ms of which 207 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:05:17] [INFO ] Deduced a trap composed of 306 places in 555 ms of which 218 ms to minimize.
SMT process timed out in 6686ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 1049 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1049/1049 places, 1644/1644 transitions.
Graph (trivial) has 1024 edges and 1049 vertex of which 79 / 1049 are part of one of the 15 SCC in 5 ms
Free SCC test removed 64 places
Drop transitions (Empty/Sink Transition effects.) removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Graph (complete) has 1672 edges and 985 vertex of which 980 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 723 transitions
Trivial Post-agglo rules discarded 723 transitions
Performed 723 trivial Post agglomeration. Transition count delta: 723
Iterating post reduction 0 with 728 rules applied. Total rules applied 730 place count 980 transition count 828
Reduce places removed 723 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 737 rules applied. Total rules applied 1467 place count 257 transition count 814
Reduce places removed 5 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 9 rules applied. Total rules applied 1476 place count 252 transition count 810
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1480 place count 248 transition count 810
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 1480 place count 248 transition count 751
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1598 place count 189 transition count 751
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1600 place count 187 transition count 749
Iterating global reduction 4 with 2 rules applied. Total rules applied 1602 place count 187 transition count 749
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1604 place count 185 transition count 747
Iterating global reduction 4 with 2 rules applied. Total rules applied 1606 place count 185 transition count 747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1607 place count 185 transition count 746
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1608 place count 184 transition count 745
Iterating global reduction 5 with 1 rules applied. Total rules applied 1609 place count 184 transition count 745
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1610 place count 183 transition count 744
Iterating global reduction 5 with 1 rules applied. Total rules applied 1611 place count 183 transition count 744
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 1685 place count 146 transition count 707
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1694 place count 146 transition count 698
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 1722 place count 118 transition count 249
Iterating global reduction 6 with 28 rules applied. Total rules applied 1750 place count 118 transition count 249
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1764 place count 118 transition count 235
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 1775 place count 107 transition count 224
Iterating global reduction 7 with 11 rules applied. Total rules applied 1786 place count 107 transition count 224
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1792 place count 101 transition count 218
Iterating global reduction 7 with 6 rules applied. Total rules applied 1798 place count 101 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 1802 place count 101 transition count 214
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 1816 place count 94 transition count 207
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1822 place count 91 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1823 place count 91 transition count 221
Free-agglomeration rule applied 33 times.
Iterating global reduction 8 with 33 rules applied. Total rules applied 1856 place count 91 transition count 188
Reduce places removed 33 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 8 with 42 rules applied. Total rules applied 1898 place count 58 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 9 with 32 rules applied. Total rules applied 1930 place count 58 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1932 place count 57 transition count 146
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1933 place count 57 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1934 place count 56 transition count 145
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1938 place count 56 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 1941 place count 56 transition count 142
Applied a total of 1941 rules in 205 ms. Remains 56 /1049 variables (removed 993) and now considering 142/1644 (removed 1502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 56/1049 places, 142/1644 transitions.
RANDOM walk for 32845 steps (1634 resets) in 515 ms. (63 steps per ms) remains 0/7 properties
Computed a total of 205 stabilizing places and 215 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&F(p1)))'
Support contains 4 out of 1049 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1049/1049 places, 1644/1644 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1044 transition count 1639
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1044 transition count 1639
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 1039 transition count 1634
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 1039 transition count 1634
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 1034 transition count 1629
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 1034 transition count 1629
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 1030 transition count 1625
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 1030 transition count 1625
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 1026 transition count 1621
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 1026 transition count 1621
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 1022 transition count 1617
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 1022 transition count 1617
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 1019 transition count 1614
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 1019 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 1016 transition count 1611
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 1016 transition count 1611
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 1013 transition count 1608
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 1013 transition count 1608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 73 place count 1013 transition count 1607
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 1012 transition count 1606
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 1012 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 1011 transition count 1605
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 1011 transition count 1605
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 1010 transition count 1604
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 1010 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 1009 transition count 1603
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 1009 transition count 1603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 1008 transition count 1602
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 1008 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 1007 transition count 1601
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 1007 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 1006 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 1006 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 1005 transition count 1599
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 1005 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 1004 transition count 1598
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 1004 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 1003 transition count 1597
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 1003 transition count 1597
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 1002 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 1002 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 1001 transition count 1595
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 1001 transition count 1595
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 98 place count 1001 transition count 1594
Applied a total of 98 rules in 752 ms. Remains 1001 /1049 variables (removed 48) and now considering 1594/1644 (removed 50) transitions.
// Phase 1: matrix 1594 rows 1001 cols
[2025-06-08 13:05:19] [INFO ] Computed 6 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:05:19] [INFO ] Implicit Places using invariants in 610 ms returned []
[2025-06-08 13:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:05:21] [INFO ] Implicit Places using invariants and state equation in 1179 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
Running 1593 sub problems to find dead transitions.
[2025-06-08 13:05:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2595 variables, and 0 constraints, problems are : Problem set: 0 solved, 1593 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 1593/1593 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1593 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2595 variables, and 0 constraints, problems are : Problem set: 0 solved, 1593 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1001 constraints, PredecessorRefiner: 0/1593 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61417ms problems are : Problem set: 0 solved, 1593 unsolved
Search for dead transitions found 0 dead transitions in 61423ms
Starting structural reductions in LTL mode, iteration 1 : 1001/1049 places, 1594/1644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63978 ms. Remains : 1001/1049 places, 1594/1644 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : MedleyB-PT-B03-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLCardinality-00 finished in 64302 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((!p0&&(!p1 U (p2||G(!p1))))))))'
Support contains 4 out of 1049 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1049/1049 places, 1644/1644 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1044 transition count 1639
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1044 transition count 1639
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 1039 transition count 1634
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 1039 transition count 1634
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 1034 transition count 1629
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 1034 transition count 1629
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 1031 transition count 1626
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 1031 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 1028 transition count 1623
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 1028 transition count 1623
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 1025 transition count 1620
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 1025 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 1022 transition count 1617
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 1022 transition count 1617
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 1019 transition count 1614
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 1019 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 1016 transition count 1611
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 1016 transition count 1611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 1016 transition count 1610
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 1014 transition count 1608
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 1014 transition count 1608
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 1012 transition count 1606
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 1012 transition count 1606
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 77 place count 1010 transition count 1604
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 1010 transition count 1604
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 1008 transition count 1602
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 1008 transition count 1602
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 85 place count 1006 transition count 1600
Iterating global reduction 1 with 2 rules applied. Total rules applied 87 place count 1006 transition count 1600
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 89 place count 1004 transition count 1598
Iterating global reduction 1 with 2 rules applied. Total rules applied 91 place count 1004 transition count 1598
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 93 place count 1002 transition count 1596
Iterating global reduction 1 with 2 rules applied. Total rules applied 95 place count 1002 transition count 1596
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 97 place count 1000 transition count 1594
Iterating global reduction 1 with 2 rules applied. Total rules applied 99 place count 1000 transition count 1594
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 101 place count 998 transition count 1592
Iterating global reduction 1 with 2 rules applied. Total rules applied 103 place count 998 transition count 1592
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 996 transition count 1590
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 996 transition count 1590
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 996 transition count 1589
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 995 transition count 1588
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 995 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 994 transition count 1587
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 994 transition count 1587
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 994 transition count 1586
Applied a total of 113 rules in 667 ms. Remains 994 /1049 variables (removed 55) and now considering 1586/1644 (removed 58) transitions.
// Phase 1: matrix 1586 rows 994 cols
[2025-06-08 13:06:23] [INFO ] Computed 6 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:06:24] [INFO ] Implicit Places using invariants in 558 ms returned []
[2025-06-08 13:06:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:06:25] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1643 ms to find 0 implicit places.
Running 1585 sub problems to find dead transitions.
[2025-06-08 13:06:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 993/2580 variables, and 0 constraints, problems are : Problem set: 0 solved, 1585 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/994 constraints, PredecessorRefiner: 1585/1585 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1585 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 993/2580 variables, and 0 constraints, problems are : Problem set: 0 solved, 1585 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/994 constraints, PredecessorRefiner: 0/1585 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61398ms problems are : Problem set: 0 solved, 1585 unsolved
Search for dead transitions found 0 dead transitions in 61405ms
Starting structural reductions in LTL mode, iteration 1 : 994/1049 places, 1586/1644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63721 ms. Remains : 994/1049 places, 1586/1644 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (OR p0 (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2)))]
Running random walk in product with property : MedleyB-PT-B03-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 1 ms.
FORMULA MedleyB-PT-B03-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLCardinality-01 finished in 63853 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(p1)||p0)) U X(p2)))'
Support contains 4 out of 1049 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1049/1049 places, 1644/1644 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1042 transition count 1637
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1042 transition count 1637
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 1035 transition count 1630
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 1035 transition count 1630
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 1028 transition count 1623
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 1028 transition count 1623
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 1023 transition count 1618
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 1023 transition count 1618
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 1018 transition count 1613
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 1018 transition count 1613
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 1013 transition count 1608
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 1013 transition count 1608
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 1009 transition count 1604
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 1009 transition count 1604
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 84 place count 1005 transition count 1600
Iterating global reduction 0 with 4 rules applied. Total rules applied 88 place count 1005 transition count 1600
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 92 place count 1001 transition count 1596
Iterating global reduction 0 with 4 rules applied. Total rules applied 96 place count 1001 transition count 1596
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 97 place count 1001 transition count 1595
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 999 transition count 1593
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 999 transition count 1593
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 103 place count 997 transition count 1591
Iterating global reduction 1 with 2 rules applied. Total rules applied 105 place count 997 transition count 1591
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 995 transition count 1589
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 995 transition count 1589
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 993 transition count 1587
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 993 transition count 1587
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 991 transition count 1585
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 991 transition count 1585
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 989 transition count 1583
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 989 transition count 1583
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 987 transition count 1581
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 987 transition count 1581
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 985 transition count 1579
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 985 transition count 1579
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 983 transition count 1577
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 983 transition count 1577
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 135 place count 981 transition count 1575
Iterating global reduction 1 with 2 rules applied. Total rules applied 137 place count 981 transition count 1575
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 138 place count 981 transition count 1574
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 980 transition count 1573
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 980 transition count 1573
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 979 transition count 1572
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 979 transition count 1572
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 143 place count 979 transition count 1571
Applied a total of 143 rules in 638 ms. Remains 979 /1049 variables (removed 70) and now considering 1571/1644 (removed 73) transitions.
// Phase 1: matrix 1571 rows 979 cols
[2025-06-08 13:07:27] [INFO ] Computed 6 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:07:27] [INFO ] Implicit Places using invariants in 562 ms returned []
[2025-06-08 13:07:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:07:29] [INFO ] Implicit Places using invariants and state equation in 1136 ms returned []
Implicit Place search using SMT with State Equation took 1700 ms to find 0 implicit places.
Running 1570 sub problems to find dead transitions.
[2025-06-08 13:07:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1570 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/979 constraints, PredecessorRefiner: 1570/1570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1570 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/2550 variables, and 0 constraints, problems are : Problem set: 0 solved, 1570 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/979 constraints, PredecessorRefiner: 0/1570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61301ms problems are : Problem set: 0 solved, 1570 unsolved
Search for dead transitions found 0 dead transitions in 61305ms
Starting structural reductions in LTL mode, iteration 1 : 979/1049 places, 1571/1644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63653 ms. Remains : 979/1049 places, 1571/1644 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyB-PT-B03-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 373 ms.
Product exploration explored 100000 steps with 50000 reset in 326 ms.
Computed a total of 205 stabilizing places and 215 stable transitions
Computed a total of 205 stabilizing places and 215 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 19 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-B03-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyB-PT-B03-LTLCardinality-08 finished in 64643 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)&&X(X(X(X(F(p1))))))))'
Support contains 2 out of 1049 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1049/1049 places, 1644/1644 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1043 transition count 1638
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1043 transition count 1638
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1037 transition count 1632
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1037 transition count 1632
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1031 transition count 1626
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1031 transition count 1626
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 1027 transition count 1622
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 1027 transition count 1622
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1023 transition count 1618
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1023 transition count 1618
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1019 transition count 1614
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1019 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 1016 transition count 1611
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 1016 transition count 1611
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 1013 transition count 1608
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 1013 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 1010 transition count 1605
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 1010 transition count 1605
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 1008 transition count 1603
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 1008 transition count 1603
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 1006 transition count 1601
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 1006 transition count 1601
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 1004 transition count 1599
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 1004 transition count 1599
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 92 place count 1002 transition count 1597
Iterating global reduction 0 with 2 rules applied. Total rules applied 94 place count 1002 transition count 1597
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 96 place count 1000 transition count 1595
Iterating global reduction 0 with 2 rules applied. Total rules applied 98 place count 1000 transition count 1595
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 100 place count 998 transition count 1593
Iterating global reduction 0 with 2 rules applied. Total rules applied 102 place count 998 transition count 1593
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 104 place count 996 transition count 1591
Iterating global reduction 0 with 2 rules applied. Total rules applied 106 place count 996 transition count 1591
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 108 place count 994 transition count 1589
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 994 transition count 1589
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 112 place count 992 transition count 1587
Iterating global reduction 0 with 2 rules applied. Total rules applied 114 place count 992 transition count 1587
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 116 place count 990 transition count 1585
Iterating global reduction 0 with 2 rules applied. Total rules applied 118 place count 990 transition count 1585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 119 place count 990 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 120 place count 989 transition count 1583
Iterating global reduction 1 with 1 rules applied. Total rules applied 121 place count 989 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 122 place count 988 transition count 1582
Iterating global reduction 1 with 1 rules applied. Total rules applied 123 place count 988 transition count 1582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 124 place count 988 transition count 1581
Applied a total of 124 rules in 666 ms. Remains 988 /1049 variables (removed 61) and now considering 1581/1644 (removed 63) transitions.
// Phase 1: matrix 1581 rows 988 cols
[2025-06-08 13:08:32] [INFO ] Computed 6 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:08:32] [INFO ] Implicit Places using invariants in 560 ms returned []
[2025-06-08 13:08:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:08:33] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1663 ms to find 0 implicit places.
Running 1580 sub problems to find dead transitions.
[2025-06-08 13:08:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 987/2569 variables, and 0 constraints, problems are : Problem set: 0 solved, 1580 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 1580/1580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1580 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 987/2569 variables, and 0 constraints, problems are : Problem set: 0 solved, 1580 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 0/1580 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61335ms problems are : Problem set: 0 solved, 1580 unsolved
Search for dead transitions found 0 dead transitions in 61341ms
Starting structural reductions in LTL mode, iteration 1 : 988/1049 places, 1581/1644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63680 ms. Remains : 988/1049 places, 1581/1644 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B03-LTLCardinality-11
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 0 ms.
FORMULA MedleyB-PT-B03-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLCardinality-11 finished in 63969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p0)))))'
Support contains 1 out of 1049 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1049/1049 places, 1644/1644 transitions.
Graph (trivial) has 1041 edges and 1049 vertex of which 80 / 1049 are part of one of the 15 SCC in 3 ms
Free SCC test removed 65 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 729 transitions
Trivial Post-agglo rules discarded 729 transitions
Performed 729 trivial Post agglomeration. Transition count delta: 729
Iterating post reduction 0 with 729 rules applied. Total rules applied 730 place count 983 transition count 839
Reduce places removed 729 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 743 rules applied. Total rules applied 1473 place count 254 transition count 825
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 1479 place count 249 transition count 824
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1480 place count 248 transition count 824
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 55 Pre rules applied. Total rules applied 1480 place count 248 transition count 769
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 1590 place count 193 transition count 769
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1599 place count 184 transition count 760
Iterating global reduction 4 with 9 rules applied. Total rules applied 1608 place count 184 transition count 760
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1611 place count 181 transition count 757
Iterating global reduction 4 with 3 rules applied. Total rules applied 1614 place count 181 transition count 757
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1616 place count 181 transition count 755
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1617 place count 180 transition count 754
Iterating global reduction 5 with 1 rules applied. Total rules applied 1618 place count 180 transition count 754
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1619 place count 179 transition count 753
Iterating global reduction 5 with 1 rules applied. Total rules applied 1620 place count 179 transition count 753
Performed 39 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 1698 place count 140 transition count 713
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 1729 place count 109 transition count 265
Iterating global reduction 5 with 31 rules applied. Total rules applied 1760 place count 109 transition count 265
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1774 place count 109 transition count 251
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1790 place count 93 transition count 230
Iterating global reduction 6 with 16 rules applied. Total rules applied 1806 place count 93 transition count 230
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1822 place count 77 transition count 209
Iterating global reduction 6 with 16 rules applied. Total rules applied 1838 place count 77 transition count 209
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1845 place count 77 transition count 202
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1863 place count 68 transition count 209
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1864 place count 67 transition count 199
Iterating global reduction 7 with 1 rules applied. Total rules applied 1865 place count 67 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1866 place count 67 transition count 198
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1871 place count 67 transition count 193
Applied a total of 1871 rules in 106 ms. Remains 67 /1049 variables (removed 982) and now considering 193/1644 (removed 1451) transitions.
[2025-06-08 13:09:35] [INFO ] Flow matrix only has 187 transitions (discarded 6 similar events)
// Phase 1: matrix 187 rows 67 cols
[2025-06-08 13:09:35] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:09:35] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-08 13:09:35] [INFO ] Flow matrix only has 187 transitions (discarded 6 similar events)
[2025-06-08 13:09:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:09:35] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-08 13:09:35] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 13:09:35] [INFO ] Redundant transitions in 6 ms returned []
Running 176 sub problems to find dead transitions.
[2025-06-08 13:09:35] [INFO ] Flow matrix only has 187 transitions (discarded 6 similar events)
[2025-06-08 13:09:35] [INFO ] Invariant cache hit.
[2025-06-08 13:09:35] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:36] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:36] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:36] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:36] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:37] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:37] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:37] [INFO ] Deduced a trap composed of 23 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 13:09:37] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:37] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:37] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:37] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:37] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:37] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:37] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:37] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:37] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:38] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:38] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:38] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 186/253 variables, 67/88 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 30/118 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 9 (OVERLAPS) 1/254 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:42] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:42] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/254 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (OVERLAPS) 0/254 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 121 constraints, problems are : Problem set: 0 solved, 176 unsolved in 14449 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 67/67 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:50] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 186/253 variables, 67/91 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 30/121 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 176/297 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:55] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:09:57] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:10:04] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:10:04] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/253 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/253 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 176 unsolved
SMT process timed out in 44575ms, After SMT, problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 44576ms
Starting structural reductions in SI_LTL mode, iteration 1 : 67/1049 places, 193/1644 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45004 ms. Remains : 67/1049 places, 193/1644 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : MedleyB-PT-B03-LTLCardinality-13
Stuttering criterion allowed to conclude after 17709 steps with 1984 reset in 50 ms.
FORMULA MedleyB-PT-B03-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLCardinality-13 finished in 45095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 3 out of 1049 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1049/1049 places, 1644/1644 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1043 transition count 1638
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1043 transition count 1638
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1037 transition count 1632
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1037 transition count 1632
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1031 transition count 1626
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1031 transition count 1626
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 1027 transition count 1622
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 1027 transition count 1622
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 1023 transition count 1618
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 1023 transition count 1618
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 56 place count 1019 transition count 1614
Iterating global reduction 0 with 4 rules applied. Total rules applied 60 place count 1019 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 1016 transition count 1611
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 1016 transition count 1611
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 69 place count 1013 transition count 1608
Iterating global reduction 0 with 3 rules applied. Total rules applied 72 place count 1013 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 1010 transition count 1605
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 1010 transition count 1605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 79 place count 1010 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 80 place count 1009 transition count 1603
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 1009 transition count 1603
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 1008 transition count 1602
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 1008 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 1007 transition count 1601
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 1007 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 86 place count 1006 transition count 1600
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 1006 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 88 place count 1005 transition count 1599
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 1005 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 1004 transition count 1598
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 1004 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 92 place count 1003 transition count 1597
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 1003 transition count 1597
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 1002 transition count 1596
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 1002 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 1001 transition count 1595
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 1001 transition count 1595
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 1000 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 1000 transition count 1594
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 1000 transition count 1593
Applied a total of 100 rules in 578 ms. Remains 1000 /1049 variables (removed 49) and now considering 1593/1644 (removed 51) transitions.
// Phase 1: matrix 1593 rows 1000 cols
[2025-06-08 13:10:21] [INFO ] Computed 6 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:10:21] [INFO ] Implicit Places using invariants in 607 ms returned []
[2025-06-08 13:10:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:10:22] [INFO ] Implicit Places using invariants and state equation in 1114 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
Running 1592 sub problems to find dead transitions.
[2025-06-08 13:10:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 999/2593 variables, and 0 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 1592/1592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1592 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 999/2593 variables, and 0 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/6 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 0/1592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61275ms problems are : Problem set: 0 solved, 1592 unsolved
Search for dead transitions found 0 dead transitions in 61279ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1049 places, 1593/1644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63595 ms. Remains : 1000/1049 places, 1593/1644 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyB-PT-B03-LTLCardinality-14
Product exploration explored 100000 steps with 1042 reset in 154 ms.
Product exploration explored 100000 steps with 1058 reset in 172 ms.
Computed a total of 205 stabilizing places and 215 stable transitions
Computed a total of 205 stabilizing places and 215 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
RANDOM walk for 40000 steps (417 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (73 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1037 steps, run visited all 1 properties in 19 ms. (steps per millisecond=54 )
Probabilistic random walk after 1037 steps, saw 871 distinct states, run finished after 30 ms. (steps per millisecond=34 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 1 out of 1000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1593/1593 transitions.
Graph (trivial) has 993 edges and 1000 vertex of which 80 / 1000 are part of one of the 15 SCC in 2 ms
Free SCC test removed 65 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 690 transitions
Trivial Post-agglo rules discarded 690 transitions
Performed 690 trivial Post agglomeration. Transition count delta: 690
Iterating post reduction 0 with 690 rules applied. Total rules applied 691 place count 934 transition count 827
Reduce places removed 690 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 705 rules applied. Total rules applied 1396 place count 244 transition count 812
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1401 place count 239 transition count 812
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 1401 place count 239 transition count 758
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 1509 place count 185 transition count 758
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1513 place count 181 transition count 754
Iterating global reduction 3 with 4 rules applied. Total rules applied 1517 place count 181 transition count 754
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1595 place count 142 transition count 715
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1625 place count 112 transition count 268
Iterating global reduction 3 with 30 rules applied. Total rules applied 1655 place count 112 transition count 268
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 1669 place count 112 transition count 254
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 1684 place count 97 transition count 234
Iterating global reduction 4 with 15 rules applied. Total rules applied 1699 place count 97 transition count 234
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 1713 place count 83 transition count 216
Iterating global reduction 4 with 14 rules applied. Total rules applied 1727 place count 83 transition count 216
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1732 place count 83 transition count 211
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 1750 place count 74 transition count 220
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1751 place count 73 transition count 208
Iterating global reduction 5 with 1 rules applied. Total rules applied 1752 place count 73 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1753 place count 73 transition count 207
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 1759 place count 73 transition count 201
Applied a total of 1759 rules in 58 ms. Remains 73 /1000 variables (removed 927) and now considering 201/1593 (removed 1392) transitions.
[2025-06-08 13:11:24] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
// Phase 1: matrix 195 rows 73 cols
[2025-06-08 13:11:24] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:11:25] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-08 13:11:25] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
[2025-06-08 13:11:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:11:25] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-08 13:11:25] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 13:11:25] [INFO ] Redundant transitions in 8 ms returned []
Running 184 sub problems to find dead transitions.
[2025-06-08 13:11:25] [INFO ] Flow matrix only has 195 transitions (discarded 6 similar events)
[2025-06-08 13:11:25] [INFO ] Invariant cache hit.
[2025-06-08 13:11:25] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:26] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:26] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:26] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:26] [INFO ] Deduced a trap composed of 20 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 13:11:26] [INFO ] Deduced a trap composed of 17 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 13:11:26] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:26] [INFO ] Deduced a trap composed of 25 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 13:11:26] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:26] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:26] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:27] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:27] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:27] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:27] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:27] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:27] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:27] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 17/19 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:28] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:28] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:28] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:28] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:29] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 194/267 variables, 73/97 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 30/127 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:31] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 12 (OVERLAPS) 1/268 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/268 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:38] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 3 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/268 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/268 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 16 (OVERLAPS) 0/268 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 130 constraints, problems are : Problem set: 0 solved, 184 unsolved in 18513 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:44] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 194/267 variables, 73/100 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 30/130 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 184/314 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:48] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:48] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:11:51] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 1/268 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 268/268 variables, and 318 constraints, problems are : Problem set: 0 solved, 184 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48604ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 48604ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/1000 places, 201/1593 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48881 ms. Remains : 73/1000 places, 201/1593 transitions.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 33602 steps (3788 resets) in 336 ms. (99 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 2338 steps with 259 reset in 11 ms.
FORMULA MedleyB-PT-B03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLCardinality-14 finished in 113854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 1049 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1049/1049 places, 1644/1644 transitions.
Graph (trivial) has 1038 edges and 1049 vertex of which 80 / 1049 are part of one of the 15 SCC in 2 ms
Free SCC test removed 65 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 727 transitions
Trivial Post-agglo rules discarded 727 transitions
Performed 727 trivial Post agglomeration. Transition count delta: 727
Iterating post reduction 0 with 727 rules applied. Total rules applied 728 place count 983 transition count 841
Reduce places removed 727 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 741 rules applied. Total rules applied 1469 place count 256 transition count 827
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 1475 place count 251 transition count 826
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1476 place count 250 transition count 826
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 54 Pre rules applied. Total rules applied 1476 place count 250 transition count 772
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 1584 place count 196 transition count 772
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1593 place count 187 transition count 763
Iterating global reduction 4 with 9 rules applied. Total rules applied 1602 place count 187 transition count 763
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1605 place count 184 transition count 760
Iterating global reduction 4 with 3 rules applied. Total rules applied 1608 place count 184 transition count 760
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1610 place count 184 transition count 758
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1611 place count 183 transition count 757
Iterating global reduction 5 with 1 rules applied. Total rules applied 1612 place count 183 transition count 757
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1613 place count 182 transition count 756
Iterating global reduction 5 with 1 rules applied. Total rules applied 1614 place count 182 transition count 756
Performed 39 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 5 with 78 rules applied. Total rules applied 1692 place count 143 transition count 716
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 1722 place count 113 transition count 270
Iterating global reduction 5 with 30 rules applied. Total rules applied 1752 place count 113 transition count 270
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1766 place count 113 transition count 256
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 1780 place count 99 transition count 238
Iterating global reduction 6 with 14 rules applied. Total rules applied 1794 place count 99 transition count 238
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1807 place count 86 transition count 221
Iterating global reduction 6 with 13 rules applied. Total rules applied 1820 place count 86 transition count 221
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1825 place count 86 transition count 216
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 1845 place count 76 transition count 230
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1846 place count 75 transition count 218
Iterating global reduction 7 with 1 rules applied. Total rules applied 1847 place count 75 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1848 place count 75 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 1853 place count 75 transition count 212
Applied a total of 1853 rules in 71 ms. Remains 75 /1049 variables (removed 974) and now considering 212/1644 (removed 1432) transitions.
[2025-06-08 13:12:14] [INFO ] Flow matrix only has 205 transitions (discarded 7 similar events)
// Phase 1: matrix 205 rows 75 cols
[2025-06-08 13:12:14] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:12:14] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-08 13:12:14] [INFO ] Flow matrix only has 205 transitions (discarded 7 similar events)
[2025-06-08 13:12:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 13:12:14] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-06-08 13:12:14] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 13:12:14] [INFO ] Redundant transitions in 4 ms returned []
Running 187 sub problems to find dead transitions.
[2025-06-08 13:12:14] [INFO ] Flow matrix only has 205 transitions (discarded 7 similar events)
[2025-06-08 13:12:14] [INFO ] Invariant cache hit.
[2025-06-08 13:12:14] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:15] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:15] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:15] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:15] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:15] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:15] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:15] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:16] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:16] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:16] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:16] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:16] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:16] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:16] [INFO ] Deduced a trap composed of 25 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 13:12:16] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:16] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:16] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:16] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:16] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:17] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:17] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:17] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:18] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:18] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:18] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 204/279 variables, 75/102 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 30/132 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:21] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:21] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/279 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (OVERLAPS) 1/280 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 14 (OVERLAPS) 0/280 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 135 constraints, problems are : Problem set: 0 solved, 187 unsolved in 17255 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 27/29 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:32] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:32] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:32] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:32] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 204/279 variables, 75/108 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 30/138 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 187/325 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 13:12:38] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/279 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/279 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (OVERLAPS) 1/280 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 280/280 variables, and 327 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47344ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 47345ms
Starting structural reductions in SI_LTL mode, iteration 1 : 75/1049 places, 212/1644 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47618 ms. Remains : 75/1049 places, 212/1644 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyB-PT-B03-LTLCardinality-15
Stuttering criterion allowed to conclude after 21 steps with 1 reset in 1 ms.
FORMULA MedleyB-PT-B03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyB-PT-B03-LTLCardinality-15 finished in 47772 ms.
All properties solved by simple procedures.
Total runtime 538047 ms.

BK_STOP 1749388382100

--------------------
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-B03"
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-B03, 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-174931339900443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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