Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 336K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748611209020

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 13:20:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 13:20:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 13:20:10] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2025-05-30 13:20:10] [INFO ] Transformed 1178 places.
[2025-05-30 13:20:10] [INFO ] Transformed 1463 transitions.
[2025-05-30 13:20:10] [INFO ] Found NUPN structural information;
[2025-05-30 13:20:10] [INFO ] Parsed PT model containing 1178 places and 1463 transitions and 3734 arcs in 218 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 2 formulas.
Deduced a syphon composed of 187 places in 16 ms
Reduce places removed 187 places and 251 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-20-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-20-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 991 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 991/991 places, 1212/1212 transitions.
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 969 transition count 1207
Discarding 168 places :
Symmetric choice reduction at 1 with 168 rule applications. Total rules 195 place count 801 transition count 1037
Iterating global reduction 1 with 168 rules applied. Total rules applied 363 place count 801 transition count 1037
Discarding 147 places :
Symmetric choice reduction at 1 with 147 rule applications. Total rules 510 place count 654 transition count 877
Iterating global reduction 1 with 147 rules applied. Total rules applied 657 place count 654 transition count 877
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 666 place count 654 transition count 868
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 741 place count 579 transition count 787
Iterating global reduction 2 with 75 rules applied. Total rules applied 816 place count 579 transition count 787
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 819 place count 579 transition count 784
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 868 place count 530 transition count 735
Iterating global reduction 3 with 49 rules applied. Total rules applied 917 place count 530 transition count 735
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 926 place count 530 transition count 726
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 946 place count 510 transition count 706
Iterating global reduction 4 with 20 rules applied. Total rules applied 966 place count 510 transition count 706
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 968 place count 510 transition count 704
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 975 place count 503 transition count 697
Iterating global reduction 5 with 7 rules applied. Total rules applied 982 place count 503 transition count 697
Applied a total of 982 rules in 247 ms. Remains 503 /991 variables (removed 488) and now considering 697/1212 (removed 515) transitions.
// Phase 1: matrix 697 rows 503 cols
[2025-05-30 13:20:10] [INFO ] Computed 7 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:20:11] [INFO ] Implicit Places using invariants in 292 ms returned [6, 437]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 323 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 501/991 places, 697/1212 transitions.
Applied a total of 0 rules in 11 ms. Remains 501 /501 variables (removed 0) and now considering 697/697 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 595 ms. Remains : 501/991 places, 697/1212 transitions.
Support contains 17 out of 501 places after structural reductions.
[2025-05-30 13:20:11] [INFO ] Flatten gal took : 67 ms
[2025-05-30 13:20:11] [INFO ] Flatten gal took : 52 ms
[2025-05-30 13:20:11] [INFO ] Input system was already deterministic with 697 transitions.
RANDOM walk for 40000 steps (836 resets) in 2342 ms. (17 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40003 steps (143 resets) in 247 ms. (161 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (147 resets) in 176 ms. (226 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (145 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (141 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (141 resets) in 98 ms. (404 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (114 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (139 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (141 resets) in 79 ms. (500 steps per ms) remains 6/7 properties
// Phase 1: matrix 697 rows 501 cols
[2025-05-30 13:20:12] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/35 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 215/250 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 11/261 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 28/289 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 410/699 variables, 192/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/699 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 346/1045 variables, 168/409 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1045 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 122/1167 variables, 76/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1167 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 24/1191 variables, 16/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1191 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 6/1197 variables, 4/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1197 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 1/1198 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1198 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/1198 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1198/1198 variables, and 506 constraints, problems are : Problem set: 0 solved, 6 unsolved in 942 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 24/35 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 215/250 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 11/261 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/261 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/261 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 28/289 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 410/699 variables, 192/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/699 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 346/1045 variables, 168/415 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1045 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 122/1167 variables, 76/491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1167 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 24/1191 variables, 16/507 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1191 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 6/1197 variables, 4/511 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1197 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 1/1198 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1198 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/1198 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1198/1198 variables, and 512 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2440 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 501/501 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3426ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 5 properties in 265 ms.
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 501/501 places, 697/697 transitions.
Graph (trivial) has 539 edges and 501 vertex of which 3 / 501 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 1005 edges and 499 vertex of which 481 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 241 rules applied. Total rules applied 243 place count 481 transition count 438
Reduce places removed 216 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 218 rules applied. Total rules applied 461 place count 265 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 462 place count 264 transition count 436
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 462 place count 264 transition count 389
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 556 place count 217 transition count 389
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 559 place count 214 transition count 386
Iterating global reduction 3 with 3 rules applied. Total rules applied 562 place count 214 transition count 386
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 565 place count 214 transition count 383
Performed 81 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 4 with 162 rules applied. Total rules applied 727 place count 133 transition count 279
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 738 place count 133 transition count 268
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 746 place count 125 transition count 255
Iterating global reduction 5 with 8 rules applied. Total rules applied 754 place count 125 transition count 255
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 762 place count 121 transition count 251
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 763 place count 121 transition count 250
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 764 place count 120 transition count 248
Iterating global reduction 6 with 1 rules applied. Total rules applied 765 place count 120 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 766 place count 120 transition count 247
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 78 rules applied. Total rules applied 844 place count 81 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 7 with 78 rules applied. Total rules applied 922 place count 81 transition count 210
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 949 place count 54 transition count 145
Iterating global reduction 8 with 27 rules applied. Total rules applied 976 place count 54 transition count 145
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 996 place count 54 transition count 125
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 1001 place count 49 transition count 104
Iterating global reduction 9 with 5 rules applied. Total rules applied 1006 place count 49 transition count 104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1010 place count 49 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1012 place count 48 transition count 107
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1015 place count 48 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 11 with 7 rules applied. Total rules applied 1022 place count 48 transition count 97
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1023 place count 47 transition count 95
Iterating global reduction 11 with 1 rules applied. Total rules applied 1024 place count 47 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1025 place count 47 transition count 94
Free-agglomeration rule applied 11 times.
Iterating global reduction 12 with 11 rules applied. Total rules applied 1036 place count 47 transition count 83
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1049 place count 36 transition count 81
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 1052 place count 36 transition count 81
Graph (complete) has 142 edges and 36 vertex of which 35 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 1053 place count 35 transition count 81
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1056 place count 35 transition count 78
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1059 place count 35 transition count 78
Graph (complete) has 134 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 1060 place count 34 transition count 78
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1063 place count 34 transition count 75
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 1066 place count 34 transition count 75
Graph (complete) has 126 edges and 34 vertex of which 33 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 1067 place count 33 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 1070 place count 33 transition count 72
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 1073 place count 33 transition count 72
Graph (complete) has 118 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 1 rules applied. Total rules applied 1074 place count 32 transition count 72
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 1077 place count 32 transition count 69
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 1080 place count 32 transition count 69
Graph (complete) has 110 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 21 with 1 rules applied. Total rules applied 1081 place count 31 transition count 69
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 1084 place count 31 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 1085 place count 30 transition count 65
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t365.t369.t559.t591 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 17 edges and 26 vertex of which 3 / 26 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 23 with 5 rules applied. Total rules applied 1090 place count 24 transition count 61
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (trivial) has 25 edges and 18 vertex of which 13 / 18 are part of one of the 2 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 24 with 26 rules applied. Total rules applied 1116 place count 7 transition count 42
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 33 transitions.
Graph (complete) has 9 edges and 7 vertex of which 5 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 25 with 34 rules applied. Total rules applied 1150 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 26 with 2 rules applied. Total rules applied 1152 place count 5 transition count 6
Free-agglomeration rule applied 2 times.
Iterating global reduction 26 with 2 rules applied. Total rules applied 1154 place count 5 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 1156 place count 3 transition count 4
Applied a total of 1156 rules in 112 ms. Remains 3 /501 variables (removed 498) and now considering 4/697 (removed 693) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 3/501 places, 4/697 transitions.
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1008 edges and 501 vertex of which 495 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.12 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 697/697 transitions.
Graph (trivial) has 539 edges and 501 vertex of which 3 / 501 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1006 edges and 499 vertex of which 493 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 210 place count 492 transition count 479
Reduce places removed 208 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 284 transition count 477
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 421 place count 283 transition count 477
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 421 place count 283 transition count 429
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 517 place count 235 transition count 429
Performed 86 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 689 place count 149 transition count 316
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 700 place count 149 transition count 305
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 708 place count 141 transition count 292
Iterating global reduction 4 with 8 rules applied. Total rules applied 716 place count 141 transition count 292
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 718 place count 140 transition count 291
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 719 place count 139 transition count 289
Iterating global reduction 4 with 1 rules applied. Total rules applied 720 place count 139 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 721 place count 139 transition count 288
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 803 place count 98 transition count 334
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 5 with 19 rules applied. Total rules applied 822 place count 98 transition count 315
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 850 place count 70 transition count 203
Iterating global reduction 6 with 28 rules applied. Total rules applied 878 place count 70 transition count 203
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 895 place count 70 transition count 186
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 902 place count 63 transition count 148
Iterating global reduction 7 with 7 rules applied. Total rules applied 909 place count 63 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 911 place count 63 transition count 146
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 919 place count 59 transition count 187
Drop transitions (Redundant composition of simpler transitions.) removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 8 with 50 rules applied. Total rules applied 969 place count 59 transition count 137
Partial Post-agglomeration rule applied 7 times.
Drop transitions (Partial Post agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 976 place count 59 transition count 137
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 978 place count 57 transition count 135
Applied a total of 978 rules in 75 ms. Remains 57 /501 variables (removed 444) and now considering 135/697 (removed 562) transitions.
[2025-05-30 13:20:16] [INFO ] Flow matrix only has 107 transitions (discarded 28 similar events)
// Phase 1: matrix 107 rows 57 cols
[2025-05-30 13:20:16] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:20:16] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-30 13:20:16] [INFO ] Flow matrix only has 107 transitions (discarded 28 similar events)
[2025-05-30 13:20:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:20:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 13:20:16] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:20:16] [INFO ] Redundant transitions in 3 ms returned []
Running 112 sub problems to find dead transitions.
[2025-05-30 13:20:16] [INFO ] Flow matrix only has 107 transitions (discarded 28 similar events)
[2025-05-30 13:20:16] [INFO ] Invariant cache hit.
[2025-05-30 13:20:16] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 106/163 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 1/164 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/164 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 65 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2825 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 106/163 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 112/176 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 1/164 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/164 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 177 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4454 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7366ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 7367ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/501 places, 135/697 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7601 ms. Remains : 57/501 places, 135/697 transitions.
Stuttering acceptance computed with spot in 352 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLCardinality-01
Product exploration explored 100000 steps with 205 reset in 177 ms.
Product exploration explored 100000 steps with 1777 reset in 95 ms.
Computed a total of 9 stabilizing places and 22 stable transitions
Computed a total of 9 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3263 steps (263 resets) in 31 ms. (101 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 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 135/135 transitions.
Applied a total of 0 rules in 8 ms. Remains 57 /57 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2025-05-30 13:20:25] [INFO ] Flow matrix only has 107 transitions (discarded 28 similar events)
[2025-05-30 13:20:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:20:25] [INFO ] Implicit Places using invariants in 46 ms returned []
[2025-05-30 13:20:25] [INFO ] Flow matrix only has 107 transitions (discarded 28 similar events)
[2025-05-30 13:20:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:20:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-05-30 13:20:25] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:20:25] [INFO ] Redundant transitions in 3 ms returned []
Running 112 sub problems to find dead transitions.
[2025-05-30 13:20:25] [INFO ] Flow matrix only has 107 transitions (discarded 28 similar events)
[2025-05-30 13:20:25] [INFO ] Invariant cache hit.
[2025-05-30 13:20:25] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 106/163 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 1/164 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 0/164 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 65 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2594 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 106/163 variables, 57/62 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 112/176 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 1/164 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/164 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 177 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4558 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 57/57 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7179ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 7180ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7309 ms. Remains : 57/57 places, 135/135 transitions.
Computed a total of 9 stabilizing places and 22 stable transitions
Computed a total of 9 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 774 steps (59 resets) in 8 ms. (86 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 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1917 reset in 65 ms.
Product exploration explored 100000 steps with 66 reset in 150 ms.
Built C files in :
/tmp/ltsmin11008376092980160360
[2025-05-30 13:20:33] [INFO ] Computing symmetric may disable matrix : 135 transitions.
[2025-05-30 13:20:33] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:20:33] [INFO ] Computing symmetric may enable matrix : 135 transitions.
[2025-05-30 13:20:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:20:33] [INFO ] Computing Do-Not-Accords matrix : 135 transitions.
[2025-05-30 13:20:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 13:20:33] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11008376092980160360
Running compilation step : cd /tmp/ltsmin11008376092980160360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 377 ms.
Running link step : cd /tmp/ltsmin11008376092980160360;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin11008376092980160360;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9108249945634604306.hoa' '--buchi-type=spotba'
LTSmin run took 312 ms.
FORMULA CO4-PT-20-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-20-LTLCardinality-01 finished in 17690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 4 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 697/697 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 497 transition count 693
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 497 transition count 693
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 494 transition count 690
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 494 transition count 690
Applied a total of 14 rules in 23 ms. Remains 494 /501 variables (removed 7) and now considering 690/697 (removed 7) transitions.
// Phase 1: matrix 690 rows 494 cols
[2025-05-30 13:20:34] [INFO ] Computed 5 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:20:34] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-30 13:20:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:20:34] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 689 sub problems to find dead transitions.
[2025-05-30 13:20:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/493 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 1 (OVERLAPS) 1/494 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 689 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:20:53] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:20:53] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 689 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/494 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 689 unsolved
SMT process timed out in 30206ms, After SMT, problems are : Problem set: 0 solved, 689 unsolved
Search for dead transitions found 0 dead transitions in 30210ms
Starting structural reductions in LTL mode, iteration 1 : 494/501 places, 690/697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30629 ms. Remains : 494/501 places, 690/697 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-20-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-20-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLCardinality-03 finished in 30784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 697/697 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 496 transition count 692
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 496 transition count 692
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 493 transition count 689
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 493 transition count 689
Applied a total of 16 rules in 24 ms. Remains 493 /501 variables (removed 8) and now considering 689/697 (removed 8) transitions.
// Phase 1: matrix 689 rows 493 cols
[2025-05-30 13:21:05] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:21:05] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-05-30 13:21:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:21:05] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 688 sub problems to find dead transitions.
[2025-05-30 13:21:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (OVERLAPS) 1/493 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 3 (OVERLAPS) 689/1182 variables, 493/498 constraints. Problems are: Problem set: 0 solved, 688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1182/1182 variables, and 498 constraints, problems are : Problem set: 0 solved, 688 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 688/688 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 688 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/492 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 1 (OVERLAPS) 1/493 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:21:49] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:21:49] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/493 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/493 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 4 (OVERLAPS) 689/1182 variables, 493/500 constraints. Problems are: Problem set: 0 solved, 688 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1182 variables, 688/1188 constraints. Problems are: Problem set: 0 solved, 688 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:22:05] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 9 ms to minimize.
SMT process timed out in 60189ms, After SMT, problems are : Problem set: 0 solved, 688 unsolved
Search for dead transitions found 0 dead transitions in 60192ms
Starting structural reductions in LTL mode, iteration 1 : 493/501 places, 689/697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60669 ms. Remains : 493/501 places, 689/697 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLCardinality-04
Product exploration explored 100000 steps with 531 reset in 117 ms.
Product exploration explored 100000 steps with 77 reset in 160 ms.
Computed a total of 21 stabilizing places and 36 stable transitions
Graph (complete) has 1001 edges and 493 vertex of which 488 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 21 stabilizing places and 36 stable transitions
Detected a total of 21/493 stabilizing places and 36/689 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 148 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (727 resets) in 245 ms. (162 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (116 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
[2025-05-30 13:22:06] [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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 116/125 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/136 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/164 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 273/437 variables, 126/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/437 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 293/730 variables, 118/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/730 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 231/961 variables, 111/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/961 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 160/1121 variables, 83/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1121 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 46/1167 variables, 30/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1167 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 11/1178 variables, 6/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1178 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/1182 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1182 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1182 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1182/1182 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 116/125 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/136 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/164 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 273/437 variables, 126/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/437 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 293/730 variables, 118/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/730 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 231/961 variables, 111/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/961 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 160/1121 variables, 83/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1121 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 46/1167 variables, 30/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1167 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 11/1178 variables, 6/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1178 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/1182 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1182 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1182 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1182/1182 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 493/493 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 747ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 689/689 transitions.
Graph (trivial) has 532 edges and 493 vertex of which 3 / 493 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 998 edges and 491 vertex of which 474 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 211 transitions
Trivial Post-agglo rules discarded 211 transitions
Performed 211 trivial Post agglomeration. Transition count delta: 211
Iterating post reduction 0 with 236 rules applied. Total rules applied 238 place count 474 transition count 436
Reduce places removed 211 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 213 rules applied. Total rules applied 451 place count 263 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 452 place count 262 transition count 434
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 452 place count 262 transition count 385
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 550 place count 213 transition count 385
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 553 place count 210 transition count 382
Iterating global reduction 3 with 3 rules applied. Total rules applied 556 place count 210 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 559 place count 210 transition count 379
Performed 78 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 4 with 156 rules applied. Total rules applied 715 place count 132 transition count 278
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 726 place count 132 transition count 267
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 734 place count 124 transition count 254
Iterating global reduction 5 with 8 rules applied. Total rules applied 742 place count 124 transition count 254
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 750 place count 120 transition count 250
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 751 place count 120 transition count 249
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 752 place count 119 transition count 247
Iterating global reduction 6 with 1 rules applied. Total rules applied 753 place count 119 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 754 place count 119 transition count 246
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 7 with 76 rules applied. Total rules applied 830 place count 81 transition count 286
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 7 with 79 rules applied. Total rules applied 909 place count 81 transition count 207
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 937 place count 53 transition count 140
Iterating global reduction 8 with 28 rules applied. Total rules applied 965 place count 53 transition count 140
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 985 place count 53 transition count 120
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 992 place count 46 transition count 91
Iterating global reduction 9 with 7 rules applied. Total rules applied 999 place count 46 transition count 91
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1004 place count 46 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1006 place count 45 transition count 101
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1009 place count 45 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 11 with 9 rules applied. Total rules applied 1018 place count 45 transition count 89
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1019 place count 44 transition count 87
Iterating global reduction 11 with 1 rules applied. Total rules applied 1020 place count 44 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1021 place count 44 transition count 86
Free-agglomeration rule applied 11 times.
Iterating global reduction 12 with 11 rules applied. Total rules applied 1032 place count 44 transition count 75
Reduce places removed 11 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 13 rules applied. Total rules applied 1045 place count 33 transition count 73
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 1048 place count 33 transition count 73
Graph (complete) has 138 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 1049 place count 32 transition count 73
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 3 rules applied. Total rules applied 1052 place count 32 transition count 70
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 1055 place count 32 transition count 70
Graph (complete) has 130 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 1056 place count 31 transition count 70
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 1059 place count 31 transition count 67
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 17 with 3 rules applied. Total rules applied 1062 place count 31 transition count 67
Graph (complete) has 122 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 1063 place count 30 transition count 67
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 18 with 3 rules applied. Total rules applied 1066 place count 30 transition count 64
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 1069 place count 30 transition count 64
Graph (complete) has 114 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 1 rules applied. Total rules applied 1070 place count 29 transition count 64
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 1073 place count 29 transition count 61
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 21 with 3 rules applied. Total rules applied 1076 place count 29 transition count 61
Graph (complete) has 106 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 21 with 1 rules applied. Total rules applied 1077 place count 28 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 1080 place count 28 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 1081 place count 27 transition count 57
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t365.t369.t559.t591 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 16 edges and 23 vertex of which 3 / 23 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 23 with 5 rules applied. Total rules applied 1086 place count 21 transition count 53
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 21 edges and 15 vertex of which 11 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 9 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 24 with 20 rules applied. Total rules applied 1106 place count 6 transition count 40
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 25 with 35 rules applied. Total rules applied 1141 place count 5 transition count 6
Applied a total of 1141 rules in 57 ms. Remains 5 /493 variables (removed 488) and now considering 6/689 (removed 683) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 5/493 places, 6/689 transitions.
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 10 factoid took 268 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-20-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-20-LTLCardinality-04 finished in 62618 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))'
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 697/697 transitions.
Graph (trivial) has 538 edges and 501 vertex of which 3 / 501 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1006 edges and 499 vertex of which 493 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 210 place count 492 transition count 479
Reduce places removed 208 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 210 rules applied. Total rules applied 420 place count 284 transition count 477
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 422 place count 283 transition count 476
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 423 place count 282 transition count 476
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 423 place count 282 transition count 428
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 519 place count 234 transition count 428
Performed 87 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 693 place count 147 transition count 314
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 704 place count 147 transition count 303
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 712 place count 139 transition count 290
Iterating global reduction 5 with 8 rules applied. Total rules applied 720 place count 139 transition count 290
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 722 place count 138 transition count 289
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 723 place count 137 transition count 287
Iterating global reduction 5 with 1 rules applied. Total rules applied 724 place count 137 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 725 place count 137 transition count 286
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 807 place count 96 transition count 332
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 828 place count 96 transition count 311
Discarding 28 places :
Symmetric choice reduction at 7 with 28 rule applications. Total rules 856 place count 68 transition count 199
Iterating global reduction 7 with 28 rules applied. Total rules applied 884 place count 68 transition count 199
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 903 place count 68 transition count 180
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 910 place count 61 transition count 142
Iterating global reduction 8 with 7 rules applied. Total rules applied 917 place count 61 transition count 142
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 922 place count 61 transition count 137
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 928 place count 58 transition count 170
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 9 with 36 rules applied. Total rules applied 964 place count 58 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 966 place count 56 transition count 132
Applied a total of 966 rules in 46 ms. Remains 56 /501 variables (removed 445) and now considering 132/697 (removed 565) transitions.
[2025-05-30 13:22:07] [INFO ] Flow matrix only has 111 transitions (discarded 21 similar events)
// Phase 1: matrix 111 rows 56 cols
[2025-05-30 13:22:07] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:22:07] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-05-30 13:22:07] [INFO ] Flow matrix only has 111 transitions (discarded 21 similar events)
[2025-05-30 13:22:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:22:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 13:22:07] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:22:07] [INFO ] Redundant transitions in 4 ms returned []
Running 109 sub problems to find dead transitions.
[2025-05-30 13:22:07] [INFO ] Flow matrix only has 111 transitions (discarded 21 similar events)
[2025-05-30 13:22:07] [INFO ] Invariant cache hit.
[2025-05-30 13:22:07] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 110/166 variables, 56/61 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 1/167 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/167 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 65 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2479 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 56/56 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 110/166 variables, 56/61 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 109/173 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 1/167 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/167 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 174 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4605 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 56/56 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7115ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 7117ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/501 places, 132/697 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7273 ms. Remains : 56/501 places, 132/697 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLCardinality-06
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA CO4-PT-20-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLCardinality-06 finished in 7346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))&&p0)))'
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 697/697 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 498 transition count 694
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 498 transition count 694
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 496 transition count 692
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 496 transition count 692
Applied a total of 10 rules in 19 ms. Remains 496 /501 variables (removed 5) and now considering 692/697 (removed 5) transitions.
// Phase 1: matrix 692 rows 496 cols
[2025-05-30 13:22:15] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:22:15] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-05-30 13:22:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:22:15] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Running 691 sub problems to find dead transitions.
[2025-05-30 13:22:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (OVERLAPS) 692/1188 variables, 496/501 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1188/1188 variables, and 501 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 691 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (OVERLAPS) 692/1188 variables, 496/501 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1188 variables, 691/1192 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1188/1188 variables, and 1192 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60157ms problems are : Problem set: 0 solved, 691 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 496/501 places, 692/697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60579 ms. Remains : 496/501 places, 692/697 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CO4-PT-20-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLCardinality-08 finished in 60757 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 G(!p0)))'
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 697/697 transitions.
Graph (trivial) has 537 edges and 501 vertex of which 3 / 501 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1006 edges and 499 vertex of which 493 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 205 transitions
Trivial Post-agglo rules discarded 205 transitions
Performed 205 trivial Post agglomeration. Transition count delta: 205
Iterating post reduction 0 with 205 rules applied. Total rules applied 207 place count 492 transition count 482
Reduce places removed 205 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 207 rules applied. Total rules applied 414 place count 287 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 415 place count 286 transition count 480
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 415 place count 286 transition count 432
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 511 place count 238 transition count 432
Performed 87 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 685 place count 151 transition count 318
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 696 place count 151 transition count 307
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 704 place count 143 transition count 294
Iterating global reduction 4 with 8 rules applied. Total rules applied 712 place count 143 transition count 294
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 714 place count 142 transition count 293
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 715 place count 141 transition count 291
Iterating global reduction 4 with 1 rules applied. Total rules applied 716 place count 141 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 717 place count 141 transition count 290
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 799 place count 100 transition count 335
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 820 place count 100 transition count 314
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 848 place count 72 transition count 202
Iterating global reduction 6 with 28 rules applied. Total rules applied 876 place count 72 transition count 202
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 895 place count 72 transition count 183
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 901 place count 66 transition count 151
Iterating global reduction 7 with 6 rules applied. Total rules applied 907 place count 66 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 911 place count 66 transition count 147
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -26
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 917 place count 63 transition count 173
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 8 with 40 rules applied. Total rules applied 957 place count 63 transition count 133
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 959 place count 61 transition count 131
Applied a total of 959 rules in 51 ms. Remains 61 /501 variables (removed 440) and now considering 131/697 (removed 566) transitions.
[2025-05-30 13:23:15] [INFO ] Flow matrix only has 112 transitions (discarded 19 similar events)
// Phase 1: matrix 112 rows 61 cols
[2025-05-30 13:23:15] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:23:15] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-30 13:23:15] [INFO ] Flow matrix only has 112 transitions (discarded 19 similar events)
[2025-05-30 13:23:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:23:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 13:23:15] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:23:15] [INFO ] Redundant transitions in 15 ms returned [107]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 106 sub problems to find dead transitions.
[2025-05-30 13:23:15] [INFO ] Flow matrix only has 112 transitions (discarded 18 similar events)
[2025-05-30 13:23:15] [INFO ] Invariant cache hit.
[2025-05-30 13:23:15] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 111/172 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 1/173 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/173 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 68 constraints, problems are : Problem set: 0 solved, 106 unsolved in 2660 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 111/172 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 106/173 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 1/173 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/173 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 174 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4541 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7227ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 7228ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/501 places, 130/697 transitions.
Applied a total of 0 rules in 9 ms. Remains 61 /61 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7414 ms. Remains : 61/501 places, 130/697 transitions.
Stuttering acceptance computed with spot in 115 ms :[p0, true, p0]
Running random walk in product with property : CO4-PT-20-LTLCardinality-09
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLCardinality-09 finished in 7545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 697/697 transitions.
Graph (trivial) has 538 edges and 501 vertex of which 3 / 501 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1006 edges and 499 vertex of which 493 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 207 transitions
Trivial Post-agglo rules discarded 207 transitions
Performed 207 trivial Post agglomeration. Transition count delta: 207
Iterating post reduction 0 with 207 rules applied. Total rules applied 209 place count 492 transition count 480
Reduce places removed 207 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 209 rules applied. Total rules applied 418 place count 285 transition count 478
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 419 place count 284 transition count 478
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 419 place count 284 transition count 430
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 515 place count 236 transition count 430
Performed 86 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 687 place count 150 transition count 317
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 698 place count 150 transition count 306
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 706 place count 142 transition count 293
Iterating global reduction 4 with 8 rules applied. Total rules applied 714 place count 142 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 716 place count 141 transition count 292
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 717 place count 140 transition count 290
Iterating global reduction 4 with 1 rules applied. Total rules applied 718 place count 140 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 719 place count 140 transition count 289
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 801 place count 99 transition count 334
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 822 place count 99 transition count 313
Discarding 26 places :
Symmetric choice reduction at 6 with 26 rule applications. Total rules 848 place count 73 transition count 209
Iterating global reduction 6 with 26 rules applied. Total rules applied 874 place count 73 transition count 209
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 891 place count 73 transition count 192
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 898 place count 66 transition count 154
Iterating global reduction 7 with 7 rules applied. Total rules applied 905 place count 66 transition count 154
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 910 place count 66 transition count 149
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -27
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 916 place count 63 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 8 with 42 rules applied. Total rules applied 958 place count 63 transition count 134
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 960 place count 61 transition count 132
Applied a total of 960 rules in 41 ms. Remains 61 /501 variables (removed 440) and now considering 132/697 (removed 565) transitions.
[2025-05-30 13:23:23] [INFO ] Flow matrix only has 115 transitions (discarded 17 similar events)
// Phase 1: matrix 115 rows 61 cols
[2025-05-30 13:23:23] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:23:23] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-05-30 13:23:23] [INFO ] Flow matrix only has 115 transitions (discarded 17 similar events)
[2025-05-30 13:23:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:23:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 13:23:23] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 13:23:23] [INFO ] Redundant transitions in 1 ms returned []
Running 109 sub problems to find dead transitions.
[2025-05-30 13:23:23] [INFO ] Flow matrix only has 115 transitions (discarded 17 similar events)
[2025-05-30 13:23:23] [INFO ] Invariant cache hit.
[2025-05-30 13:23:23] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 114/175 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 1/176 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/176 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 68 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2857 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 114/175 variables, 61/66 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 109/176 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 1/176 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/176 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 177 constraints, problems are : Problem set: 0 solved, 109 unsolved in 4858 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 61/61 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7735ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 7736ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/501 places, 132/697 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8133 ms. Remains : 61/501 places, 132/697 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLCardinality-11
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLCardinality-11 finished in 8239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 697/697 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 497 transition count 693
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 497 transition count 693
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 495 transition count 691
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 495 transition count 691
Applied a total of 12 rules in 20 ms. Remains 495 /501 variables (removed 6) and now considering 691/697 (removed 6) transitions.
// Phase 1: matrix 691 rows 495 cols
[2025-05-30 13:23:31] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:23:31] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-05-30 13:23:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 13:23:32] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 690 sub problems to find dead transitions.
[2025-05-30 13:23:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (OVERLAPS) 691/1186 variables, 495/500 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 500 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 1 (OVERLAPS) 1/495 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:24:15] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 13:24:15] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/495 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 4 (OVERLAPS) 691/1186 variables, 495/502 constraints. Problems are: Problem set: 0 solved, 690 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1186 variables, 690/1192 constraints. Problems are: Problem set: 0 solved, 690 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 1192 constraints, problems are : Problem set: 0 solved, 690 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 495/495 constraints, PredecessorRefiner: 690/690 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 690 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Starting structural reductions in LTL mode, iteration 1 : 495/501 places, 691/697 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60626 ms. Remains : 495/501 places, 691/697 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-20-LTLCardinality-14
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA CO4-PT-20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-20-LTLCardinality-14 finished in 60730 ms.
All properties solved by simple procedures.
Total runtime 262113 ms.

BK_STOP 1748611472350

--------------------
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="CO4-PT-20"
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 CO4-PT-20, 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 r044-tall-174854028600531"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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