About the Execution of ITS-Tools for BusinessProcesses-PT-11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFFFF?TFFFTFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813300084.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-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813300084
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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.8K 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 141K 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-11-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-11-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748577578675
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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 03:59:41] [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-30 03:59:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 03:59:41] [INFO ] Load time of PNML (sax parser for PT used): 251 ms
[2025-05-30 03:59:41] [INFO ] Transformed 567 places.
[2025-05-30 03:59:41] [INFO ] Transformed 508 transitions.
[2025-05-30 03:59:41] [INFO ] Found NUPN structural information;
[2025-05-30 03:59:41] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 510 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 7 places in 18 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 76 place count 484 transition count 429
Iterating global reduction 1 with 72 rules applied. Total rules applied 148 place count 484 transition count 429
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 180 place count 452 transition count 397
Iterating global reduction 1 with 32 rules applied. Total rules applied 212 place count 452 transition count 397
Applied a total of 212 rules in 271 ms. Remains 452 /560 variables (removed 108) and now considering 397/501 (removed 104) transitions.
// Phase 1: matrix 397 rows 452 cols
[2025-05-30 03:59:42] [INFO ] Computed 91 invariants in 58 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:59:43] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2025-05-30 03:59:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 03:59:45] [INFO ] Implicit Places using invariants and state equation in 2225 ms returned []
Implicit Place search using SMT with State Equation took 3347 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2025-05-30 03:59:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/452 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:10] [INFO ] Deduced a trap composed of 55 places in 479 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:11] [INFO ] Deduced a trap composed of 56 places in 408 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:11] [INFO ] Deduced a trap composed of 56 places in 402 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:12] [INFO ] Deduced a trap composed of 55 places in 369 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:12] [INFO ] Deduced a trap composed of 56 places in 348 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:12] [INFO ] Deduced a trap composed of 56 places in 342 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:13] [INFO ] Deduced a trap composed of 58 places in 338 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:13] [INFO ] Deduced a trap composed of 58 places in 288 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:14] [INFO ] Deduced a trap composed of 58 places in 394 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:14] [INFO ] Deduced a trap composed of 58 places in 404 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:14] [INFO ] Deduced a trap composed of 58 places in 381 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:15] [INFO ] Deduced a trap composed of 58 places in 299 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:15] [INFO ] Deduced a trap composed of 79 places in 314 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:15] [INFO ] Deduced a trap composed of 60 places in 397 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:16] [INFO ] Deduced a trap composed of 59 places in 400 ms of which 73 ms to minimize.
SMT process timed out in 30491ms, After SMT, problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 30519ms
Starting structural reductions in LTL mode, iteration 1 : 452/560 places, 397/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34175 ms. Remains : 452/560 places, 397/501 transitions.
Support contains 56 out of 452 places after structural reductions.
[2025-05-30 04:00:16] [INFO ] Flatten gal took : 131 ms
[2025-05-30 04:00:16] [INFO ] Flatten gal took : 65 ms
[2025-05-30 04:00:17] [INFO ] Input system was already deterministic with 397 transitions.
Reduction of identical properties reduced properties to check from 37 to 36
RANDOM walk for 40000 steps (302 resets) in 1983 ms. (20 steps per ms) remains 18/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
[2025-05-30 04:00:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 167/206 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 128/334 variables, 35/49 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 109/443 variables, 42/91 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 391/834 variables, 443/534 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/834 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 17 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 9 (OVERLAPS) 13/847 variables, 7/541 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/847 variables, 0/541 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 2/849 variables, 2/543 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/849 variables, 0/543 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 0/849 variables, 0/543 constraints. Problems are: Problem set: 3 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 849/849 variables, and 543 constraints, problems are : Problem set: 3 solved, 15 unsolved in 2776 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 452/452 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 15 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 163/195 variables, 12/12 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 136/331 variables, 37/49 constraints. Problems are: Problem set: 3 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:21] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:21] [INFO ] Deduced a trap composed of 14 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-30 04:00:21] [INFO ] Deduced a trap composed of 22 places in 190 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:22] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:22] [INFO ] Deduced a trap composed of 70 places in 199 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:22] [INFO ] Deduced a trap composed of 70 places in 212 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:22] [INFO ] Deduced a trap composed of 70 places in 187 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:22] [INFO ] Deduced a trap composed of 70 places in 221 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:23] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:23] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:23] [INFO ] Deduced a trap composed of 71 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-30 04:00:23] [INFO ] Deduced a trap composed of 71 places in 159 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:23] [INFO ] Deduced a trap composed of 69 places in 153 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:24] [INFO ] Deduced a trap composed of 73 places in 194 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:24] [INFO ] Deduced a trap composed of 71 places in 215 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:24] [INFO ] Deduced a trap composed of 71 places in 218 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:24] [INFO ] Deduced a trap composed of 72 places in 204 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:25] [INFO ] Deduced a trap composed of 72 places in 202 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:25] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:25] [INFO ] Deduced a trap composed of 76 places in 203 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 20/69 constraints. Problems are: Problem set: 3 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:25] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 26 ms to minimize.
SMT process timed out in 7835ms, After SMT, problems are : Problem set: 3 solved, 15 unsolved
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 32 out of 452 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 452/452 places, 397/397 transitions.
Graph (complete) has 1015 edges and 452 vertex of which 451 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 451 transition count 356
Reduce places removed 40 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 45 rules applied. Total rules applied 86 place count 411 transition count 351
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 91 place count 406 transition count 351
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 91 place count 406 transition count 271
Deduced a syphon composed of 80 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 175 rules applied. Total rules applied 266 place count 311 transition count 271
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 273 place count 304 transition count 264
Iterating global reduction 3 with 7 rules applied. Total rules applied 280 place count 304 transition count 264
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 501 place count 192 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 502 place count 192 transition count 154
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 503 place count 192 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 504 place count 191 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 512 place count 191 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 513 place count 190 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 514 place count 189 transition count 152
Applied a total of 514 rules in 219 ms. Remains 189 /452 variables (removed 263) and now considering 152/397 (removed 245) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 189/452 places, 152/397 transitions.
RANDOM walk for 40000 steps (2658 resets) in 1434 ms. (27 steps per ms) remains 14/15 properties
BEST_FIRST walk for 40004 steps (619 resets) in 270 ms. (147 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (611 resets) in 189 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (604 resets) in 196 ms. (203 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (612 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (631 resets) in 198 ms. (201 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (609 resets) in 168 ms. (236 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (629 resets) in 195 ms. (204 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (626 resets) in 186 ms. (213 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (573 resets) in 183 ms. (217 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (602 resets) in 150 ms. (264 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (628 resets) in 190 ms. (209 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (620 resets) in 219 ms. (181 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (824 resets) in 177 ms. (224 steps per ms) remains 13/13 properties
// Phase 1: matrix 152 rows 189 cols
[2025-05-30 04:00:27] [INFO ] Computed 72 invariants in 14 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 58/86 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 33/119 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 42/161 variables, 22/56 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 6/167 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/168 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 152/320 variables, 168/231 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 21/341 variables, 21/252 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:28] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/341 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 0/341 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 262 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1430 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 58/86 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:28] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:29] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 33/119 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:29] [INFO ] Deduced a trap composed of 28 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-30 04:00:29] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 42/161 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:29] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:29] [INFO ] Deduced a trap composed of 39 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:29] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:30] [INFO ] Deduced a trap composed of 29 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-30 04:00:30] [INFO ] Deduced a trap composed of 29 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-30 04:00:30] [INFO ] Deduced a trap composed of 40 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-30 04:00:30] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:30] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:30] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:30] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:31] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:31] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:31] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:31] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:31] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:31] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:31] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:31] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 9 ms to minimize.
Problem AtomicPropp22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:31] [INFO ] Deduced a trap composed of 39 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-30 04:00:32] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 15 ms to minimize.
Problem AtomicPropp22 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 20/80 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:32] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:32] [INFO ] Deduced a trap composed of 41 places in 143 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:32] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:32] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:32] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:32] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:33] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:33] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:33] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 15 ms to minimize.
Problem AtomicPropp34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:33] [INFO ] Deduced a trap composed of 40 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-30 04:00:33] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:33] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:33] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 12 ms to minimize.
Problem AtomicPropp36 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 13/93 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:34] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:34] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:34] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:34] [INFO ] Deduced a trap composed of 42 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:34] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:34] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:35] [INFO ] Deduced a trap composed of 41 places in 167 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:35] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:35] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:35] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:35] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:35] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:36] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 13/106 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:36] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:36] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:36] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 17 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 3/109 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 0/109 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 6/167 variables, 6/115 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/167 variables, 0/115 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1/168 variables, 1/116 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 0/116 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 152/320 variables, 168/284 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/320 variables, 9/293 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:37] [INFO ] Deduced a trap composed of 42 places in 109 ms of which 12 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/320 variables, 1/294 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:37] [INFO ] Deduced a trap composed of 40 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-30 04:00:37] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:37] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 14 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/320 variables, 3/297 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:38] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:38] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 14 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/320 variables, 2/299 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:38] [INFO ] Deduced a trap composed of 44 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-30 04:00:38] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 14 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/320 variables, 2/301 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/320 variables, 0/301 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 24 (OVERLAPS) 21/341 variables, 21/322 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/341 variables, 9/331 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/341 variables, 1/332 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:39] [INFO ] Deduced a trap composed of 12 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-30 04:00:40] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:00:40] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 13 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/341 variables, 3/335 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/341 variables, 1/336 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/341 variables, 0/336 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 30 (OVERLAPS) 0/341 variables, 0/336 constraints. Problems are: Problem set: 3 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 336 constraints, problems are : Problem set: 3 solved, 10 unsolved in 14378 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 10/13 constraints, Known Traps: 64/64 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 15837ms problems are : Problem set: 3 solved, 10 unsolved
Parikh walk visited 0 properties in 2009 ms.
Support contains 19 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 152/152 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 189 transition count 147
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 183 transition count 147
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 0 with 12 rules applied. Total rules applied 23 place count 177 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 176 transition count 140
Applied a total of 24 rules in 32 ms. Remains 176 /189 variables (removed 13) and now considering 140/152 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 176/189 places, 140/152 transitions.
RANDOM walk for 40000 steps (3952 resets) in 258 ms. (154 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1249 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1204 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1264 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1237 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1293 resets) in 169 ms. (235 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1252 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1357 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1355 resets) in 225 ms. (177 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1256 resets) in 193 ms. (206 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1254 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
Finished probabilistic random walk after 3539 steps, run visited all 10 properties in 68 ms. (steps per millisecond=52 )
Probabilistic random walk after 3539 steps, saw 1249 distinct states, run finished after 75 ms. (steps per millisecond=47 ) properties seen :10
Successfully simplified 6 atomic propositions for a total of 12 simplifications.
FORMULA BusinessProcesses-PT-11-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 437 stabilizing places and 382 stable transitions
Graph (complete) has 1015 edges and 452 vertex of which 451 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.17 ms
FORMULA BusinessProcesses-PT-11-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(G((G(p0)||F((p1&&X(G(p2)))))))))'
Support contains 3 out of 452 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 452/452 places, 397/397 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 441 transition count 386
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 441 transition count 386
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 439 transition count 384
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 439 transition count 384
Applied a total of 26 rules in 63 ms. Remains 439 /452 variables (removed 13) and now considering 384/397 (removed 13) transitions.
// Phase 1: matrix 384 rows 439 cols
[2025-05-30 04:00:46] [INFO ] Computed 91 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:00:47] [INFO ] Implicit Places using invariants in 621 ms returned []
[2025-05-30 04:00:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:00:49] [INFO ] Implicit Places using invariants and state equation in 2743 ms returned []
Implicit Place search using SMT with State Equation took 3368 ms to find 0 implicit places.
Running 383 sub problems to find dead transitions.
[2025-05-30 04:00:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 1/439 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:11] [INFO ] Deduced a trap composed of 50 places in 366 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:12] [INFO ] Deduced a trap composed of 50 places in 370 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:12] [INFO ] Deduced a trap composed of 50 places in 336 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:13] [INFO ] Deduced a trap composed of 50 places in 320 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:13] [INFO ] Deduced a trap composed of 50 places in 316 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:13] [INFO ] Deduced a trap composed of 50 places in 326 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:14] [INFO ] Deduced a trap composed of 50 places in 324 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:14] [INFO ] Deduced a trap composed of 50 places in 363 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:14] [INFO ] Deduced a trap composed of 50 places in 362 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:15] [INFO ] Deduced a trap composed of 50 places in 332 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:15] [INFO ] Deduced a trap composed of 50 places in 331 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:15] [INFO ] Deduced a trap composed of 50 places in 338 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:16] [INFO ] Deduced a trap composed of 50 places in 344 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:16] [INFO ] Deduced a trap composed of 50 places in 333 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:16] [INFO ] Deduced a trap composed of 50 places in 272 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:17] [INFO ] Deduced a trap composed of 50 places in 329 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:17] [INFO ] Deduced a trap composed of 50 places in 337 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:17] [INFO ] Deduced a trap composed of 53 places in 339 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:18] [INFO ] Deduced a trap composed of 71 places in 329 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:18] [INFO ] Deduced a trap composed of 71 places in 242 ms of which 50 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:19] [INFO ] Deduced a trap composed of 69 places in 306 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:19] [INFO ] Deduced a trap composed of 64 places in 314 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:20] [INFO ] Deduced a trap composed of 50 places in 329 ms of which 58 ms to minimize.
SMT process timed out in 30199ms, After SMT, problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 30203ms
Starting structural reductions in LTL mode, iteration 1 : 439/452 places, 384/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33639 ms. Remains : 439/452 places, 384/397 transitions.
Stuttering acceptance computed with spot in 613 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-00
Stuttering criterion allowed to conclude after 136 steps with 0 reset in 7 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-00 finished in 34383 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))||F((X(p2)||p1)))))'
Support contains 4 out of 452 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 452/452 places, 397/397 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 443 transition count 388
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 443 transition count 388
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 441 transition count 386
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 441 transition count 386
Applied a total of 22 rules in 43 ms. Remains 441 /452 variables (removed 11) and now considering 386/397 (removed 11) transitions.
// Phase 1: matrix 386 rows 441 cols
[2025-05-30 04:01:20] [INFO ] Computed 91 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:01:21] [INFO ] Implicit Places using invariants in 582 ms returned []
[2025-05-30 04:01:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:01:24] [INFO ] Implicit Places using invariants and state equation in 2882 ms returned []
Implicit Place search using SMT with State Equation took 3470 ms to find 0 implicit places.
Running 385 sub problems to find dead transitions.
[2025-05-30 04:01:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:47] [INFO ] Deduced a trap composed of 51 places in 347 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:47] [INFO ] Deduced a trap composed of 51 places in 337 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:48] [INFO ] Deduced a trap composed of 51 places in 321 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:48] [INFO ] Deduced a trap composed of 51 places in 326 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:48] [INFO ] Deduced a trap composed of 51 places in 340 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:49] [INFO ] Deduced a trap composed of 51 places in 325 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:49] [INFO ] Deduced a trap composed of 51 places in 319 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:49] [INFO ] Deduced a trap composed of 51 places in 337 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:50] [INFO ] Deduced a trap composed of 51 places in 320 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:50] [INFO ] Deduced a trap composed of 72 places in 371 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:50] [INFO ] Deduced a trap composed of 54 places in 318 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:51] [INFO ] Deduced a trap composed of 54 places in 306 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:51] [INFO ] Deduced a trap composed of 54 places in 326 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:51] [INFO ] Deduced a trap composed of 54 places in 325 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:52] [INFO ] Deduced a trap composed of 54 places in 350 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:52] [INFO ] Deduced a trap composed of 54 places in 324 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:52] [INFO ] Deduced a trap composed of 72 places in 334 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:53] [INFO ] Deduced a trap composed of 72 places in 350 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:53] [INFO ] Deduced a trap composed of 72 places in 351 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:01:54] [INFO ] Deduced a trap composed of 72 places in 329 ms of which 73 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 385 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 Real declared 441/827 variables, and 111 constraints, problems are : Problem set: 0 solved, 385 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/441 constraints, PredecessorRefiner: 385/385 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:00] [INFO ] Deduced a trap composed of 53 places in 262 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:01] [INFO ] Deduced a trap composed of 63 places in 290 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:01] [INFO ] Deduced a trap composed of 63 places in 328 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:01] [INFO ] Deduced a trap composed of 64 places in 289 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:02] [INFO ] Deduced a trap composed of 64 places in 330 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:02] [INFO ] Deduced a trap composed of 64 places in 339 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:02] [INFO ] Deduced a trap composed of 64 places in 357 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:03] [INFO ] Deduced a trap composed of 65 places in 312 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:03] [INFO ] Deduced a trap composed of 65 places in 310 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:03] [INFO ] Deduced a trap composed of 65 places in 310 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:04] [INFO ] Deduced a trap composed of 71 places in 329 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:04] [INFO ] Deduced a trap composed of 71 places in 348 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:04] [INFO ] Deduced a trap composed of 71 places in 319 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:05] [INFO ] Deduced a trap composed of 71 places in 323 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:05] [INFO ] Deduced a trap composed of 71 places in 323 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:05] [INFO ] Deduced a trap composed of 71 places in 308 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:06] [INFO ] Deduced a trap composed of 71 places in 320 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:06] [INFO ] Deduced a trap composed of 71 places in 298 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:07] [INFO ] Deduced a trap composed of 52 places in 336 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:07] [INFO ] Deduced a trap composed of 64 places in 361 ms of which 66 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:08] [INFO ] Deduced a trap composed of 72 places in 342 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:08] [INFO ] Deduced a trap composed of 72 places in 336 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:09] [INFO ] Deduced a trap composed of 72 places in 331 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:09] [INFO ] Deduced a trap composed of 72 places in 322 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:09] [INFO ] Deduced a trap composed of 75 places in 337 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:10] [INFO ] Deduced a trap composed of 75 places in 334 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:10] [INFO ] Deduced a trap composed of 74 places in 339 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:10] [INFO ] Deduced a trap composed of 74 places in 351 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:11] [INFO ] Deduced a trap composed of 74 places in 346 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:11] [INFO ] Deduced a trap composed of 74 places in 325 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:11] [INFO ] Deduced a trap composed of 74 places in 309 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:12] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:12] [INFO ] Deduced a trap composed of 72 places in 323 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:12] [INFO ] Deduced a trap composed of 70 places in 331 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:13] [INFO ] Deduced a trap composed of 53 places in 304 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:13] [INFO ] Deduced a trap composed of 53 places in 291 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:13] [INFO ] Deduced a trap composed of 72 places in 304 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:14] [INFO ] Deduced a trap composed of 67 places in 310 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:14] [INFO ] Deduced a trap composed of 67 places in 327 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:14] [INFO ] Deduced a trap composed of 67 places in 327 ms of which 66 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:15] [INFO ] Deduced a trap composed of 71 places in 331 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:16] [INFO ] Deduced a trap composed of 71 places in 331 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:16] [INFO ] Deduced a trap composed of 71 places in 347 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:16] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:16] [INFO ] Deduced a trap composed of 73 places in 331 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:17] [INFO ] Deduced a trap composed of 73 places in 339 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:17] [INFO ] Deduced a trap composed of 73 places in 337 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:17] [INFO ] Deduced a trap composed of 73 places in 323 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:18] [INFO ] Deduced a trap composed of 73 places in 333 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:18] [INFO ] Deduced a trap composed of 73 places in 307 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:18] [INFO ] Deduced a trap composed of 73 places in 310 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:19] [INFO ] Deduced a trap composed of 73 places in 326 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:19] [INFO ] Deduced a trap composed of 73 places in 318 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:19] [INFO ] Deduced a trap composed of 73 places in 325 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:20] [INFO ] Deduced a trap composed of 71 places in 609 ms of which 340 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:21] [INFO ] Deduced a trap composed of 71 places in 407 ms of which 145 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:21] [INFO ] Deduced a trap composed of 72 places in 787 ms of which 538 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:22] [INFO ] Deduced a trap composed of 72 places in 328 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:22] [INFO ] Deduced a trap composed of 72 places in 348 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:23] [INFO ] Deduced a trap composed of 72 places in 674 ms of which 371 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:24] [INFO ] Deduced a trap composed of 74 places in 196 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:24] [INFO ] Deduced a trap composed of 74 places in 217 ms of which 60 ms to minimize.
SMT process timed out in 60255ms, After SMT, problems are : Problem set: 0 solved, 385 unsolved
Search for dead transitions found 0 dead transitions in 60258ms
Starting structural reductions in LTL mode, iteration 1 : 441/452 places, 386/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63774 ms. Remains : 441/452 places, 386/397 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-04
Product exploration explored 100000 steps with 3353 reset in 403 ms.
Stack based approach found an accepted trace after 411 steps with 12 reset with depth 6 and stack size 6 in 3 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-04 finished in 64354 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 452 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 452/452 places, 397/397 transitions.
Graph (trivial) has 210 edges and 452 vertex of which 6 / 452 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 1009 edges and 447 vertex of which 446 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 445 transition count 341
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 397 transition count 341
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 98 place count 397 transition count 246
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 306 place count 284 transition count 246
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 316 place count 274 transition count 236
Iterating global reduction 2 with 10 rules applied. Total rules applied 326 place count 274 transition count 236
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 227 rules applied. Total rules applied 553 place count 159 transition count 124
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 557 place count 157 transition count 127
Applied a total of 557 rules in 100 ms. Remains 157 /452 variables (removed 295) and now considering 127/397 (removed 270) transitions.
// Phase 1: matrix 127 rows 157 cols
[2025-05-30 04:02:25] [INFO ] Computed 70 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:02:25] [INFO ] Implicit Places using invariants in 313 ms returned [1, 4, 5, 28, 29, 30, 31, 38, 39, 40, 45, 46, 47, 48, 49, 52, 53]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 316 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/452 places, 127/397 transitions.
Applied a total of 0 rules in 16 ms. Remains 140 /140 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 435 ms. Remains : 140/452 places, 127/397 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-05 finished in 553 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 U (G(p0)||(p0&&G(p1))))&&(p0 U (p2||G(p0))))) U X(p3)))'
Support contains 4 out of 452 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 452/452 places, 397/397 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 443 transition count 388
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 443 transition count 388
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 441 transition count 386
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 441 transition count 386
Applied a total of 22 rules in 41 ms. Remains 441 /452 variables (removed 11) and now considering 386/397 (removed 11) transitions.
// Phase 1: matrix 386 rows 441 cols
[2025-05-30 04:02:25] [INFO ] Computed 91 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:02:26] [INFO ] Implicit Places using invariants in 633 ms returned []
[2025-05-30 04:02:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:02:28] [INFO ] Implicit Places using invariants and state equation in 2401 ms returned []
Implicit Place search using SMT with State Equation took 3036 ms to find 0 implicit places.
Running 385 sub problems to find dead transitions.
[2025-05-30 04:02: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/440 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:51] [INFO ] Deduced a trap composed of 50 places in 348 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:52] [INFO ] Deduced a trap composed of 72 places in 343 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:52] [INFO ] Deduced a trap composed of 72 places in 297 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:52] [INFO ] Deduced a trap composed of 72 places in 293 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:53] [INFO ] Deduced a trap composed of 72 places in 325 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:53] [INFO ] Deduced a trap composed of 72 places in 348 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:53] [INFO ] Deduced a trap composed of 72 places in 344 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:54] [INFO ] Deduced a trap composed of 72 places in 363 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:54] [INFO ] Deduced a trap composed of 72 places in 365 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:54] [INFO ] Deduced a trap composed of 72 places in 318 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:55] [INFO ] Deduced a trap composed of 72 places in 351 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:55] [INFO ] Deduced a trap composed of 72 places in 323 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:55] [INFO ] Deduced a trap composed of 72 places in 332 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:56] [INFO ] Deduced a trap composed of 72 places in 363 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:56] [INFO ] Deduced a trap composed of 72 places in 324 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:57] [INFO ] Deduced a trap composed of 72 places in 329 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:57] [INFO ] Deduced a trap composed of 72 places in 342 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:57] [INFO ] Deduced a trap composed of 72 places in 343 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:58] [INFO ] Deduced a trap composed of 72 places in 336 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:02:58] [INFO ] Deduced a trap composed of 72 places in 328 ms of which 68 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 441/827 variables, and 111 constraints, problems are : Problem set: 0 solved, 385 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/441 constraints, PredecessorRefiner: 385/385 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 385 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:06] [INFO ] Deduced a trap composed of 50 places in 241 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:06] [INFO ] Deduced a trap composed of 67 places in 346 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:06] [INFO ] Deduced a trap composed of 50 places in 316 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:07] [INFO ] Deduced a trap composed of 67 places in 319 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:07] [INFO ] Deduced a trap composed of 50 places in 263 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:07] [INFO ] Deduced a trap composed of 67 places in 303 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:08] [INFO ] Deduced a trap composed of 72 places in 310 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:08] [INFO ] Deduced a trap composed of 72 places in 308 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:08] [INFO ] Deduced a trap composed of 72 places in 319 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:09] [INFO ] Deduced a trap composed of 72 places in 343 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:09] [INFO ] Deduced a trap composed of 72 places in 349 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:10] [INFO ] Deduced a trap composed of 72 places in 331 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:10] [INFO ] Deduced a trap composed of 72 places in 356 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:10] [INFO ] Deduced a trap composed of 72 places in 346 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:11] [INFO ] Deduced a trap composed of 72 places in 346 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:11] [INFO ] Deduced a trap composed of 72 places in 343 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:11] [INFO ] Deduced a trap composed of 72 places in 321 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:12] [INFO ] Deduced a trap composed of 53 places in 341 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:12] [INFO ] Deduced a trap composed of 75 places in 346 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:12] [INFO ] Deduced a trap composed of 75 places in 389 ms of which 128 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:13] [INFO ] Deduced a trap composed of 74 places in 325 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:14] [INFO ] Deduced a trap composed of 75 places in 314 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:14] [INFO ] Deduced a trap composed of 74 places in 327 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:14] [INFO ] Deduced a trap composed of 75 places in 269 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:15] [INFO ] Deduced a trap composed of 74 places in 282 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:15] [INFO ] Deduced a trap composed of 74 places in 282 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:15] [INFO ] Deduced a trap composed of 74 places in 295 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:16] [INFO ] Deduced a trap composed of 74 places in 328 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:16] [INFO ] Deduced a trap composed of 74 places in 331 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:16] [INFO ] Deduced a trap composed of 52 places in 288 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:17] [INFO ] Deduced a trap composed of 74 places in 343 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:17] [INFO ] Deduced a trap composed of 74 places in 320 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:17] [INFO ] Deduced a trap composed of 74 places in 322 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:18] [INFO ] Deduced a trap composed of 74 places in 363 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:18] [INFO ] Deduced a trap composed of 74 places in 389 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:18] [INFO ] Deduced a trap composed of 74 places in 347 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:19] [INFO ] Deduced a trap composed of 74 places in 334 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:19] [INFO ] Deduced a trap composed of 69 places in 359 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:20] [INFO ] Deduced a trap composed of 69 places in 350 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:20] [INFO ] Deduced a trap composed of 69 places in 331 ms of which 74 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 385 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:21] [INFO ] Deduced a trap composed of 53 places in 286 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:21] [INFO ] Deduced a trap composed of 75 places in 350 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:22] [INFO ] Deduced a trap composed of 53 places in 302 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:22] [INFO ] Deduced a trap composed of 75 places in 315 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:22] [INFO ] Deduced a trap composed of 75 places in 340 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:23] [INFO ] Deduced a trap composed of 75 places in 381 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:23] [INFO ] Deduced a trap composed of 75 places in 328 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:23] [INFO ] Deduced a trap composed of 75 places in 352 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:24] [INFO ] Deduced a trap composed of 76 places in 319 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:24] [INFO ] Deduced a trap composed of 75 places in 356 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:25] [INFO ] Deduced a trap composed of 78 places in 388 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:25] [INFO ] Deduced a trap composed of 83 places in 371 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:25] [INFO ] Deduced a trap composed of 85 places in 383 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:26] [INFO ] Deduced a trap composed of 80 places in 365 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:26] [INFO ] Deduced a trap composed of 80 places in 355 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:26] [INFO ] Deduced a trap composed of 80 places in 333 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:27] [INFO ] Deduced a trap composed of 20 places in 325 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:27] [INFO ] Deduced a trap composed of 43 places in 342 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:28] [INFO ] Deduced a trap composed of 34 places in 337 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:28] [INFO ] Deduced a trap composed of 35 places in 335 ms of which 42 ms to minimize.
Problem TDEAD321 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/441 variables, 20/171 constraints. Problems are: Problem set: 12 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 441/827 variables, and 171 constraints, problems are : Problem set: 12 solved, 373 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/441 constraints, PredecessorRefiner: 0/385 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60103ms problems are : Problem set: 12 solved, 373 unsolved
Search for dead transitions found 12 dead transitions in 60105ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 441/452 places, 374/397 transitions.
Applied a total of 0 rules in 14 ms. Remains 441 /441 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63199 ms. Remains : 441/452 places, 374/397 transitions.
Stuttering acceptance computed with spot in 806 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-06
Product exploration explored 100000 steps with 753 reset in 413 ms.
Product exploration explored 100000 steps with 746 reset in 530 ms.
Computed a total of 426 stabilizing places and 359 stable transitions
Graph (complete) has 971 edges and 441 vertex of which 440 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 426 stabilizing places and 359 stable transitions
Detected a total of 426/441 stabilizing places and 359/374 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND p1 (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 25 factoid took 6772 ms. Reduced automaton from 12 states, 46 edges and 4 AP (stutter sensitive) to 12 states, 43 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 781 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 21 to 17
RANDOM walk for 40000 steps (301 resets) in 955 ms. (41 steps per ms) remains 6/17 properties
BEST_FIRST walk for 40003 steps (50 resets) in 270 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (50 resets) in 150 ms. (264 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (56 resets) in 148 ms. (268 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (55 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (56 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
// Phase 1: matrix 374 rows 441 cols
[2025-05-30 04:03:38] [INFO ] Computed 91 invariants in 11 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 106/110 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 204/314 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:39] [INFO ] Deduced a trap composed of 11 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-30 04:03:39] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:39] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:39] [INFO ] Deduced a trap composed of 22 places in 198 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:40] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:40] [INFO ] Deduced a trap composed of 25 places in 196 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:40] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:40] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:41] [INFO ] Deduced a trap composed of 64 places in 205 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:41] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:41] [INFO ] Deduced a trap composed of 67 places in 210 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 117/431 variables, 38/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/433 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 370/803 variables, 433/535 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:42] [INFO ] Deduced a trap composed of 17 places in 328 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:42] [INFO ] Deduced a trap composed of 21 places in 328 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:43] [INFO ] Deduced a trap composed of 18 places in 317 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:43] [INFO ] Deduced a trap composed of 19 places in 336 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:43] [INFO ] Deduced a trap composed of 17 places in 325 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:03:44] [INFO ] Deduced a trap composed of 23 places in 317 ms of which 33 ms to minimize.
SMT process timed out in 5130ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 374/374 transitions.
Graph (trivial) has 193 edges and 441 vertex of which 6 / 441 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 964 edges and 436 vertex of which 435 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 435 transition count 324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 393 transition count 324
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 86 place count 393 transition count 230
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 292 place count 281 transition count 230
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 233 rules applied. Total rules applied 525 place count 163 transition count 115
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 528 place count 163 transition count 112
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 531 place count 160 transition count 112
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 532 place count 160 transition count 112
Applied a total of 532 rules in 71 ms. Remains 160 /441 variables (removed 281) and now considering 112/374 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 160/441 places, 112/374 transitions.
RANDOM walk for 40000 steps (1379 resets) in 273 ms. (145 steps per ms) remains 1/4 properties
BEST_FIRST walk for 14835 steps (143 resets) in 44 ms. (329 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2 (NOT p3)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (AND (NOT p0) (NOT p2) (NOT p3))), (X (AND p1 (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND p1 p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND p1 (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (NOT (OR p0 p3 p1))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 (NOT p3) p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p3))), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT (OR p0 p2 p3))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR (NOT p0) p2 p1))), (F p3), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 25 factoid took 15293 ms. Reduced automaton from 12 states, 43 edges and 4 AP (stutter sensitive) to 12 states, 43 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 745 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 747 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2025-05-30 04:04:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 04:04:01] [INFO ] [Real]Absence check using 51 positive place invariants in 166 ms returned sat
[2025-05-30 04:04:01] [INFO ] [Real]Absence check using 51 positive and 40 generalized place invariants in 154 ms returned sat
[2025-05-30 04:04:16] [INFO ] [Real]Absence check using state equation in 14258 ms returned unknown
Could not prove EG (NOT p3)
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 374/374 transitions.
Applied a total of 0 rules in 8 ms. Remains 441 /441 variables (removed 0) and now considering 374/374 (removed 0) transitions.
[2025-05-30 04:04:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:04:16] [INFO ] Implicit Places using invariants in 363 ms returned []
[2025-05-30 04:04:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:04:18] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2025-05-30 04:04:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:39] [INFO ] Deduced a trap composed of 50 places in 362 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:39] [INFO ] Deduced a trap composed of 50 places in 345 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:40] [INFO ] Deduced a trap composed of 50 places in 328 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:40] [INFO ] Deduced a trap composed of 50 places in 357 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:41] [INFO ] Deduced a trap composed of 50 places in 327 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:41] [INFO ] Deduced a trap composed of 50 places in 321 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:41] [INFO ] Deduced a trap composed of 50 places in 330 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:42] [INFO ] Deduced a trap composed of 50 places in 317 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:42] [INFO ] Deduced a trap composed of 50 places in 316 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:42] [INFO ] Deduced a trap composed of 50 places in 332 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:43] [INFO ] Deduced a trap composed of 50 places in 322 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:43] [INFO ] Deduced a trap composed of 50 places in 308 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:43] [INFO ] Deduced a trap composed of 50 places in 315 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:44] [INFO ] Deduced a trap composed of 72 places in 344 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:44] [INFO ] Deduced a trap composed of 72 places in 320 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:44] [INFO ] Deduced a trap composed of 72 places in 348 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:45] [INFO ] Deduced a trap composed of 72 places in 350 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:45] [INFO ] Deduced a trap composed of 72 places in 361 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:45] [INFO ] Deduced a trap composed of 73 places in 360 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:46] [INFO ] Deduced a trap composed of 72 places in 384 ms of which 84 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:47] [INFO ] Deduced a trap composed of 53 places in 325 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:47] [INFO ] Deduced a trap composed of 53 places in 345 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:47] [INFO ] Deduced a trap composed of 53 places in 331 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:48] [INFO ] Deduced a trap composed of 53 places in 347 ms of which 54 ms to minimize.
SMT process timed out in 30230ms, After SMT, problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 30232ms
Finished structural reductions in LTL mode , in 1 iterations and 32184 ms. Remains : 441/441 places, 374/374 transitions.
Computed a total of 426 stabilizing places and 359 stable transitions
Graph (complete) has 971 edges and 441 vertex of which 440 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Computed a total of 426 stabilizing places and 359 stable transitions
Detected a total of 426/441 stabilizing places and 359/374 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p0) (NOT p3) p1)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X p1), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 24 factoid took 6718 ms. Reduced automaton from 12 states, 43 edges and 4 AP (stutter sensitive) to 12 states, 43 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 752 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 21 to 17
RANDOM walk for 40000 steps (300 resets) in 625 ms. (63 steps per ms) remains 6/17 properties
BEST_FIRST walk for 40003 steps (50 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (52 resets) in 116 ms. (341 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (54 resets) in 154 ms. (258 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (51 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (54 resets) in 107 ms. (370 steps per ms) remains 4/4 properties
[2025-05-30 04:04:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 106/110 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 204/314 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:56] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:56] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:57] [INFO ] Deduced a trap composed of 16 places in 200 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:57] [INFO ] Deduced a trap composed of 22 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-30 04:04:57] [INFO ] Deduced a trap composed of 24 places in 197 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:57] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:57] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:58] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:58] [INFO ] Deduced a trap composed of 67 places in 217 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:58] [INFO ] Deduced a trap composed of 66 places in 212 ms of which 28 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 10/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 117/431 variables, 38/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/431 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2/433 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/433 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 370/803 variables, 433/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:59] [INFO ] Deduced a trap composed of 20 places in 322 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:04:59] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:00] [INFO ] Deduced a trap composed of 65 places in 363 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:00] [INFO ] Deduced a trap composed of 65 places in 347 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:00] [INFO ] Deduced a trap composed of 17 places in 329 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:01] [INFO ] Deduced a trap composed of 65 places in 376 ms of which 80 ms to minimize.
SMT process timed out in 5053ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 374/374 transitions.
Graph (trivial) has 193 edges and 441 vertex of which 6 / 441 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 964 edges and 436 vertex of which 435 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 435 transition count 324
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 86 place count 393 transition count 324
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 86 place count 393 transition count 230
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 292 place count 281 transition count 230
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 233 rules applied. Total rules applied 525 place count 163 transition count 115
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 528 place count 163 transition count 112
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 531 place count 160 transition count 112
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 532 place count 160 transition count 112
Applied a total of 532 rules in 69 ms. Remains 160 /441 variables (removed 281) and now considering 112/374 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 160/441 places, 112/374 transitions.
RANDOM walk for 40000 steps (1398 resets) in 264 ms. (150 steps per ms) remains 1/4 properties
BEST_FIRST walk for 9201 steps (87 resets) in 30 ms. (296 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (AND (NOT p0) (NOT p3) p1)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X p1), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p3 p1))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 (NOT p3) p1))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p3))), (F (NOT (OR p0 p3 (NOT p1)))), (F (NOT (OR p0 p2 p3))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR (NOT p0) p2 p1))), (F p3), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 24 factoid took 14259 ms. Reduced automaton from 12 states, 43 edges and 4 AP (stutter sensitive) to 12 states, 43 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 720 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 735 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
[2025-05-30 04:05:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 04:05:17] [INFO ] [Real]Absence check using 51 positive place invariants in 151 ms returned sat
[2025-05-30 04:05:17] [INFO ] [Real]Absence check using 51 positive and 40 generalized place invariants in 152 ms returned sat
[2025-05-30 04:05:32] [INFO ] [Real]Absence check using state equation in 14293 ms returned unknown
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 611 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 755 reset in 320 ms.
Product exploration explored 100000 steps with 750 reset in 377 ms.
Applying partial POR strategy [false, true, false, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 748 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 374/374 transitions.
Graph (trivial) has 193 edges and 441 vertex of which 6 / 441 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 965 edges and 436 vertex of which 435 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
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 435 transition count 367
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 66 Pre rules applied. Total rules applied 44 place count 435 transition count 415
Deduced a syphon composed of 108 places in 1 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 110 place count 435 transition count 415
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 126 place count 419 transition count 384
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 142 place count 419 transition count 384
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 234 places in 1 ms
Iterating global reduction 1 with 142 rules applied. Total rules applied 284 place count 419 transition count 384
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 316 place count 387 transition count 352
Deduced a syphon composed of 202 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 348 place count 387 transition count 352
Deduced a syphon composed of 202 places in 1 ms
Applied a total of 348 rules in 163 ms. Remains 387 /441 variables (removed 54) and now considering 352/374 (removed 22) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 04:05:34] [INFO ] Redundant transitions in 45 ms returned []
Running 351 sub problems to find dead transitions.
// Phase 1: matrix 352 rows 387 cols
[2025-05-30 04:05:34] [INFO ] Computed 91 invariants in 7 ms
[2025-05-30 04:05:34] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/386 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/386 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 2 (OVERLAPS) 1/387 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 351 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/387 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 351 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:52] [INFO ] Deduced a trap composed of 3 places in 338 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:53] [INFO ] Deduced a trap composed of 14 places in 339 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:53] [INFO ] Deduced a trap composed of 14 places in 326 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:53] [INFO ] Deduced a trap composed of 24 places in 327 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:54] [INFO ] Deduced a trap composed of 24 places in 348 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:54] [INFO ] Deduced a trap composed of 24 places in 345 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:54] [INFO ] Deduced a trap composed of 24 places in 354 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:55] [INFO ] Deduced a trap composed of 25 places in 338 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:55] [INFO ] Deduced a trap composed of 34 places in 361 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:55] [INFO ] Deduced a trap composed of 34 places in 340 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:56] [INFO ] Deduced a trap composed of 36 places in 306 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:56] [INFO ] Deduced a trap composed of 36 places in 335 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:56] [INFO ] Deduced a trap composed of 36 places in 327 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:57] [INFO ] Deduced a trap composed of 36 places in 330 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:57] [INFO ] Deduced a trap composed of 36 places in 327 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:57] [INFO ] Deduced a trap composed of 36 places in 332 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:58] [INFO ] Deduced a trap composed of 35 places in 300 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:58] [INFO ] Deduced a trap composed of 37 places in 307 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:58] [INFO ] Deduced a trap composed of 37 places in 298 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:59] [INFO ] Deduced a trap composed of 25 places in 325 ms of which 27 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD171 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
Problem TDEAD221 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 20/111 constraints. Problems are: Problem set: 49 solved, 302 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:05:59] [INFO ] Deduced a trap composed of 3 places in 313 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:00] [INFO ] Deduced a trap composed of 25 places in 326 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:00] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:00] [INFO ] Deduced a trap composed of 35 places in 286 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:01] [INFO ] Deduced a trap composed of 37 places in 296 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:01] [INFO ] Deduced a trap composed of 37 places in 318 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:01] [INFO ] Deduced a trap composed of 37 places in 331 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:02] [INFO ] Deduced a trap composed of 37 places in 316 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:02] [INFO ] Deduced a trap composed of 37 places in 323 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:02] [INFO ] Deduced a trap composed of 37 places in 303 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:03] [INFO ] Deduced a trap composed of 37 places in 310 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:03] [INFO ] Deduced a trap composed of 37 places in 340 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:03] [INFO ] Deduced a trap composed of 36 places in 297 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:04] [INFO ] Deduced a trap composed of 38 places in 282 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:04] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:04] [INFO ] Deduced a trap composed of 38 places in 288 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:05] [INFO ] Deduced a trap composed of 38 places in 236 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:05] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 25 ms to minimize.
SMT process timed out in 30351ms, After SMT, problems are : Problem set: 49 solved, 302 unsolved
Search for dead transitions found 49 dead transitions in 30355ms
Found 49 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 49 transitions
Dead transitions reduction (with SMT) removed 49 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 387/441 places, 303/374 transitions.
Graph (complete) has 1385 edges and 387 vertex of which 349 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.3 ms
Discarding 38 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 165 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 348 transition count 309
Deduced a syphon composed of 165 places in 0 ms
Applied a total of 2 rules in 43 ms. Remains 348 /387 variables (removed 39) and now considering 309/303 (removed -6) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 348/441 places, 309/374 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30620 ms. Remains : 348/441 places, 309/374 transitions.
Built C files in :
/tmp/ltsmin1106412130383327626
[2025-05-30 04:06:05] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1106412130383327626
Running compilation step : cd /tmp/ltsmin1106412130383327626;'/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 1293 ms.
Running link step : cd /tmp/ltsmin1106412130383327626;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin1106412130383327626;'/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/stateBased7205644362786065469.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 374/374 transitions.
Applied a total of 0 rules in 12 ms. Remains 441 /441 variables (removed 0) and now considering 374/374 (removed 0) transitions.
// Phase 1: matrix 374 rows 441 cols
[2025-05-30 04:06:20] [INFO ] Computed 91 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:06:20] [INFO ] Implicit Places using invariants in 440 ms returned []
[2025-05-30 04:06:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:06:23] [INFO ] Implicit Places using invariants and state equation in 2272 ms returned []
Implicit Place search using SMT with State Equation took 2714 ms to find 0 implicit places.
Running 373 sub problems to find dead transitions.
[2025-05-30 04:06: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/440 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 1/441 variables, 51/89 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:45] [INFO ] Deduced a trap composed of 50 places in 356 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:45] [INFO ] Deduced a trap composed of 50 places in 340 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:45] [INFO ] Deduced a trap composed of 50 places in 333 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:46] [INFO ] Deduced a trap composed of 50 places in 327 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:46] [INFO ] Deduced a trap composed of 50 places in 274 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:46] [INFO ] Deduced a trap composed of 50 places in 303 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:47] [INFO ] Deduced a trap composed of 50 places in 305 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:47] [INFO ] Deduced a trap composed of 50 places in 316 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:47] [INFO ] Deduced a trap composed of 50 places in 313 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:48] [INFO ] Deduced a trap composed of 50 places in 314 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:48] [INFO ] Deduced a trap composed of 50 places in 304 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:48] [INFO ] Deduced a trap composed of 50 places in 292 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:49] [INFO ] Deduced a trap composed of 50 places in 328 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:49] [INFO ] Deduced a trap composed of 72 places in 335 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:49] [INFO ] Deduced a trap composed of 72 places in 349 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:50] [INFO ] Deduced a trap composed of 72 places in 353 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:50] [INFO ] Deduced a trap composed of 72 places in 348 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:50] [INFO ] Deduced a trap composed of 72 places in 351 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:51] [INFO ] Deduced a trap composed of 73 places in 347 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:51] [INFO ] Deduced a trap composed of 72 places in 352 ms of which 82 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/441 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:52] [INFO ] Deduced a trap composed of 53 places in 323 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:52] [INFO ] Deduced a trap composed of 53 places in 330 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:53] [INFO ] Deduced a trap composed of 53 places in 332 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:06:53] [INFO ] Deduced a trap composed of 53 places in 268 ms of which 52 ms to minimize.
SMT process timed out in 30265ms, After SMT, problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 30268ms
Finished structural reductions in LTL mode , in 1 iterations and 32996 ms. Remains : 441/441 places, 374/374 transitions.
Built C files in :
/tmp/ltsmin2154723495856666697
[2025-05-30 04:06:53] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2154723495856666697
Running compilation step : cd /tmp/ltsmin2154723495856666697;'/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 1203 ms.
Running link step : cd /tmp/ltsmin2154723495856666697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2154723495856666697;'/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/stateBased7991071087359772882.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 04:07:08] [INFO ] Flatten gal took : 29 ms
[2025-05-30 04:07:08] [INFO ] Flatten gal took : 28 ms
[2025-05-30 04:07:08] [INFO ] Time to serialize gal into /tmp/LTL9296615347357868477.gal : 8 ms
[2025-05-30 04:07:08] [INFO ] Time to serialize properties into /tmp/LTL1096170046024309508.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9296615347357868477.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13280086853521906606.hoa' '-atoms' '/tmp/LTL1096170046024309508.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1096170046024309508.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13280086853521906606.hoa
Detected timeout of ITS tools.
[2025-05-30 04:07:23] [INFO ] Flatten gal took : 26 ms
[2025-05-30 04:07:23] [INFO ] Flatten gal took : 23 ms
[2025-05-30 04:07:23] [INFO ] Time to serialize gal into /tmp/LTL4153910850046945780.gal : 6 ms
[2025-05-30 04:07:23] [INFO ] Time to serialize properties into /tmp/LTL14720686166657803228.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4153910850046945780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14720686166657803228.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F((("(p404!=1)")U((G("(p404!=1)"))||(("(p404!=1)")&&(G("(p35!=1)")))))&&(("(p404!=1)")U(("((p404!=1)&&(p449!=1))")||(G("(p404!=1)"...180
Formula 0 simplified : G((F!"(p35!=1)" U !"(p404!=1)") | (!"(p404!=1)" M !"((p404!=1)&&(p449!=1))")) R X!"(p373==1)"
Detected timeout of ITS tools.
[2025-05-30 04:07:39] [INFO ] Flatten gal took : 23 ms
[2025-05-30 04:07:39] [INFO ] Applying decomposition
[2025-05-30 04:07:39] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8899749304627278340.txt' '-o' '/tmp/graph8899749304627278340.bin' '-w' '/tmp/graph8899749304627278340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8899749304627278340.bin' '-l' '-1' '-v' '-w' '/tmp/graph8899749304627278340.weights' '-q' '0' '-e' '0.001'
[2025-05-30 04:07:39] [INFO ] Decomposing Gal with order
[2025-05-30 04:07:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 04:07:39] [INFO ] Removed a total of 195 redundant transitions.
[2025-05-30 04:07:39] [INFO ] Flatten gal took : 140 ms
[2025-05-30 04:07:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 19 ms.
[2025-05-30 04:07:39] [INFO ] Time to serialize gal into /tmp/LTL6974597369247055710.gal : 13 ms
[2025-05-30 04:07:39] [INFO ] Time to serialize properties into /tmp/LTL17219102044534372590.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6974597369247055710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17219102044534372590.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F((("(i14.u118.p404!=1)")U((G("(i14.u118.p404!=1)"))||(("(i14.u118.p404!=1)")&&(G("(i4.u14.p35!=1)")))))&&(("(i14.u118.p404!=1)")U...261
Formula 0 simplified : G((F!"(i4.u14.p35!=1)" U !"(i14.u118.p404!=1)") | (!"(i14.u118.p404!=1)" M !"((i14.u118.p404!=1)&&(i14.u125.p449!=1))")) R X!"(i7.i1...170
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t162, t171, t183, t187, t199, t207, t219, t227, t231, t235, t262, t389, t390, t39...1197
Computing Next relation with stutter on 1212 deadlock states
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-11-LTLFireability-06 finished in 328825 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 3 out of 452 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 452/452 places, 397/397 transitions.
Graph (trivial) has 208 edges and 452 vertex of which 6 / 452 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 1009 edges and 447 vertex of which 446 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 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 445 transition count 342
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 398 transition count 342
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 96 place count 398 transition count 248
Deduced a syphon composed of 94 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 301 place count 287 transition count 248
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 312 place count 276 transition count 237
Iterating global reduction 2 with 11 rules applied. Total rules applied 323 place count 276 transition count 237
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 225 rules applied. Total rules applied 548 place count 162 transition count 126
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 552 place count 160 transition count 129
Applied a total of 552 rules in 37 ms. Remains 160 /452 variables (removed 292) and now considering 129/397 (removed 268) transitions.
// Phase 1: matrix 129 rows 160 cols
[2025-05-30 04:07:54] [INFO ] Computed 71 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:07:54] [INFO ] Implicit Places using invariants in 230 ms returned [1, 4, 5, 28, 29, 32, 33, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 233 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/452 places, 129/397 transitions.
Applied a total of 0 rules in 6 ms. Remains 142 /142 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 277 ms. Remains : 142/452 places, 129/397 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-10 finished in 328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||(p1&&F(p2)))))'
Support contains 5 out of 452 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 452/452 places, 397/397 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 441 transition count 386
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 441 transition count 386
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 438 transition count 383
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 438 transition count 383
Applied a total of 28 rules in 26 ms. Remains 438 /452 variables (removed 14) and now considering 383/397 (removed 14) transitions.
// Phase 1: matrix 383 rows 438 cols
[2025-05-30 04:07:54] [INFO ] Computed 91 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:07:55] [INFO ] Implicit Places using invariants in 457 ms returned []
[2025-05-30 04:07:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:07:57] [INFO ] Implicit Places using invariants and state equation in 2559 ms returned []
Implicit Place search using SMT with State Equation took 3018 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2025-05-30 04:07:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/438 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/438 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:17] [INFO ] Deduced a trap composed of 49 places in 340 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:18] [INFO ] Deduced a trap composed of 52 places in 315 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:18] [INFO ] Deduced a trap composed of 52 places in 330 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:18] [INFO ] Deduced a trap composed of 52 places in 329 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:19] [INFO ] Deduced a trap composed of 52 places in 334 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:19] [INFO ] Deduced a trap composed of 52 places in 323 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:20] [INFO ] Deduced a trap composed of 52 places in 322 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:20] [INFO ] Deduced a trap composed of 52 places in 323 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:20] [INFO ] Deduced a trap composed of 52 places in 298 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:20] [INFO ] Deduced a trap composed of 52 places in 279 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:21] [INFO ] Deduced a trap composed of 70 places in 342 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:21] [INFO ] Deduced a trap composed of 70 places in 329 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:22] [INFO ] Deduced a trap composed of 70 places in 338 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:22] [INFO ] Deduced a trap composed of 70 places in 323 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:22] [INFO ] Deduced a trap composed of 73 places in 332 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:22] [INFO ] Deduced a trap composed of 73 places in 191 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:23] [INFO ] Deduced a trap composed of 73 places in 277 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:23] [INFO ] Deduced a trap composed of 73 places in 305 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:23] [INFO ] Deduced a trap composed of 73 places in 331 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:24] [INFO ] Deduced a trap composed of 73 places in 232 ms of which 40 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:24] [INFO ] Deduced a trap composed of 73 places in 231 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:24] [INFO ] Deduced a trap composed of 73 places in 226 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:25] [INFO ] Deduced a trap composed of 73 places in 333 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:25] [INFO ] Deduced a trap composed of 73 places in 332 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:26] [INFO ] Deduced a trap composed of 73 places in 324 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:26] [INFO ] Deduced a trap composed of 73 places in 324 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:26] [INFO ] Deduced a trap composed of 73 places in 327 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:27] [INFO ] Deduced a trap composed of 73 places in 296 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:27] [INFO ] Deduced a trap composed of 72 places in 301 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:27] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:27] [INFO ] Deduced a trap composed of 51 places in 331 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:28] [INFO ] Deduced a trap composed of 70 places in 370 ms of which 92 ms to minimize.
SMT process timed out in 30415ms, After SMT, problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 30417ms
Starting structural reductions in LTL mode, iteration 1 : 438/452 places, 383/397 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33470 ms. Remains : 438/452 places, 383/397 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 245 ms.
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Computed a total of 423 stabilizing places and 368 stable transitions
Graph (complete) has 992 edges and 438 vertex of which 437 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 423 stabilizing places and 368 stable transitions
Detected a total of 423/438 stabilizing places and 368/383 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 23 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-11-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-11 finished in 34249 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)||X(F(p2))))) U X(X(G(!p2)))))'
Support contains 3 out of 452 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 452/452 places, 397/397 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 443 transition count 388
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 443 transition count 388
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 440 transition count 385
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 440 transition count 385
Applied a total of 24 rules in 40 ms. Remains 440 /452 variables (removed 12) and now considering 385/397 (removed 12) transitions.
// Phase 1: matrix 385 rows 440 cols
[2025-05-30 04:08:29] [INFO ] Computed 91 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:08:29] [INFO ] Implicit Places using invariants in 583 ms returned []
[2025-05-30 04:08:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:08:32] [INFO ] Implicit Places using invariants and state equation in 2562 ms returned []
Implicit Place search using SMT with State Equation took 3147 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2025-05-30 04:08:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/440 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:54] [INFO ] Deduced a trap composed of 49 places in 334 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:54] [INFO ] Deduced a trap composed of 52 places in 305 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:54] [INFO ] Deduced a trap composed of 70 places in 215 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:54] [INFO ] Deduced a trap composed of 73 places in 192 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:55] [INFO ] Deduced a trap composed of 73 places in 233 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:55] [INFO ] Deduced a trap composed of 73 places in 332 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:55] [INFO ] Deduced a trap composed of 73 places in 338 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:56] [INFO ] Deduced a trap composed of 73 places in 323 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:56] [INFO ] Deduced a trap composed of 73 places in 322 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:56] [INFO ] Deduced a trap composed of 73 places in 319 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:57] [INFO ] Deduced a trap composed of 70 places in 361 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:57] [INFO ] Deduced a trap composed of 70 places in 346 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:57] [INFO ] Deduced a trap composed of 65 places in 294 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:58] [INFO ] Deduced a trap composed of 70 places in 327 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:58] [INFO ] Deduced a trap composed of 70 places in 303 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:58] [INFO ] Deduced a trap composed of 73 places in 259 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:59] [INFO ] Deduced a trap composed of 49 places in 319 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:59] [INFO ] Deduced a trap composed of 68 places in 345 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:08:59] [INFO ] Deduced a trap composed of 68 places in 293 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:00] [INFO ] Deduced a trap composed of 68 places in 297 ms of which 48 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:00] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:00] [INFO ] Deduced a trap composed of 71 places in 202 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:01] [INFO ] Deduced a trap composed of 71 places in 335 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:01] [INFO ] Deduced a trap composed of 66 places in 332 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:02] [INFO ] Deduced a trap composed of 70 places in 320 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:02] [INFO ] Deduced a trap composed of 70 places in 326 ms of which 74 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/825 variables, and 117 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/440 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/439 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/439 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/440 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/440 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/440 variables, 26/117 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:09] [INFO ] Deduced a trap composed of 53 places in 212 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:09] [INFO ] Deduced a trap composed of 53 places in 189 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:09] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:09] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:09] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:10] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:10] [INFO ] Deduced a trap composed of 53 places in 188 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:10] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:10] [INFO ] Deduced a trap composed of 53 places in 192 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:10] [INFO ] Deduced a trap composed of 53 places in 189 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:11] [INFO ] Deduced a trap composed of 53 places in 189 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:11] [INFO ] Deduced a trap composed of 52 places in 188 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:11] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:11] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:11] [INFO ] Deduced a trap composed of 65 places in 222 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:12] [INFO ] Deduced a trap composed of 65 places in 216 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:12] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:12] [INFO ] Deduced a trap composed of 66 places in 195 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:12] [INFO ] Deduced a trap composed of 66 places in 209 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:13] [INFO ] Deduced a trap composed of 66 places in 231 ms of which 65 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:13] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:14] [INFO ] Deduced a trap composed of 74 places in 340 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:14] [INFO ] Deduced a trap composed of 74 places in 337 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:14] [INFO ] Deduced a trap composed of 74 places in 325 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:15] [INFO ] Deduced a trap composed of 74 places in 320 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:15] [INFO ] Deduced a trap composed of 74 places in 312 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:15] [INFO ] Deduced a trap composed of 74 places in 364 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:16] [INFO ] Deduced a trap composed of 74 places in 357 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:16] [INFO ] Deduced a trap composed of 74 places in 324 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:17] [INFO ] Deduced a trap composed of 74 places in 377 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:17] [INFO ] Deduced a trap composed of 53 places in 324 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:17] [INFO ] Deduced a trap composed of 53 places in 309 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:18] [INFO ] Deduced a trap composed of 53 places in 309 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:18] [INFO ] Deduced a trap composed of 72 places in 310 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:18] [INFO ] Deduced a trap composed of 72 places in 326 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:19] [INFO ] Deduced a trap composed of 72 places in 320 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:19] [INFO ] Deduced a trap composed of 53 places in 301 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:19] [INFO ] Deduced a trap composed of 53 places in 325 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:20] [INFO ] Deduced a trap composed of 53 places in 324 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:20] [INFO ] Deduced a trap composed of 53 places in 334 ms of which 60 ms to minimize.
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 20/157 constraints. Problems are: Problem set: 2 solved, 382 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:21] [INFO ] Deduced a trap composed of 74 places in 322 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:21] [INFO ] Deduced a trap composed of 74 places in 336 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:22] [INFO ] Deduced a trap composed of 74 places in 336 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:22] [INFO ] Deduced a trap composed of 73 places in 327 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:22] [INFO ] Deduced a trap composed of 73 places in 343 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:23] [INFO ] Deduced a trap composed of 73 places in 329 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:23] [INFO ] Deduced a trap composed of 73 places in 334 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:23] [INFO ] Deduced a trap composed of 74 places in 320 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:24] [INFO ] Deduced a trap composed of 74 places in 348 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:24] [INFO ] Deduced a trap composed of 74 places in 340 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:25] [INFO ] Deduced a trap composed of 74 places in 325 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:25] [INFO ] Deduced a trap composed of 74 places in 331 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:25] [INFO ] Deduced a trap composed of 11 places in 292 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:26] [INFO ] Deduced a trap composed of 66 places in 350 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:26] [INFO ] Deduced a trap composed of 66 places in 319 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:26] [INFO ] Deduced a trap composed of 66 places in 326 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:27] [INFO ] Deduced a trap composed of 66 places in 315 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:27] [INFO ] Deduced a trap composed of 67 places in 332 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:27] [INFO ] Deduced a trap composed of 45 places in 344 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:28] [INFO ] Deduced a trap composed of 67 places in 350 ms of which 72 ms to minimize.
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 20/177 constraints. Problems are: Problem set: 12 solved, 372 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:29] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:29] [INFO ] Deduced a trap composed of 71 places in 322 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:29] [INFO ] Deduced a trap composed of 72 places in 276 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:30] [INFO ] Deduced a trap composed of 71 places in 276 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:30] [INFO ] Deduced a trap composed of 73 places in 266 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:30] [INFO ] Deduced a trap composed of 73 places in 248 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:30] [INFO ] Deduced a trap composed of 74 places in 245 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:31] [INFO ] Deduced a trap composed of 74 places in 247 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:31] [INFO ] Deduced a trap composed of 71 places in 252 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:31] [INFO ] Deduced a trap composed of 71 places in 291 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:32] [INFO ] Deduced a trap composed of 74 places in 293 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:32] [INFO ] Deduced a trap composed of 74 places in 294 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:32] [INFO ] Deduced a trap composed of 74 places in 274 ms of which 52 ms to minimize.
SMT process timed out in 60283ms, After SMT, problems are : Problem set: 12 solved, 372 unsolved
Search for dead transitions found 12 dead transitions in 60284ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 440/452 places, 373/397 transitions.
Applied a total of 0 rules in 9 ms. Remains 440 /440 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63484 ms. Remains : 440/452 places, 373/397 transitions.
Stuttering acceptance computed with spot in 311 ms :[p2, (AND p0 p2), p2, true, (AND p0 p2), p2, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-12
Product exploration explored 100000 steps with 19992 reset in 156 ms.
Stack based approach found an accepted trace after 1896 steps with 377 reset with depth 5 and stack size 5 in 3 ms.
FORMULA BusinessProcesses-PT-11-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-11-LTLFireability-12 finished in 63991 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)||X(F(p1))))'
Support contains 7 out of 452 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 452/452 places, 397/397 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 442 transition count 387
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 442 transition count 387
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 439 transition count 384
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 439 transition count 384
Applied a total of 26 rules in 23 ms. Remains 439 /452 variables (removed 13) and now considering 384/397 (removed 13) transitions.
// Phase 1: matrix 384 rows 439 cols
[2025-05-30 04:09:33] [INFO ] Computed 91 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:09:33] [INFO ] Implicit Places using invariants in 357 ms returned []
[2025-05-30 04:09:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 04:09:35] [INFO ] Implicit Places using invariants and state equation in 2028 ms returned []
Implicit Place search using SMT with State Equation took 2387 ms to find 0 implicit places.
Running 383 sub problems to find dead transitions.
[2025-05-30 04:09:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 1/439 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:50] [INFO ] Deduced a trap composed of 49 places in 322 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:51] [INFO ] Deduced a trap composed of 49 places in 317 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:51] [INFO ] Deduced a trap composed of 52 places in 303 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:51] [INFO ] Deduced a trap composed of 52 places in 311 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:52] [INFO ] Deduced a trap composed of 52 places in 278 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:52] [INFO ] Deduced a trap composed of 52 places in 285 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:52] [INFO ] Deduced a trap composed of 52 places in 262 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:53] [INFO ] Deduced a trap composed of 52 places in 269 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:53] [INFO ] Deduced a trap composed of 52 places in 311 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:53] [INFO ] Deduced a trap composed of 52 places in 318 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:54] [INFO ] Deduced a trap composed of 52 places in 310 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:54] [INFO ] Deduced a trap composed of 52 places in 315 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:54] [INFO ] Deduced a trap composed of 49 places in 317 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:55] [INFO ] Deduced a trap composed of 52 places in 312 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:55] [INFO ] Deduced a trap composed of 52 places in 283 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:55] [INFO ] Deduced a trap composed of 52 places in 293 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:55] [INFO ] Deduced a trap composed of 49 places in 305 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:56] [INFO ] Deduced a trap composed of 49 places in 318 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:56] [INFO ] Deduced a trap composed of 52 places in 312 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:56] [INFO ] Deduced a trap composed of 52 places in 304 ms of which 59 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:57] [INFO ] Deduced a trap composed of 52 places in 280 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:58] [INFO ] Deduced a trap composed of 51 places in 300 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:58] [INFO ] Deduced a trap composed of 51 places in 335 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:58] [INFO ] Deduced a trap composed of 51 places in 299 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:59] [INFO ] Deduced a trap composed of 49 places in 310 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:59] [INFO ] Deduced a trap composed of 49 places in 280 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:59] [INFO ] Deduced a trap composed of 49 places in 295 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:00] [INFO ] Deduced a trap composed of 51 places in 305 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:00] [INFO ] Deduced a trap composed of 49 places in 259 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:00] [INFO ] Deduced a trap composed of 49 places in 287 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:00] [INFO ] Deduced a trap composed of 49 places in 305 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:01] [INFO ] Deduced a trap composed of 49 places in 299 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:01] [INFO ] Deduced a trap composed of 51 places in 302 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:01] [INFO ] Deduced a trap composed of 51 places in 284 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:02] [INFO ] Deduced a trap composed of 20 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-30 04:10:02] [INFO ] Deduced a trap composed of 19 places in 291 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:03] [INFO ] Deduced a trap composed of 55 places in 351 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:03] [INFO ] Deduced a trap composed of 55 places in 334 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:04] [INFO ] Deduced a trap composed of 10 places in 273 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:04] [INFO ] Deduced a trap composed of 22 places in 283 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:05] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 8 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 439/823 variables, and 132 constraints, problems are : Problem set: 0 solved, 383 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/439 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 1/439 variables, 49/87 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/439 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 41/132 constraints. Problems are: Problem set: 0 solved, 383 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:12] [INFO ] Deduced a trap composed of 70 places in 194 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:13] [INFO ] Deduced a trap composed of 70 places in 198 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:13] [INFO ] Deduced a trap composed of 70 places in 204 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:13] [INFO ] Deduced a trap composed of 51 places in 292 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:14] [INFO ] Deduced a trap composed of 51 places in 354 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:15] [INFO ] Deduced a trap composed of 16 places in 241 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:15] [INFO ] Deduced a trap composed of 19 places in 242 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:15] [INFO ] Deduced a trap composed of 21 places in 333 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:16] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:17] [INFO ] Deduced a trap composed of 15 places in 373 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:17] [INFO ] Deduced a trap composed of 62 places in 378 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:18] [INFO ] Deduced a trap composed of 51 places in 419 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:18] [INFO ] Deduced a trap composed of 57 places in 438 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:19] [INFO ] Deduced a trap composed of 12 places in 307 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:19] [INFO ] Deduced a trap composed of 22 places in 304 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:19] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:19] [INFO ] Deduced a trap composed of 14 places in 313 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:20] [INFO ] Deduced a trap composed of 47 places in 350 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:20] [INFO ] Deduced a trap composed of 66 places in 368 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:21] [INFO ] Deduced a trap composed of 70 places in 351 ms of which 63 ms to minimize.
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 20/152 constraints. Problems are: Problem set: 4 solved, 379 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:21] [INFO ] Deduced a trap composed of 72 places in 304 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:22] [INFO ] Deduced a trap composed of 72 places in 303 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:22] [INFO ] Deduced a trap composed of 72 places in 299 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:22] [INFO ] Deduced a trap composed of 70 places in 241 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:23] [INFO ] Deduced a trap composed of 65 places in 235 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:23] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:23] [INFO ] Deduced a trap composed of 70 places in 214 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:23] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:23] [INFO ] Deduced a trap composed of 70 places in 185 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:24] [INFO ] Deduced a trap composed of 70 places in 266 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:24] [INFO ] Deduced a trap composed of 70 places in 294 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:24] [INFO ] Deduced a trap composed of 65 places in 269 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:25] [INFO ] Deduced a trap composed of 65 places in 264 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:25] [INFO ] Deduced a trap composed of 70 places in 220 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:25] [INFO ] Deduced a trap composed of 71 places in 254 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:25] [INFO ] Deduced a trap composed of 71 places in 259 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:26] [INFO ] Deduced a trap composed of 71 places in 282 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:26] [INFO ] Deduced a trap composed of 71 places in 299 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:26] [INFO ] Deduced a trap composed of 71 places in 336 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:27] [INFO ] Deduced a trap composed of 66 places in 324 ms of which 60 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/439 variables, 20/172 constraints. Problems are: Problem set: 4 solved, 379 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:28] [INFO ] Deduced a trap composed of 73 places in 333 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:28] [INFO ] Deduced a trap composed of 73 places in 358 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:28] [INFO ] Deduced a trap composed of 73 places in 343 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:29] [INFO ] Deduced a trap composed of 71 places in 316 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:29] [INFO ] Deduced a trap composed of 53 places in 306 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:30] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:30] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:30] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:30] [INFO ] Deduced a trap composed of 52 places in 202 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:31] [INFO ] Deduced a trap composed of 52 places in 188 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:31] [INFO ] Deduced a trap composed of 52 places in 286 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:31] [INFO ] Deduced a trap composed of 71 places in 252 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:31] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:32] [INFO ] Deduced a trap composed of 71 places in 200 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:32] [INFO ] Deduced a trap composed of 71 places in 196 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:32] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:32] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:32] [INFO ] Deduced a trap composed of 46 places in 195 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:33] [INFO ] Deduced a trap composed of 73 places in 207 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:33] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 37 ms to minimize.
Problem TDEAD317 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/439 variables, 20/192 constraints. Problems are: Problem set: 10 solved, 373 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:33] [INFO ] Deduced a trap composed of 73 places in 200 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:34] [INFO ] Deduced a trap composed of 73 places in 210 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:34] [INFO ] Deduced a trap composed of 73 places in 201 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:34] [INFO ] Deduced a trap composed of 53 places in 192 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:35] [INFO ] Deduced a trap composed of 52 places in 174 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:35] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:35] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:35] [INFO ] Deduced a trap composed of 73 places in 194 ms of which 40 ms to minimize.
SMT process timed out in 60226ms, After SMT, problems are : Problem set: 10 solved, 373 unsolved
Search for dead transitions found 10 dead transitions in 60229ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 439/452 places, 374/397 transitions.
Applied a total of 0 rules in 7 ms. Remains 439 /439 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62647 ms. Remains : 439/452 places, 374/397 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-11-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Product exploration explored 100000 steps with 50000 reset in 166 ms.
Computed a total of 424 stabilizing places and 359 stable transitions
Graph (complete) has 973 edges and 439 vertex of which 438 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 424 stabilizing places and 359 stable transitions
Detected a total of 424/439 stabilizing places and 359/374 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 15 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-11-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-11-LTLFireability-13 finished in 63105 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 U (G(p0)||(p0&&G(p1))))&&(p0 U (p2||G(p0))))) U X(p3)))'
[2025-05-30 04:10:36] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2141019338241509929
[2025-05-30 04:10:36] [INFO ] Computing symmetric may disable matrix : 397 transitions.
[2025-05-30 04:10:36] [INFO ] Applying decomposition
[2025-05-30 04:10:36] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 04:10:36] [INFO ] Computing symmetric may enable matrix : 397 transitions.
[2025-05-30 04:10:36] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 04:10:36] [INFO ] Flatten gal took : 26 ms
[2025-05-30 04:10:36] [INFO ] Computing Do-Not-Accords matrix : 397 transitions.
[2025-05-30 04:10:36] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5793015508129977508.txt' '-o' '/tmp/graph5793015508129977508.bin' '-w' '/tmp/graph5793015508129977508.weights'
[2025-05-30 04:10:36] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2141019338241509929
Running compilation step : cd /tmp/ltsmin2141019338241509929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5793015508129977508.bin' '-l' '-1' '-v' '-w' '/tmp/graph5793015508129977508.weights' '-q' '0' '-e' '0.001'
[2025-05-30 04:10:36] [INFO ] Decomposing Gal with order
[2025-05-30 04:10:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 04:10:36] [INFO ] Removed a total of 249 redundant transitions.
[2025-05-30 04:10:36] [INFO ] Flatten gal took : 74 ms
[2025-05-30 04:10:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2025-05-30 04:10:36] [INFO ] Time to serialize gal into /tmp/LTLFireability1305748257608655808.gal : 22 ms
[2025-05-30 04:10:36] [INFO ] Time to serialize properties into /tmp/LTLFireability833332276960165352.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1305748257608655808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability833332276960165352.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F((("(i11.u123.p404!=1)")U((G("(i11.u123.p404!=1)"))||(("(i11.u123.p404!=1)")&&(G("(i9.u14.p35!=1)")))))&&(("(i11.u123.p404!=1)")U...258
Formula 0 simplified : G((F!"(i9.u14.p35!=1)" U !"(i11.u123.p404!=1)") | (!"(i11.u123.p404!=1)" M !"((i11.u123.p404!=1)&&(i8.u132.p449!=1))")) R X!"(i10.u1...167
Compilation finished in 1297 ms.
Running link step : cd /tmp/ltsmin2141019338241509929;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2141019338241509929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[]((LTLAPp1==true)))))&&((LTLAPp0==true) U ((LTLAPp2==true)||[]((LTLAPp0==true)))))) U X((LTLAPp3==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t40, t162, t175, t183, t191, t203, t211, t223, t231, t235, t254, t262, t388, ...1234
Computing Next relation with stutter on 1212 deadlock states
Detected timeout of ITS tools.
[2025-05-30 04:34:15] [INFO ] Applying decomposition
[2025-05-30 04:34:15] [INFO ] Flatten gal took : 56 ms
[2025-05-30 04:34:15] [INFO ] Decomposing Gal with order
[2025-05-30 04:34:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 04:34:16] [INFO ] Removed a total of 133 redundant transitions.
[2025-05-30 04:34:16] [INFO ] Flatten gal took : 133 ms
[2025-05-30 04:34:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 396 ms.
[2025-05-30 04:34:16] [INFO ] Time to serialize gal into /tmp/LTLFireability8665646377384479819.gal : 25 ms
[2025-05-30 04:34:16] [INFO ] Time to serialize properties into /tmp/LTLFireability7717060431140357072.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8665646377384479819.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7717060431140357072.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F((("(i1.u190.p404!=1)")U((G("(i1.u190.p404!=1)"))||(("(i1.u190.p404!=1)")&&(G("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...341
Formula 0 simplified : G((F!"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u26.p35!=1)" U !"(i1.u190.p404!=1)") | (!"(i1.u190.p4...253
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.031: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.037: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.037: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.042: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.042: LTL layer: formula: (<>((((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[]((LTLAPp1==true)))))&&((LTLAPp0==true) U ((LTLAPp2==true)||[]((LTLAPp0==true)))))) U X((LTLAPp3==true)))
pins2lts-mc-linux64( 3/ 8), 0.042: "(<>((((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[]((LTLAPp1==true)))))&&((LTLAPp0==true) U ((LTLAPp2==true)||[]((LTLAPp0==true)))))) U X((LTLAPp3==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.042: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.094: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.108: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.110: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.111: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.116: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.119: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.273: There are 402 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.273: State length is 453, there are 449 groups
pins2lts-mc-linux64( 0/ 8), 0.273: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.273: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.273: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.273: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.391: [Blue] ~120 levels ~960 states ~3096 transitions
pins2lts-mc-linux64( 3/ 8), 0.435: [Blue] ~125 levels ~1920 states ~8200 transitions
pins2lts-mc-linux64( 3/ 8), 0.498: [Blue] ~125 levels ~3840 states ~16000 transitions
pins2lts-mc-linux64( 0/ 8), 0.655: [Blue] ~257 levels ~7680 states ~25688 transitions
pins2lts-mc-linux64( 5/ 8), 0.901: [Blue] ~134 levels ~15360 states ~63688 transitions
pins2lts-mc-linux64( 6/ 8), 1.339: [Blue] ~223 levels ~30720 states ~109184 transitions
pins2lts-mc-linux64( 6/ 8), 2.221: [Blue] ~223 levels ~61440 states ~242952 transitions
pins2lts-mc-linux64( 6/ 8), 3.774: [Blue] ~449 levels ~122880 states ~494448 transitions
pins2lts-mc-linux64( 6/ 8), 7.482: [Blue] ~466 levels ~245760 states ~1073584 transitions
pins2lts-mc-linux64( 6/ 8), 12.326: [Blue] ~466 levels ~491520 states ~2294080 transitions
pins2lts-mc-linux64( 6/ 8), 20.316: [Blue] ~488 levels ~983040 states ~5090856 transitions
pins2lts-mc-linux64( 6/ 8), 35.890: [Blue] ~488 levels ~1966080 states ~10671240 transitions
pins2lts-mc-linux64( 1/ 8), 65.780: [Blue] ~427 levels ~3932160 states ~25145792 transitions
pins2lts-mc-linux64( 6/ 8), 125.964: [Blue] ~488 levels ~7864320 states ~50506400 transitions
pins2lts-mc-linux64( 1/ 8), 248.489: [Blue] ~427 levels ~15728640 states ~116322200 transitions
pins2lts-mc-linux64( 6/ 8), 495.501: [Blue] ~488 levels ~31457280 states ~232029872 transitions
pins2lts-mc-linux64( 6/ 8), 991.728: [Blue] ~494 levels ~62914560 states ~488102472 transitions
pins2lts-mc-linux64( 4/ 8), 1659.896: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1659.951:
pins2lts-mc-linux64( 0/ 8), 1659.951: Explored 98319846 states 867504245 transitions, fanout: 8.823
pins2lts-mc-linux64( 0/ 8), 1659.951: Total exploration time 1659.660 sec (1659.600 sec minimum, 1659.625 sec on average)
pins2lts-mc-linux64( 0/ 8), 1659.951: States per second: 59241, Transitions per second: 522700
pins2lts-mc-linux64( 0/ 8), 1659.951:
pins2lts-mc-linux64( 0/ 8), 1659.951: State space has 96487584 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1659.951: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1659.951: blue states: 98319846 (101.90%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1659.951: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1659.951: all-red states: 35 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1659.951:
pins2lts-mc-linux64( 0/ 8), 1659.951: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 1659.951:
pins2lts-mc-linux64( 0/ 8), 1659.951: Queue width: 8B, total height: 2793, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 1659.951: Tree memory: 992.1MB, 10.8 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 1659.951: Tree fill ratio (roots/leafs): 71.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1659.951: Stored 399 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1659.951: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1659.951: Est. total memory use: 992.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2141019338241509929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[]((LTLAPp1==true)))))&&((LTLAPp0==true) U ((LTLAPp2==true)||[]((LTLAPp0==true)))))) U X((LTLAPp3==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2141019338241509929;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((((LTLAPp0==true) U ([]((LTLAPp0==true))||((LTLAPp0==true)&&[]((LTLAPp1==true)))))&&((LTLAPp0==true) U ((LTLAPp2==true)||[]((LTLAPp0==true)))))) U X((LTLAPp3==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-05-30 04:57:59] [INFO ] Flatten gal took : 1190 ms
[2025-05-30 04:58:01] [INFO ] Input system was already deterministic with 397 transitions.
[2025-05-30 04:58:02] [INFO ] Transformed 452 places.
[2025-05-30 04:58:02] [INFO ] Transformed 397 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-05-30 04:58:32] [INFO ] Time to serialize gal into /tmp/LTLFireability6474521679097316182.gal : 16 ms
[2025-05-30 04:58:32] [INFO ] Time to serialize properties into /tmp/LTLFireability4801034998331556969.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6474521679097316182.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4801034998331556969.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F((("(p404!=1)")U((G("(p404!=1)"))||(("(p404!=1)")&&(G("(p35!=1)")))))&&(("(p404!=1)")U(("((p404!=1)&&(p449!=1))")||(G("(p404!=1)"...180
Formula 0 simplified : G((F!"(p35!=1)" U !"(p404!=1)") | (!"(p404!=1)" M !"((p404!=1)&&(p449!=1))")) R X!"(p373==1)"
BK_TIME_CONFINEMENT_REACHED
--------------------
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-11"
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-11, 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-174853813300084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 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 ;