About the Execution of ITS-Tools for IBM703-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 385924.00 | 0.00 | 0.00 | FFFFFFFFFFTFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422500348.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 IBM703-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422500348
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 203K 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 IBM703-PT-none-LTLFireability-00
FORMULA_NAME IBM703-PT-none-LTLFireability-01
FORMULA_NAME IBM703-PT-none-LTLFireability-02
FORMULA_NAME IBM703-PT-none-LTLFireability-03
FORMULA_NAME IBM703-PT-none-LTLFireability-04
FORMULA_NAME IBM703-PT-none-LTLFireability-05
FORMULA_NAME IBM703-PT-none-LTLFireability-06
FORMULA_NAME IBM703-PT-none-LTLFireability-07
FORMULA_NAME IBM703-PT-none-LTLFireability-08
FORMULA_NAME IBM703-PT-none-LTLFireability-09
FORMULA_NAME IBM703-PT-none-LTLFireability-10
FORMULA_NAME IBM703-PT-none-LTLFireability-11
FORMULA_NAME IBM703-PT-none-LTLFireability-12
FORMULA_NAME IBM703-PT-none-LTLFireability-13
FORMULA_NAME IBM703-PT-none-LTLFireability-14
FORMULA_NAME IBM703-PT-none-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748835804278
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM703-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 03:43:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 03:43:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:43:25] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2025-06-02 03:43:25] [INFO ] Transformed 262 places.
[2025-06-02 03:43:25] [INFO ] Transformed 284 transitions.
[2025-06-02 03:43:25] [INFO ] Found NUPN structural information;
[2025-06-02 03:43:25] [INFO ] Parsed PT model containing 262 places and 284 transitions and 572 arcs in 250 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA IBM703-PT-none-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 284/284 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 256 transition count 284
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 32 place count 230 transition count 258
Iterating global reduction 1 with 26 rules applied. Total rules applied 58 place count 230 transition count 258
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 67 place count 221 transition count 249
Iterating global reduction 1 with 9 rules applied. Total rules applied 76 place count 221 transition count 249
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 83 place count 214 transition count 242
Iterating global reduction 1 with 7 rules applied. Total rules applied 90 place count 214 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 91 place count 214 transition count 241
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 212 transition count 239
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 212 transition count 239
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 210 transition count 237
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 210 transition count 237
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 208 transition count 235
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 208 transition count 235
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 207 transition count 234
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 207 transition count 234
Applied a total of 105 rules in 112 ms. Remains 207 /262 variables (removed 55) and now considering 234/284 (removed 50) transitions.
// Phase 1: matrix 234 rows 207 cols
[2025-06-02 03:43:26] [INFO ] Computed 0 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:43:26] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-06-02 03:43:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:43:26] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 233 sub problems to find dead transitions.
[2025-06-02 03:43:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 234/440 variables, 206/206 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (OVERLAPS) 1/441 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 0/441 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 441/441 variables, and 207 constraints, problems are : Problem set: 0 solved, 233 unsolved in 23942 ms.
Refiners :[State Equation: 207/207 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 234/440 variables, 206/206 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/440 variables, 233/439 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 1/441 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/441 variables, and 440 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30028 ms.
Refiners :[State Equation: 207/207 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54041ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 54052ms
Starting structural reductions in LTL mode, iteration 1 : 207/262 places, 234/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54596 ms. Remains : 207/262 places, 234/284 transitions.
Support contains 27 out of 207 places after structural reductions.
[2025-06-02 03:44:20] [INFO ] Flatten gal took : 34 ms
[2025-06-02 03:44:20] [INFO ] Flatten gal took : 15 ms
[2025-06-02 03:44:20] [INFO ] Input system was already deterministic with 234 transitions.
Support contains 26 out of 207 places (down from 27) after GAL structural reductions.
RANDOM walk for 40000 steps (697 resets) in 1175 ms. (34 steps per ms) remains 3/24 properties
BEST_FIRST walk for 40001 steps (458 resets) in 422 ms. (94 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (448 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (459 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
[2025-06-02 03:44:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 33/52 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 45/97 variables, 18/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 52/149 variables, 25/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 56/205 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 52/257 variables, 26/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 43/300 variables, 21/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/300 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 33/333 variables, 17/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/333 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 23/356 variables, 13/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/356 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 15/371 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/371 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 15/386 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/386 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 16/402 variables, 9/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/402 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 8/410 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/410 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 8/418 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/418 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 9/427 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/427 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 8/435 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/435 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 5/440 variables, 3/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/440 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 441/441 variables, and 207 constraints, problems are : Problem set: 3 solved, 0 unsolved in 845 ms.
Refiners :[State Equation: 207/207 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 851ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA IBM703-PT-none-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA IBM703-PT-none-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 207 stabilizing places and 234 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 207 transition count 234
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(G(p0)))&&G(p1)))))'
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 234/234 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 198 transition count 225
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 198 transition count 225
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 189 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 189 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 189 transition count 215
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 182 transition count 208
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 182 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 182 transition count 207
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 177 transition count 202
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 177 transition count 202
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 173 transition count 198
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 173 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 170 transition count 195
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 170 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 170 transition count 194
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 79 place count 168 transition count 192
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 168 transition count 192
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 167 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 167 transition count 191
Applied a total of 83 rules in 29 ms. Remains 167 /207 variables (removed 40) and now considering 191/234 (removed 43) transitions.
// Phase 1: matrix 191 rows 167 cols
[2025-06-02 03:44:22] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:44:23] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-02 03:44:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:44:23] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2025-06-02 03:44:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 191/357 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (OVERLAPS) 1/358 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (OVERLAPS) 0/358 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 167 constraints, problems are : Problem set: 0 solved, 190 unsolved in 23782 ms.
Refiners :[State Equation: 167/167 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (OVERLAPS) 191/357 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 190/356 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 1/358 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 190 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/358 variables, and 357 constraints, problems are : Problem set: 0 solved, 190 unsolved in 30014 ms.
Refiners :[State Equation: 167/167 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53830ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 53831ms
Starting structural reductions in LTL mode, iteration 1 : 167/207 places, 191/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54043 ms. Remains : 167/207 places, 191/234 transitions.
Stuttering acceptance computed with spot in 386 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : IBM703-PT-none-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA IBM703-PT-none-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-00 finished in 54510 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) U X(p1))&&X(F(p2)))))'
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 234/234 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 198 transition count 225
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 198 transition count 225
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 190 transition count 217
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 190 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 190 transition count 216
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 184 transition count 210
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 184 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 184 transition count 209
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 180 transition count 205
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 180 transition count 205
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 176 transition count 201
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 176 transition count 201
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 67 place count 173 transition count 198
Iterating global reduction 2 with 3 rules applied. Total rules applied 70 place count 173 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 173 transition count 197
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 171 transition count 195
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 171 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 76 place count 170 transition count 194
Iterating global reduction 3 with 1 rules applied. Total rules applied 77 place count 170 transition count 194
Applied a total of 77 rules in 39 ms. Remains 170 /207 variables (removed 37) and now considering 194/234 (removed 40) transitions.
// Phase 1: matrix 194 rows 170 cols
[2025-06-02 03:45:17] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:45:17] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-02 03:45:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:45:17] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 193 sub problems to find dead transitions.
[2025-06-02 03:45:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 194/363 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (OVERLAPS) 1/364 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (OVERLAPS) 0/364 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 193 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 170 constraints, problems are : Problem set: 0 solved, 193 unsolved in 25170 ms.
Refiners :[State Equation: 170/170 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 193 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 1 (OVERLAPS) 194/363 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 193/362 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 4 (OVERLAPS) 1/364 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 193 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/364 variables, and 363 constraints, problems are : Problem set: 0 solved, 193 unsolved in 30026 ms.
Refiners :[State Equation: 170/170 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55243ms problems are : Problem set: 0 solved, 193 unsolved
Search for dead transitions found 0 dead transitions in 55244ms
Starting structural reductions in LTL mode, iteration 1 : 170/207 places, 194/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55542 ms. Remains : 170/207 places, 194/234 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-02
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA IBM703-PT-none-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-02 finished in 55842 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 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 234/234 transitions.
Graph (complete) has 236 edges and 207 vertex of which 78 are kept as prefixes of interest. Removing 129 places using SCC suffix rule.2 ms
Discarding 129 places :
Also discarding 142 output transitions
Drop transitions (Output transitions of discarded places.) removed 142 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 77 transition count 33
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 119 place count 20 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 18 transition count 30
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 121 place count 18 transition count 26
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 129 place count 14 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 13 transition count 24
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 13 transition count 24
Performed 6 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 143 place count 7 transition count 17
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 149 place count 7 transition count 11
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 151 place count 6 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 152 place count 6 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 154 place count 5 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 155 place count 5 transition count 8
Applied a total of 155 rules in 29 ms. Remains 5 /207 variables (removed 202) and now considering 8/234 (removed 226) transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-02 03:46:13] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:46:13] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-02 03:46:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:46:13] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:46:13] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-02 03:46:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 5 constraints, problems are : Problem set: 0 solved, 5 unsolved in 51 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 10 constraints, problems are : Problem set: 0 solved, 5 unsolved in 61 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 115ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/207 places, 8/234 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 5/207 places, 8/234 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-05 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U (p1&&G(p2))) U X(p1)))))'
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 234/234 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 199 transition count 226
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 199 transition count 226
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 192 transition count 219
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 192 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 192 transition count 218
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 187 transition count 213
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 187 transition count 213
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 184 transition count 210
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 184 transition count 210
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 182 transition count 208
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 182 transition count 208
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 180 transition count 206
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 180 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 180 transition count 205
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 179 transition count 204
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 179 transition count 204
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 178 transition count 203
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 178 transition count 203
Applied a total of 60 rules in 45 ms. Remains 178 /207 variables (removed 29) and now considering 203/234 (removed 31) transitions.
// Phase 1: matrix 203 rows 178 cols
[2025-06-02 03:46:13] [INFO ] Computed 0 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:46:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-02 03:46:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:46:13] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2025-06-02 03:46:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 203/380 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (OVERLAPS) 1/381 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 0/381 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 381/381 variables, and 178 constraints, problems are : Problem set: 0 solved, 202 unsolved in 22295 ms.
Refiners :[State Equation: 178/178 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 203/380 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 202/379 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 1/381 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/381 variables, and 380 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30020 ms.
Refiners :[State Equation: 178/178 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52330ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 52330ms
Starting structural reductions in LTL mode, iteration 1 : 178/207 places, 203/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52499 ms. Remains : 178/207 places, 203/234 transitions.
Stuttering acceptance computed with spot in 521 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA IBM703-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-06 finished in 53048 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 (p1 U (G(p1)||(p1&&G(p2))))) U G((F(!p2)||X(p0)))))'
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 234/234 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 199 transition count 226
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 199 transition count 226
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 192 transition count 219
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 192 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 192 transition count 218
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 187 transition count 213
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 187 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 187 transition count 212
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 184 transition count 209
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 184 transition count 209
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 182 transition count 207
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 182 transition count 207
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 181 transition count 206
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 181 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 180 transition count 205
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 180 transition count 205
Applied a total of 56 rules in 25 ms. Remains 180 /207 variables (removed 27) and now considering 205/234 (removed 29) transitions.
// Phase 1: matrix 205 rows 180 cols
[2025-06-02 03:47:06] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:47:06] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-02 03:47:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:47:06] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
Running 204 sub problems to find dead transitions.
[2025-06-02 03:47:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 205/384 variables, 179/179 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 1/385 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (OVERLAPS) 0/385 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 385/385 variables, and 180 constraints, problems are : Problem set: 0 solved, 204 unsolved in 24533 ms.
Refiners :[State Equation: 180/180 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (OVERLAPS) 205/384 variables, 179/179 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 204/383 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 1/385 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 385/385 variables, and 384 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30019 ms.
Refiners :[State Equation: 180/180 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54566ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 54566ms
Starting structural reductions in LTL mode, iteration 1 : 180/207 places, 205/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54736 ms. Remains : 180/207 places, 205/234 transitions.
Stuttering acceptance computed with spot in 524 ms :[(AND (NOT p0) p2), (AND p2 (NOT p0)), false, (AND p2 (NOT p0)), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p0) p2), false, p2, (AND p2 (NOT p0)), false, false]
Running random walk in product with property : IBM703-PT-none-LTLFireability-07
Stuttering criterion allowed to conclude after 91 steps with 27 reset in 3 ms.
FORMULA IBM703-PT-none-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-07 finished in 55296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(G(!p1)))))'
Support contains 2 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 234/234 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 198 transition count 225
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 198 transition count 225
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 190 transition count 217
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 190 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 190 transition count 216
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 184 transition count 210
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 184 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 184 transition count 209
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 180 transition count 205
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 180 transition count 205
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 177 transition count 202
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 177 transition count 202
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 175 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 175 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 175 transition count 199
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 174 transition count 198
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 174 transition count 198
Applied a total of 69 rules in 22 ms. Remains 174 /207 variables (removed 33) and now considering 198/234 (removed 36) transitions.
// Phase 1: matrix 198 rows 174 cols
[2025-06-02 03:48:01] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:01] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-02 03:48:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:02] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2025-06-02 03:48:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 198/371 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 1/372 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 0/372 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 174 constraints, problems are : Problem set: 0 solved, 197 unsolved in 23207 ms.
Refiners :[State Equation: 174/174 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 198/371 variables, 173/173 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/371 variables, 197/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/371 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (OVERLAPS) 1/372 variables, 1/371 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 197 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 371 constraints, problems are : Problem set: 0 solved, 197 unsolved in 30021 ms.
Refiners :[State Equation: 174/174 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53239ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 53239ms
Starting structural reductions in LTL mode, iteration 1 : 174/207 places, 198/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53383 ms. Remains : 174/207 places, 198/234 transitions.
Stuttering acceptance computed with spot in 235 ms :[p1, (AND (NOT p0) p1), p1, true, (AND (NOT p0) p1), p1, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : IBM703-PT-none-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-08 finished in 53641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(p1 U p2)))))'
Support contains 3 out of 207 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 207/207 places, 234/234 transitions.
Graph (complete) has 236 edges and 207 vertex of which 65 are kept as prefixes of interest. Removing 142 places using SCC suffix rule.1 ms
Discarding 142 places :
Also discarding 158 output transitions
Drop transitions (Output transitions of discarded places.) removed 158 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 64 transition count 28
Reduce places removed 45 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 47 rules applied. Total rules applied 95 place count 19 transition count 26
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 97 place count 18 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 98 place count 17 transition count 25
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 98 place count 17 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 106 place count 13 transition count 21
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 12 transition count 19
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 12 transition count 19
Performed 4 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 116 place count 8 transition count 14
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 118 place count 8 transition count 12
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 120 place count 7 transition count 13
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 121 place count 7 transition count 12
Applied a total of 121 rules in 12 ms. Remains 7 /207 variables (removed 200) and now considering 12/234 (removed 222) transitions.
// Phase 1: matrix 12 rows 7 cols
[2025-06-02 03:48:55] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:55] [INFO ] Implicit Places using invariants in 14 ms returned []
[2025-06-02 03:48:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:55] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:48:55] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2025-06-02 03:48:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/19 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 7 constraints, problems are : Problem set: 0 solved, 8 unsolved in 81 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/19 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 79 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 162ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 162ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/207 places, 12/234 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 214 ms. Remains : 7/207 places, 12/234 transitions.
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-11
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-11 finished in 304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 234/234 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 197 transition count 224
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 197 transition count 224
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 188 transition count 215
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 188 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 188 transition count 214
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 181 transition count 207
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 181 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 181 transition count 206
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 176 transition count 201
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 176 transition count 201
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 172 transition count 197
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 172 transition count 197
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 169 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 169 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 169 transition count 193
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 167 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 167 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 166 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 166 transition count 190
Applied a total of 85 rules in 16 ms. Remains 166 /207 variables (removed 41) and now considering 190/234 (removed 44) transitions.
// Phase 1: matrix 190 rows 166 cols
[2025-06-02 03:48:55] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:55] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-02 03:48:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:48:55] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2025-06-02 03:48:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 190/355 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 0/356 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 166 constraints, problems are : Problem set: 0 solved, 189 unsolved in 23868 ms.
Refiners :[State Equation: 166/166 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 190/355 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 189/354 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 1/356 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/356 variables, and 355 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30017 ms.
Refiners :[State Equation: 166/166 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53894ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 53895ms
Starting structural reductions in LTL mode, iteration 1 : 166/207 places, 190/234 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54059 ms. Remains : 166/207 places, 190/234 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLFireability-15 finished in 54297 ms.
All properties solved by simple procedures.
Total runtime 384436 ms.
BK_STOP 1748836190202
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -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="IBM703-PT-none"
export BK_EXAMINATION="LTLFireability"
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 IBM703-PT-none, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876422500348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IBM703-PT-none.tgz
mv IBM703-PT-none execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;