About the Execution of ITS-Tools for BusinessProcesses-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 749280.00 | 0.00 | 0.00 | FFFFFFTFFFFTFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813200036.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 BusinessProcesses-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813200036
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K 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 2.4K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 85K 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 BusinessProcesses-PT-05-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748548794638
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-29 19:59:57] [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-05-29 19:59:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:59:57] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2025-05-29 19:59:57] [INFO ] Transformed 368 places.
[2025-05-29 19:59:57] [INFO ] Transformed 319 transitions.
[2025-05-29 19:59:57] [INFO ] Found NUPN structural information;
[2025-05-29 19:59:57] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 49 place count 318 transition count 271
Iterating global reduction 1 with 47 rules applied. Total rules applied 96 place count 318 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 97 place count 318 transition count 270
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 118 place count 297 transition count 249
Iterating global reduction 2 with 21 rules applied. Total rules applied 139 place count 297 transition count 249
Applied a total of 139 rules in 186 ms. Remains 297 /367 variables (removed 70) and now considering 249/318 (removed 69) transitions.
// Phase 1: matrix 249 rows 297 cols
[2025-05-29 19:59:58] [INFO ] Computed 55 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 19:59:58] [INFO ] Implicit Places using invariants in 723 ms returned []
[2025-05-29 19:59:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:00:00] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2025-05-29 20:00:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:08] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:08] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:08] [INFO ] Deduced a trap composed of 11 places in 140 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:09] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:09] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:09] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:09] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:09] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:09] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:09] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:10] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:10] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:10] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:10] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:10] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:10] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:11] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:11] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:11] [INFO ] Deduced a trap composed of 24 places in 193 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:11] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:12] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:13] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:13] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:13] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:13] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:14] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:14] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:14] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:14] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:14] [INFO ] Deduced a trap composed of 25 places in 153 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:14] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:15] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:15] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:15] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:15] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:15] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:16] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:16] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:16] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:16] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:19] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:20] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:20] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:20] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:20] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:21] [INFO ] Deduced a trap composed of 30 places in 154 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:21] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:22] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:22] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:22] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:22] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:22] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:22] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 13/108 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:25] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:27] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 297/546 variables, and 110 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 0/297 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/297 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 55/110 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:33] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:33] [INFO ] Deduced a trap composed of 36 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:34] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:35] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:35] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:35] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:35] [INFO ] Deduced a trap composed of 30 places in 130 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 7/117 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:37] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:37] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:37] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:37] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:38] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 5/122 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (OVERLAPS) 249/546 variables, 297/419 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 248/667 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:48] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:48] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:48] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:50] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:50] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:50] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:51] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:51] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:52] [INFO ] Deduced a trap composed of 21 places in 115 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:52] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:52] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:52] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:52] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:52] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:52] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:53] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:53] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:53] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:53] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:53] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 20/687 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:59] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:00:59] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:00] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 19 ms to minimize.
SMT process timed out in 60307ms, After SMT, problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
Starting structural reductions in LTL mode, iteration 1 : 297/367 places, 249/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62578 ms. Remains : 297/367 places, 249/318 transitions.
Support contains 43 out of 297 places after structural reductions.
[2025-05-29 20:01:00] [INFO ] Flatten gal took : 141 ms
[2025-05-29 20:01:00] [INFO ] Flatten gal took : 57 ms
[2025-05-29 20:01:01] [INFO ] Input system was already deterministic with 249 transitions.
Support contains 42 out of 297 places (down from 43) after GAL structural reductions.
RANDOM walk for 40000 steps (375 resets) in 3410 ms. (11 steps per ms) remains 5/36 properties
BEST_FIRST walk for 40003 steps (67 resets) in 149 ms. (266 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (54 resets) in 257 ms. (155 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (71 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (67 resets) in 235 ms. (169 steps per ms) remains 3/3 properties
[2025-05-29 20:01:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp33 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/39 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 240/279 variables, 51/55 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:02] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:02] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:02] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:03] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:03] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:03] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:03] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:03] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:03] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 9/64 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 230/509 variables, 279/343 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:03] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:03] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 2/345 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:03] [INFO ] Deduced a trap along path composed of 3 places in 59 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 1/346 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 0/346 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 27/536 variables, 11/357 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 0/357 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 10/546 variables, 7/364 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/546 variables, 0/364 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/546 variables, 0/364 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 364 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2184 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/15 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 264/279 variables, 54/55 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/279 variables, 11/66 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/279 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 230/509 variables, 279/345 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 1/346 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 1/347 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 27/536 variables, 11/358 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 1/359 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/536 variables, 0/359 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 10/546 variables, 7/366 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/546 variables, 0/366 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/546 variables, 0/366 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 366 constraints, problems are : Problem set: 1 solved, 2 unsolved in 984 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3180ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 165 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=82 )
Parikh walk visited 2 properties in 92 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 291 stabilizing places and 241 stable transitions
Graph (complete) has 624 edges and 297 vertex of which 296 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 249/249 transitions.
Graph (trivial) has 158 edges and 297 vertex of which 6 / 297 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 618 edges and 292 vertex of which 291 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 290 transition count 200
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 249 transition count 200
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 84 place count 249 transition count 146
Deduced a syphon composed of 54 places in 3 ms
Ensure Unique test removed 12 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 204 place count 183 transition count 146
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 226 place count 161 transition count 124
Iterating global reduction 2 with 22 rules applied. Total rules applied 248 place count 161 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 248 place count 161 transition count 123
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 251 place count 159 transition count 123
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 396 place count 86 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 397 place count 85 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 84 transition count 50
Applied a total of 398 rules in 112 ms. Remains 84 /297 variables (removed 213) and now considering 50/249 (removed 199) transitions.
// Phase 1: matrix 50 rows 84 cols
[2025-05-29 20:01:06] [INFO ] Computed 40 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:01:06] [INFO ] Implicit Places using invariants in 162 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/297 places, 50/249 transitions.
Applied a total of 0 rules in 9 ms. Remains 83 /83 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 286 ms. Remains : 83/297 places, 50/249 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-00 finished in 701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1)&&F(p2)&&X(F(p3)))))'
Support contains 3 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 249/249 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 277 transition count 229
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 277 transition count 229
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 271 transition count 223
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 271 transition count 223
Applied a total of 52 rules in 36 ms. Remains 271 /297 variables (removed 26) and now considering 223/249 (removed 26) transitions.
// Phase 1: matrix 223 rows 271 cols
[2025-05-29 20:01:07] [INFO ] Computed 55 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:01:07] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-05-29 20:01:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:01:08] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 923 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2025-05-29 20:01:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:13] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:14] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:14] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:14] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:14] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:14] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:15] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:15] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:15] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:15] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:15] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:15] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:15] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:16] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:16] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:16] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:17] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:17] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:17] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:18] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:19] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:19] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:19] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:20] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 223/494 variables, 271/350 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:27] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:28] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:28] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:28] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:28] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:29] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:29] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 7/357 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:36] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:36] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/494 variables, and 359 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (OVERLAPS) 1/271 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 33/88 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:41] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:41] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:42] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:42] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:42] [INFO ] Deduced a trap composed of 35 places in 174 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:42] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:42] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:43] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:43] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:43] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:43] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:43] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:44] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 13/101 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 223/494 variables, 271/372 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 222/594 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:52] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:54] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:55] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:55] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:55] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:56] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:56] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:56] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:01:59] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:00] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:00] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:00] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 12/606 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 494/494 variables, and 606 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 271/297 places, 223/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61051 ms. Remains : 271/297 places, 223/249 transitions.
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-01 finished in 61462 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&&G(p1)) U (F(!p0)||X(p2))) U X(p3))))'
Support contains 4 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 249/249 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 276 transition count 228
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 276 transition count 228
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 270 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 270 transition count 222
Applied a total of 54 rules in 31 ms. Remains 270 /297 variables (removed 27) and now considering 222/249 (removed 27) transitions.
// Phase 1: matrix 222 rows 270 cols
[2025-05-29 20:02:08] [INFO ] Computed 55 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:02:08] [INFO ] Implicit Places using invariants in 253 ms returned []
[2025-05-29 20:02:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:02:09] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2025-05-29 20:02:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:15] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:15] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:16] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:16] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:16] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:16] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:16] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:16] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:17] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:17] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:17] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:17] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:17] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:17] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:18] [INFO ] Deduced a trap composed of 25 places in 163 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:18] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:19] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:19] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:19] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:19] [INFO ] Deduced a trap composed of 18 places in 160 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:20] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:21] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:21] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:25] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 222/492 variables, 270/349 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:33] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:34] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:35] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:35] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:35] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 7/356 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:39] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:39] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 358 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 33/88 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:42] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:43] [INFO ] Deduced a trap composed of 29 places in 173 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:43] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:43] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:43] [INFO ] Deduced a trap composed of 36 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:43] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:43] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:44] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:46] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:46] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:46] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:46] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:46] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:46] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:47] [INFO ] Deduced a trap composed of 30 places in 156 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:47] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:47] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:47] [INFO ] Deduced a trap composed of 35 places in 149 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 10/110 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (OVERLAPS) 222/492 variables, 270/380 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 221/601 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:56] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:56] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:58] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:59] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:59] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:59] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:02:59] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:00] [INFO ] Deduced a trap composed of 53 places in 139 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:01] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:01] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:01] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:01] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:01] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:02] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:02] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:02] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:02] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:02] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:03] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 19/620 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 620 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 60071ms
Starting structural reductions in LTL mode, iteration 1 : 270/297 places, 222/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61295 ms. Remains : 270/297 places, 222/249 transitions.
Stuttering acceptance computed with spot in 435 ms :[(NOT p3), (NOT p3), (AND p0 (NOT p3) (NOT p2)), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p1)), (AND p0 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-02
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 4 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-02 finished in 61767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X((p0||G(p1)))&&(p2||G(p3))) U (G((X((p0||G(p1)))&&(p2||G(p3))))||(p3&&X((p0||G(p1)))&&(p2||G(p3))))))'
Support contains 4 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 249/249 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 276 transition count 228
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 276 transition count 228
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 270 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 270 transition count 222
Applied a total of 54 rules in 23 ms. Remains 270 /297 variables (removed 27) and now considering 222/249 (removed 27) transitions.
// Phase 1: matrix 222 rows 270 cols
[2025-05-29 20:03:10] [INFO ] Computed 55 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:03:10] [INFO ] Implicit Places using invariants in 263 ms returned []
[2025-05-29 20:03:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:03:11] [INFO ] Implicit Places using invariants and state equation in 1134 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2025-05-29 20:03:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:17] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:18] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:18] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:18] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:18] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:18] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:18] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:19] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:19] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:19] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:19] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:19] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:19] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:20] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:20] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:20] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:21] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:21] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:21] [INFO ] Deduced a trap composed of 16 places in 153 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:21] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:23] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:23] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:23] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 222/492 variables, 270/348 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:31] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:32] [INFO ] Deduced a trap composed of 8 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:32] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:32] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:32] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:33] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:33] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 7/355 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:41] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:41] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 8 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 357 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 32/87 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:44] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:44] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:45] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:45] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:45] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:45] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:45] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:46] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:46] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:46] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:46] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:46] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:47] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 13/100 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 222/492 variables, 270/370 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 221/591 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:53] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:55] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:55] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:55] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:56] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:56] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:57] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:57] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:57] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:58] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:58] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:58] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:58] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:03:59] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:01] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:01] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:02] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 17/608 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 608 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60070ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in LTL mode, iteration 1 : 270/297 places, 222/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61499 ms. Remains : 270/297 places, 222/249 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (NOT p3), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-03 finished in 61779 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((G((p0||G(p1)))||(!p1 U (p2||G(!p1))))))'
Support contains 3 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 249/249 transitions.
Graph (trivial) has 158 edges and 297 vertex of which 6 / 297 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 618 edges and 292 vertex of which 291 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 290 transition count 200
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 84 place count 249 transition count 200
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 84 place count 249 transition count 145
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 207 place count 181 transition count 145
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 226 place count 162 transition count 126
Iterating global reduction 2 with 19 rules applied. Total rules applied 245 place count 162 transition count 126
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 245 place count 162 transition count 125
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 248 place count 160 transition count 125
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 396 place count 85 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 397 place count 84 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 398 place count 83 transition count 51
Applied a total of 398 rules in 63 ms. Remains 83 /297 variables (removed 214) and now considering 51/249 (removed 198) transitions.
// Phase 1: matrix 51 rows 83 cols
[2025-05-29 20:04:12] [INFO ] Computed 38 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:04:12] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-05-29 20:04:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:04:12] [INFO ] Implicit Places using invariants and state equation in 264 ms returned [0, 1, 2, 3, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 410 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/297 places, 51/249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 46 transition count 44
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 39 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 35 transition count 40
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 35 transition count 40
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 2 with 2 rules applied. Total rules applied 24 place count 35 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 33 transition count 38
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 36 place count 28 transition count 33
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 28 transition count 33
Applied a total of 37 rules in 15 ms. Remains 28 /46 variables (removed 18) and now considering 33/51 (removed 18) transitions.
// Phase 1: matrix 33 rows 28 cols
[2025-05-29 20:04:12] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:04:12] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-29 20:04:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:04:12] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/297 places, 33/249 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 605 ms. Remains : 28/297 places, 33/249 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p1), false, (AND p1 (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-04
Entered a terminal (fully accepting) state of product in 78 steps with 13 reset in 3 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-04 finished in 851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 249/249 transitions.
Graph (trivial) has 161 edges and 297 vertex of which 6 / 297 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 618 edges and 292 vertex of which 291 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 290 transition count 199
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 248 transition count 199
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 86 place count 248 transition count 143
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 125 rules applied. Total rules applied 211 place count 179 transition count 143
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 232 place count 158 transition count 122
Iterating global reduction 2 with 21 rules applied. Total rules applied 253 place count 158 transition count 122
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 401 place count 83 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 402 place count 82 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 403 place count 81 transition count 48
Applied a total of 403 rules in 53 ms. Remains 81 /297 variables (removed 216) and now considering 48/249 (removed 201) transitions.
// Phase 1: matrix 48 rows 81 cols
[2025-05-29 20:04:12] [INFO ] Computed 39 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:04:13] [INFO ] Implicit Places using invariants in 107 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 108 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/297 places, 48/249 transitions.
Applied a total of 0 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 167 ms. Remains : 80/297 places, 48/249 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-06
Product exploration explored 100000 steps with 22256 reset in 507 ms.
Product exploration explored 100000 steps with 22326 reset in 373 ms.
Computed a total of 80 stabilizing places and 47 stable transitions
Computed a total of 80 stabilizing places and 47 stable transitions
Detected a total of 80/80 stabilizing places and 47/48 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 339 steps (95 resets) in 9 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 7 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2025-05-29 20:04:14] [INFO ] Computed 38 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:04:14] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-05-29 20:04:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:04:15] [INFO ] Implicit Places using invariants and state equation in 334 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 491 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/80 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 42 transition count 40
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 34 transition count 40
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 30 transition count 36
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 30 transition count 36
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 2 with 2 rules applied. Total rules applied 26 place count 30 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 28 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 29 place count 27 transition count 33
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 27 transition count 33
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 42 place count 21 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 21 transition count 26
Applied a total of 43 rules in 10 ms. Remains 21 /42 variables (removed 21) and now considering 26/48 (removed 22) transitions.
// Phase 1: matrix 26 rows 21 cols
[2025-05-29 20:04:15] [INFO ] Computed 0 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:04:15] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-05-29 20:04:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:04:15] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/80 places, 26/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 628 ms. Remains : 21/80 places, 26/48 transitions.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Detected a total of 21/21 stabilizing places and 25/26 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 460 steps (154 resets) in 5 ms. (76 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 24113 reset in 88 ms.
Product exploration explored 100000 steps with 24217 reset in 100 ms.
Built C files in :
/tmp/ltsmin16618512892859730645
[2025-05-29 20:04:16] [INFO ] Computing symmetric may disable matrix : 26 transitions.
[2025-05-29 20:04:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:04:16] [INFO ] Computing symmetric may enable matrix : 26 transitions.
[2025-05-29 20:04:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:04:16] [INFO ] Computing Do-Not-Accords matrix : 26 transitions.
[2025-05-29 20:04:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 20:04:16] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16618512892859730645
Running compilation step : cd /tmp/ltsmin16618512892859730645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 499 ms.
Running link step : cd /tmp/ltsmin16618512892859730645;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 77 ms.
Running LTSmin : cd /tmp/ltsmin16618512892859730645;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2897483832723760779.hoa' '--buchi-type=spotba'
LTSmin run took 101 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-05-LTLFireability-06 finished in 3862 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 (p1||G(p0))))))'
Support contains 4 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 249/249 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 274 transition count 226
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 274 transition count 226
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 267 transition count 219
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 267 transition count 219
Applied a total of 60 rules in 23 ms. Remains 267 /297 variables (removed 30) and now considering 219/249 (removed 30) transitions.
// Phase 1: matrix 219 rows 267 cols
[2025-05-29 20:04:16] [INFO ] Computed 55 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:04:17] [INFO ] Implicit Places using invariants in 249 ms returned []
[2025-05-29 20:04:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:04:17] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-29 20:04: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/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:23] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:23] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:23] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:23] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:23] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:24] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:24] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:24] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:24] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:24] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:24] [INFO ] Deduced a trap composed of 21 places in 163 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:25] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:25] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:25] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:25] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:25] [INFO ] Deduced a trap composed of 27 places in 180 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:26] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:26] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:27] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:27] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:28] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:28] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:28] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:29] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:32] [INFO ] Deduced a trap composed of 29 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:32] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/486 variables, 267/348 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:41] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:41] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:41] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:42] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:42] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:42] [INFO ] Deduced a trap composed of 11 places in 180 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:43] [INFO ] Deduced a trap composed of 14 places in 165 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 7/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:47] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:47] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/486 variables, and 357 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 35/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:51] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:51] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:51] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:51] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:52] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:52] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:52] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:52] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:52] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:04:52] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 218/585 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:03] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:06] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:06] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:06] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:07] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:07] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:07] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:07] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:08] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 28 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 9/594 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 594 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60057ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in LTL mode, iteration 1 : 267/297 places, 219/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61264 ms. Remains : 267/297 places, 219/249 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-07
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-07 finished in 61384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 4 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 249/249 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 275 transition count 227
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 275 transition count 227
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 268 transition count 220
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 268 transition count 220
Applied a total of 58 rules in 20 ms. Remains 268 /297 variables (removed 29) and now considering 220/249 (removed 29) transitions.
// Phase 1: matrix 220 rows 268 cols
[2025-05-29 20:05:18] [INFO ] Computed 55 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:05:18] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-05-29 20:05:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:05:19] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 903 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-05-29 20:05:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:25] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:25] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:25] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:25] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:25] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:26] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:26] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:26] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:26] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:26] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:26] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 23 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 25 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:27] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:28] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:29] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:30] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:30] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:30] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:30] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:31] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:31] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:31] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:31] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:31] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/488 variables, 268/352 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:39] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:39] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:40] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:41] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:48] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 357 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 34/89 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:52] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:53] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:55] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:05:55] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 220/488 variables, 268/361 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 219/580 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:03] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:03] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:03] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:05] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:05] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:05] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:05] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:06] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:06] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:07] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:07] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:07] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:07] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:07] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:08] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:08] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:09] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:10] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:10] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:11] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 20/600 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:16] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:16] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:19] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 16 ms to minimize.
SMT process timed out in 60089ms, After SMT, problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 268/297 places, 220/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61016 ms. Remains : 268/297 places, 220/249 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-08 finished in 61198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X((p1 U (G(p2)||(p2&&F(p3))))) U (p0&&X((p1 U (G(p2)||(p2&&F(p3)))))))))))'
Support contains 4 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 249/249 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 277 transition count 229
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 277 transition count 229
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 272 transition count 224
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 272 transition count 224
Applied a total of 50 rules in 19 ms. Remains 272 /297 variables (removed 25) and now considering 224/249 (removed 25) transitions.
// Phase 1: matrix 224 rows 272 cols
[2025-05-29 20:06:19] [INFO ] Computed 55 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:06:19] [INFO ] Implicit Places using invariants in 270 ms returned []
[2025-05-29 20:06:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:06:20] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2025-05-29 20:06:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:27] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:27] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:27] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:27] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:27] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:27] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:28] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:28] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:28] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:28] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:28] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:28] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:29] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:29] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:29] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:29] [INFO ] Deduced a trap composed of 27 places in 172 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:29] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:30] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:30] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:30] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:32] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:32] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:32] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:32] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:32] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:33] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:33] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:33] [INFO ] Deduced a trap composed of 19 places in 152 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:33] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:33] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/496 variables, 272/357 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:41] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:41] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:42] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:42] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 4/361 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:49] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/496 variables, and 362 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 35/90 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:53] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:06:54] [INFO ] Deduced a trap composed of 27 places in 146 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 224/496 variables, 272/364 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 223/587 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:04] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:04] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:07] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:07] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:08] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:08] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:09] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:09] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:09] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 9/596 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:18] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/496 variables, and 597 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 272/297 places, 224/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61463 ms. Remains : 272/297 places, 224/249 transitions.
Stuttering acceptance computed with spot in 461 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-09
Product exploration explored 100000 steps with 19950 reset in 176 ms.
Stack based approach found an accepted trace after 1584 steps with 312 reset with depth 6 and stack size 6 in 10 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-09 finished in 62155 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 249/249 transitions.
Graph (trivial) has 162 edges and 297 vertex of which 6 / 297 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 618 edges and 292 vertex of which 291 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 290 transition count 198
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 247 transition count 198
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 88 place count 247 transition count 142
Deduced a syphon composed of 56 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 125 rules applied. Total rules applied 213 place count 178 transition count 142
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 234 place count 157 transition count 121
Iterating global reduction 2 with 21 rules applied. Total rules applied 255 place count 157 transition count 121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 255 place count 157 transition count 120
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 258 place count 155 transition count 120
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 404 place count 81 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 405 place count 80 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 406 place count 79 transition count 47
Applied a total of 406 rules in 38 ms. Remains 79 /297 variables (removed 218) and now considering 47/249 (removed 202) transitions.
// Phase 1: matrix 47 rows 79 cols
[2025-05-29 20:07:21] [INFO ] Computed 38 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:07:21] [INFO ] Implicit Places using invariants in 139 ms returned []
[2025-05-29 20:07:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:07:21] [INFO ] Implicit Places using invariants and state equation in 328 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 481 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/297 places, 47/249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 41 transition count 39
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 33 transition count 39
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 28 transition count 34
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 28 transition count 34
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 28 transition count 31
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 25 transition count 31
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 33 place count 24 transition count 30
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 24 transition count 30
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 42 place count 20 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 20 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 20 transition count 25
Applied a total of 44 rules in 11 ms. Remains 20 /41 variables (removed 21) and now considering 25/47 (removed 22) transitions.
// Phase 1: matrix 25 rows 20 cols
[2025-05-29 20:07:22] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:07:22] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-05-29 20:07:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:07:22] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/297 places, 25/249 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 632 ms. Remains : 20/297 places, 25/249 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-10 finished in 700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0) U X(X(X(p1)))))))'
Support contains 2 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 249/249 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 276 transition count 228
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 276 transition count 228
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 270 transition count 222
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 270 transition count 222
Applied a total of 54 rules in 18 ms. Remains 270 /297 variables (removed 27) and now considering 222/249 (removed 27) transitions.
// Phase 1: matrix 222 rows 270 cols
[2025-05-29 20:07:22] [INFO ] Computed 55 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:07:22] [INFO ] Implicit Places using invariants in 241 ms returned []
[2025-05-29 20:07:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:07:23] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2025-05-29 20:07: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/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:28] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:28] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:28] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:28] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:29] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:29] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:29] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:29] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:29] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:29] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:30] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:30] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:30] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:30] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:30] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:31] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:32] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:32] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:32] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:32] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:33] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:34] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:34] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:34] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:39] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:42] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 26 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 222/492 variables, 270/351 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:49] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:49] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:49] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:50] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:50] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:50] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:50] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 7/358 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 358 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 33/88 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:56] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:56] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:57] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:57] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:57] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:57] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:57] [INFO ] Deduced a trap composed of 37 places in 165 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:57] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:58] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:58] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:07:58] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 222/492 variables, 270/369 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 221/590 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:05] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:06] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:08] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:08] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:08] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:08] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:08] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:09] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:10] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:10] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:10] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:12] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:12] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 13/603 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 603 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 60052ms
Starting structural reductions in LTL mode, iteration 1 : 270/297 places, 222/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61362 ms. Remains : 270/297 places, 222/249 transitions.
Stuttering acceptance computed with spot in 581 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-11
Product exploration explored 100000 steps with 16666 reset in 266 ms.
Product exploration explored 100000 steps with 16666 reset in 345 ms.
Computed a total of 264 stabilizing places and 214 stable transitions
Graph (complete) has 579 edges and 270 vertex of which 269 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 264 stabilizing places and 214 stable transitions
Detected a total of 264/270 stabilizing places and 214/222 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 217 ms. Reduced automaton from 13 states, 17 edges and 2 AP (stutter sensitive) to 11 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 567 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 31484 steps (288 resets) in 180 ms. (173 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 370 ms. Reduced automaton from 11 states, 14 edges and 2 AP (stutter sensitive) to 11 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 493 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 544 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 222/222 transitions.
Applied a total of 0 rules in 6 ms. Remains 270 /270 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2025-05-29 20:08:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:08:27] [INFO ] Implicit Places using invariants in 220 ms returned []
[2025-05-29 20:08:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:08:28] [INFO ] Implicit Places using invariants and state equation in 915 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2025-05-29 20:08:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:33] [INFO ] Deduced a trap composed of 9 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:33] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:34] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:34] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:34] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:34] [INFO ] Deduced a trap composed of 14 places in 194 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:34] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:35] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:35] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:35] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:35] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:35] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:35] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:36] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:36] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:36] [INFO ] Deduced a trap composed of 27 places in 147 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:37] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:37] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:37] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:37] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:38] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:39] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:39] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:39] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:42] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:45] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 222/492 variables, 270/351 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:51] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:52] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:52] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:52] [INFO ] Deduced a trap composed of 61 places in 203 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:52] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:53] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:53] [INFO ] Deduced a trap composed of 14 places in 177 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 7/358 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:57] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:08:57] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 360 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 35/90 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:01] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:02] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:03] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:03] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:03] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 222/492 variables, 270/371 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 221/592 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:10] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:10] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:10] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:12] [INFO ] Deduced a trap composed of 20 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:12] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:12] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:12] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:12] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:13] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:13] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:13] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:13] [INFO ] Deduced a trap composed of 35 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:13] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:13] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:15] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:16] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:17] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:19] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 19/611 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 611 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Finished structural reductions in LTL mode , in 1 iterations and 61191 ms. Remains : 270/270 places, 222/222 transitions.
Computed a total of 264 stabilizing places and 214 stable transitions
Graph (complete) has 579 edges and 270 vertex of which 269 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 264 stabilizing places and 214 stable transitions
Detected a total of 264/270 stabilizing places and 214/222 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 11 states, 14 edges and 2 AP (stutter sensitive) to 11 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 599 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 33508 steps (308 resets) in 164 ms. (203 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 324 ms. Reduced automaton from 11 states, 14 edges and 2 AP (stutter sensitive) to 11 states, 14 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 577 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 688 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 589 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 437 ms.
Product exploration explored 100000 steps with 16666 reset in 330 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 511 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 270/270 places, 222/222 transitions.
Graph (trivial) has 133 edges and 270 vertex of which 6 / 270 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 572 edges and 265 vertex of which 264 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 264 transition count 215
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 38 Pre rules applied. Total rules applied 32 place count 264 transition count 249
Deduced a syphon composed of 68 places in 1 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 70 place count 264 transition count 249
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 79 place count 255 transition count 232
Deduced a syphon composed of 59 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 88 place count 255 transition count 232
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 156 places in 0 ms
Iterating global reduction 1 with 97 rules applied. Total rules applied 185 place count 255 transition count 232
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 206 place count 234 transition count 211
Deduced a syphon composed of 135 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 227 place count 234 transition count 211
Deduced a syphon composed of 135 places in 0 ms
Applied a total of 227 rules in 74 ms. Remains 234 /270 variables (removed 36) and now considering 211/222 (removed 11) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 20:09:33] [INFO ] Redundant transitions in 34 ms returned []
Running 210 sub problems to find dead transitions.
// Phase 1: matrix 211 rows 234 cols
[2025-05-29 20:09:33] [INFO ] Computed 55 invariants in 2 ms
[2025-05-29 20:09:33] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:37] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:37] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:37] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:37] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 4 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 4 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 4 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Problem TDEAD10 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/75 constraints. Problems are: Problem set: 73 solved, 137 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 4 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:38] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 4 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 4 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 3 ms to minimize.
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 3 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 4 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 4 ms to minimize.
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 3 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:39] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/95 constraints. Problems are: Problem set: 128 solved, 82 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:40] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:40] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:40] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:40] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 4 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:40] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:40] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 5 ms to minimize.
Problem TDEAD53 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:40] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 4 ms to minimize.
Problem TDEAD56 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:41] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 4 ms to minimize.
Problem TDEAD59 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:41] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 3 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:41] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 3 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:41] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 4 ms to minimize.
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD116 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:41] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 3 ms to minimize.
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:41] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 3 ms to minimize.
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:41] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Problem TDEAD149 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:09:41] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 3 ms to minimize.
Problem TDEAD156 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 15/110 constraints. Problems are: Problem set: 160 solved, 50 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/110 constraints. Problems are: Problem set: 160 solved, 50 unsolved
Problem TDEAD67 is UNSAT
At refinement iteration 6 (OVERLAPS) 210/444 variables, 234/344 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 5/349 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/349 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 1/445 variables, 1/350 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/350 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/445 variables, 0/350 constraints. Problems are: Problem set: 161 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 350 constraints, problems are : Problem set: 161 solved, 49 unsolved in 16052 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 234/234 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 161 solved, 49 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 135/233 variables, 55/55 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 55/110 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/110 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 210/443 variables, 233/343 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 5/348 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 49/397 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/397 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 1/444 variables, 1/398 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/398 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 1/445 variables, 1/399 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/399 constraints. Problems are: Problem set: 161 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 0/445 variables, 0/399 constraints. Problems are: Problem set: 161 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 399 constraints, problems are : Problem set: 161 solved, 49 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 234/234 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 49/210 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46183ms problems are : Problem set: 161 solved, 49 unsolved
Search for dead transitions found 161 dead transitions in 46184ms
Found 161 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 161 transitions
Dead transitions reduction (with SMT) removed 161 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 234/270 places, 50/222 transitions.
Graph (complete) has 398 edges and 234 vertex of which 99 are kept as prefixes of interest. Removing 135 places using SCC suffix rule.1 ms
Discarding 135 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Applied a total of 1 rules in 5 ms. Remains 83 /234 variables (removed 151) and now considering 50/50 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/270 places, 50/222 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46307 ms. Remains : 83/270 places, 50/222 transitions.
Built C files in :
/tmp/ltsmin5781555211022651855
[2025-05-29 20:10:19] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5781555211022651855
Running compilation step : cd /tmp/ltsmin5781555211022651855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 540 ms.
Running link step : cd /tmp/ltsmin5781555211022651855;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin5781555211022651855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13476068160893652370.hoa' '--buchi-type=spotba'
LTSmin run took 159 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-05-LTLFireability-11 finished in 177895 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 249/249 transitions.
Graph (trivial) has 161 edges and 297 vertex of which 6 / 297 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 618 edges and 292 vertex of which 291 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 290 transition count 199
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 248 transition count 199
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 86 place count 248 transition count 144
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 209 place count 180 transition count 144
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 230 place count 159 transition count 123
Iterating global reduction 2 with 21 rules applied. Total rules applied 251 place count 159 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 251 place count 159 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 254 place count 157 transition count 122
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 402 place count 82 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 403 place count 81 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 404 place count 80 transition count 48
Applied a total of 404 rules in 26 ms. Remains 80 /297 variables (removed 217) and now considering 48/249 (removed 201) transitions.
// Phase 1: matrix 48 rows 80 cols
[2025-05-29 20:10:20] [INFO ] Computed 38 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:10:20] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-05-29 20:10:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:10:20] [INFO ] Implicit Places using invariants and state equation in 335 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 19, 21, 23, 25, 27, 29, 31, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61]
Discarding 37 places :
Implicit Place search using SMT with State Equation took 475 ms to find 37 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/297 places, 48/249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 43 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 36 transition count 41
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 31 transition count 36
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 31 transition count 36
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 2 with 2 rules applied. Total rules applied 26 place count 31 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 29 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 29 place count 28 transition count 33
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 28 transition count 33
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 42 place count 22 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 22 transition count 26
Applied a total of 43 rules in 14 ms. Remains 22 /43 variables (removed 21) and now considering 26/48 (removed 22) transitions.
// Phase 1: matrix 26 rows 22 cols
[2025-05-29 20:10:20] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:10:20] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-05-29 20:10:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:10:20] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/297 places, 26/249 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 639 ms. Remains : 22/297 places, 26/249 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-12
Stuttering criterion allowed to conclude after 27 steps with 4 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-12 finished in 771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1 U p2))))'
Support contains 3 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 249/249 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 276 transition count 228
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 276 transition count 228
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 269 transition count 221
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 269 transition count 221
Applied a total of 56 rules in 19 ms. Remains 269 /297 variables (removed 28) and now considering 221/249 (removed 28) transitions.
// Phase 1: matrix 221 rows 269 cols
[2025-05-29 20:10:20] [INFO ] Computed 55 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:10:21] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-05-29 20:10:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:10:21] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2025-05-29 20:10:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:28] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:28] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:28] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:28] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:29] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:29] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:29] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:29] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:29] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:29] [INFO ] Deduced a trap composed of 19 places in 173 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:30] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:30] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:30] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:30] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:30] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:31] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:31] [INFO ] Deduced a trap composed of 14 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:32] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:32] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:32] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:34] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:34] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:34] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:34] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:38] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:39] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 23 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 221/490 variables, 269/350 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:48] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:49] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:49] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:49] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:49] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:50] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:50] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 357 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 33/88 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:55] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:56] [INFO ] Deduced a trap composed of 30 places in 183 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:56] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:56] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:56] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:56] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:57] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:57] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:57] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:10:57] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 10/98 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/490 variables, 269/367 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 220/587 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:08] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:08] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:08] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:08] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:09] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:09] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:10] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:10] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:10] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:11] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:11] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:11] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:11] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:12] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:12] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:12] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:12] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:13] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:13] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 19/606 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:21] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:21] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:21] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 11 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 609 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 269/297 places, 221/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61188 ms. Remains : 269/297 places, 221/249 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-13 finished in 61406 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(F(p0)))))'
Support contains 1 out of 297 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 297/297 places, 249/249 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 274 transition count 226
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 274 transition count 226
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 53 place count 267 transition count 219
Iterating global reduction 0 with 7 rules applied. Total rules applied 60 place count 267 transition count 219
Applied a total of 60 rules in 28 ms. Remains 267 /297 variables (removed 30) and now considering 219/249 (removed 30) transitions.
// Phase 1: matrix 219 rows 267 cols
[2025-05-29 20:11:22] [INFO ] Computed 55 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:11:22] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-05-29 20:11:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:11:23] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-05-29 20:11: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/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:28] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:28] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:29] [INFO ] Deduced a trap composed of 11 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:29] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:29] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:29] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:29] [INFO ] Deduced a trap composed of 15 places in 174 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:30] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:30] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:30] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:30] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:30] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:31] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:31] [INFO ] Deduced a trap composed of 23 places in 183 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:31] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:31] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:32] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:32] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:32] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:33] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:34] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:34] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:34] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:34] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:38] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:38] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/486 variables, 267/348 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:46] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:46] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:47] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:47] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:47] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:48] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 10 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 7/355 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:52] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:53] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/486 variables, and 357 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 35/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:57] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:57] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:57] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:57] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:57] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:58] [INFO ] Deduced a trap composed of 32 places in 177 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:58] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:58] [INFO ] Deduced a trap composed of 38 places in 168 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:58] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:11:58] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 10/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/367 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 218/585 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:08] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:10] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:10] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:11] [INFO ] Deduced a trap composed of 30 places in 115 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:11] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:11] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:11] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:12] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 20:12:12] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 28 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 9/594 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 594 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60054ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 267/297 places, 219/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61054 ms. Remains : 267/297 places, 219/249 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-14
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-14 finished in 61253 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&&G(p2))))'
Support contains 5 out of 297 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 297/297 places, 249/249 transitions.
Graph (trivial) has 158 edges and 297 vertex of which 6 / 297 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 618 edges and 292 vertex of which 291 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 290 transition count 199
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 248 transition count 199
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 86 place count 248 transition count 146
Deduced a syphon composed of 53 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 204 place count 183 transition count 146
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 224 place count 163 transition count 126
Iterating global reduction 2 with 20 rules applied. Total rules applied 244 place count 163 transition count 126
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 394 place count 87 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 395 place count 86 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 396 place count 85 transition count 51
Applied a total of 396 rules in 30 ms. Remains 85 /297 variables (removed 212) and now considering 51/249 (removed 198) transitions.
// Phase 1: matrix 51 rows 85 cols
[2025-05-29 20:12:23] [INFO ] Computed 40 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 20:12:23] [INFO ] Implicit Places using invariants in 148 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 149 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/297 places, 51/249 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 84/297 places, 51/249 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-15 finished in 369 ms.
All properties solved by simple procedures.
Total runtime 746829 ms.
BK_STOP 1748549543918
--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="BusinessProcesses-PT-05"
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 BusinessProcesses-PT-05, 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 r030-smll-174853813200036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-05.tgz
mv BusinessProcesses-PT-05 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 ;