Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813300100.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-13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813300100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K 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 148K 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-13-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748586906927

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 06:35:09] [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 06:35:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 06:35:10] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2025-05-30 06:35:10] [INFO ] Transformed 593 places.
[2025-05-30 06:35:10] [INFO ] Transformed 536 transitions.
[2025-05-30 06:35:10] [INFO ] Found NUPN structural information;
[2025-05-30 06:35:10] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 474 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 8 places in 20 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 77 places :
Symmetric choice reduction at 1 with 77 rule applications. Total rules 82 place count 503 transition count 451
Iterating global reduction 1 with 77 rules applied. Total rules applied 159 place count 503 transition count 451
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 195 place count 467 transition count 415
Iterating global reduction 1 with 36 rules applied. Total rules applied 231 place count 467 transition count 415
Applied a total of 231 rules in 275 ms. Remains 467 /585 variables (removed 118) and now considering 415/528 (removed 113) transitions.
// Phase 1: matrix 415 rows 467 cols
[2025-05-30 06:35:10] [INFO ] Computed 90 invariants in 58 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:35:11] [INFO ] Implicit Places using invariants in 1120 ms returned []
[2025-05-30 06:35:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:35:14] [INFO ] Implicit Places using invariants and state equation in 2499 ms returned []
Implicit Place search using SMT with State Equation took 3694 ms to find 0 implicit places.
Running 414 sub problems to find dead transitions.
[2025-05-30 06:35:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 53/89 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:42] [INFO ] Deduced a trap composed of 88 places in 466 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:42] [INFO ] Deduced a trap composed of 90 places in 333 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:42] [INFO ] Deduced a trap composed of 88 places in 337 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:43] [INFO ] Deduced a trap composed of 87 places in 385 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:43] [INFO ] Deduced a trap composed of 86 places in 417 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:44] [INFO ] Deduced a trap composed of 88 places in 392 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:44] [INFO ] Deduced a trap composed of 88 places in 260 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:44] [INFO ] Deduced a trap composed of 87 places in 420 ms of which 88 ms to minimize.
SMT process timed out in 30296ms, After SMT, problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 30322ms
Starting structural reductions in LTL mode, iteration 1 : 467/585 places, 415/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34336 ms. Remains : 467/585 places, 415/528 transitions.
Support contains 33 out of 467 places after structural reductions.
[2025-05-30 06:35:45] [INFO ] Flatten gal took : 132 ms
[2025-05-30 06:35:45] [INFO ] Flatten gal took : 68 ms
[2025-05-30 06:35:45] [INFO ] Input system was already deterministic with 415 transitions.
RANDOM walk for 40000 steps (286 resets) in 2673 ms. (14 steps per ms) remains 16/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
[2025-05-30 06:35:46] [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/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 165/188 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 161/349 variables, 41/53 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 106/455 variables, 35/88 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 3/458 variables, 2/90 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 409/867 variables, 458/548 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/867 variables, 0/548 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 11/878 variables, 6/554 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/878 variables, 0/554 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 4/882 variables, 3/557 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/882 variables, 0/557 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/882 variables, 0/557 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 882/882 variables, and 557 constraints, problems are : Problem set: 1 solved, 15 unsolved in 3812 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 467/467 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 166/188 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 161/349 variables, 41/53 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:51] [INFO ] Deduced a trap composed of 19 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:51] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:51] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:51] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:51] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:51] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:52] [INFO ] Deduced a trap composed of 82 places in 182 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:52] [INFO ] Deduced a trap composed of 83 places in 266 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:52] [INFO ] Deduced a trap composed of 77 places in 263 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:52] [INFO ] Deduced a trap composed of 77 places in 236 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:53] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:53] [INFO ] Deduced a trap composed of 83 places in 265 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:53] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:53] [INFO ] Deduced a trap composed of 77 places in 229 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:54] [INFO ] Deduced a trap composed of 62 places in 262 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:54] [INFO ] Deduced a trap composed of 75 places in 265 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:54] [INFO ] Deduced a trap composed of 76 places in 264 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:54] [INFO ] Deduced a trap composed of 75 places in 235 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:55] [INFO ] Deduced a trap composed of 76 places in 250 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:55] [INFO ] Deduced a trap composed of 75 places in 269 ms of which 52 ms to minimize.
SMT process timed out in 8886ms, After SMT, problems are : Problem set: 1 solved, 15 unsolved
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 22 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 415/415 transitions.
Graph (trivial) has 199 edges and 467 vertex of which 6 / 467 are part of one of the 1 SCC in 4 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 1042 edges and 462 vertex of which 461 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 461 transition count 363
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 90 place count 417 transition count 363
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 89 Pre rules applied. Total rules applied 90 place count 417 transition count 274
Deduced a syphon composed of 89 places in 3 ms
Ensure Unique test removed 13 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 191 rules applied. Total rules applied 281 place count 315 transition count 274
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 287 place count 309 transition count 268
Iterating global reduction 2 with 6 rules applied. Total rules applied 293 place count 309 transition count 268
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 527 place count 190 transition count 153
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 529 place count 189 transition count 157
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 531 place count 189 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 533 place count 187 transition count 155
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 534 place count 187 transition count 155
Applied a total of 534 rules in 196 ms. Remains 187 /467 variables (removed 280) and now considering 155/415 (removed 260) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 187/467 places, 155/415 transitions.
RANDOM walk for 40000 steps (1219 resets) in 1202 ms. (33 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40002 steps (520 resets) in 281 ms. (141 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (372 resets) in 301 ms. (132 steps per ms) remains 2/2 properties
// Phase 1: matrix 155 rows 187 cols
[2025-05-30 06:35:56] [INFO ] Computed 73 invariants in 7 ms
[2025-05-30 06:35:56] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 80/140 variables, 47/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 41/181 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:56] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:56] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:56] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:56] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:56] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:56] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:57] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:57] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:57] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:57] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:57] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:57] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:58] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:58] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:58] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 15/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/183 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 154/337 variables, 183/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/337 variables, 12/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/337 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 5/342 variables, 4/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/342 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/342 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 287 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2542 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 187/187 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 56/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 80/140 variables, 47/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 41/181 variables, 19/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 13/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:59] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:59] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:59] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:59] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:59] [INFO ] Deduced a trap composed of 38 places in 151 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:35:59] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:00] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:00] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:00] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:00] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:00] [INFO ] Deduced a trap composed of 40 places in 153 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:00] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:01] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 27 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/183 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/183 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 154/337 variables, 183/284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 12/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:01] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 19 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/337 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:01] [INFO ] Deduced a trap composed of 32 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:01] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:02] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:02] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 16 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/337 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/337 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 5/342 variables, 4/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/342 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/342 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/342 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 307 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3825 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 187/187 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6387ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 57 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 14 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1049 edges and 467 vertex of which 466 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.29 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 415/415 transitions.
Graph (trivial) has 223 edges and 467 vertex of which 6 / 467 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 1043 edges and 462 vertex of which 461 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 460 transition count 353
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 406 transition count 352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 405 transition count 352
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 112 place count 405 transition count 257
Deduced a syphon composed of 95 places in 2 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 206 rules applied. Total rules applied 318 place count 294 transition count 257
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 330 place count 282 transition count 245
Iterating global reduction 3 with 12 rules applied. Total rules applied 342 place count 282 transition count 245
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 578 place count 162 transition count 129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 582 place count 160 transition count 132
Applied a total of 582 rules in 131 ms. Remains 160 /467 variables (removed 307) and now considering 132/415 (removed 283) transitions.
// Phase 1: matrix 132 rows 160 cols
[2025-05-30 06:36:03] [INFO ] Computed 70 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:36:03] [INFO ] Implicit Places using invariants in 358 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 46, 49, 50, 51, 52, 133]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 361 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/467 places, 132/415 transitions.
Applied a total of 0 rules in 14 ms. Remains 140 /140 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 506 ms. Remains : 140/467 places, 132/415 transitions.
Stuttering acceptance computed with spot in 448 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-02 finished in 1071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0&&X(X(X(p1)))&&(p0 U (p2||G(p0)))))'
Support contains 3 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 415/415 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 454 transition count 402
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 454 transition count 402
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 448 transition count 396
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 448 transition count 396
Applied a total of 38 rules in 56 ms. Remains 448 /467 variables (removed 19) and now considering 396/415 (removed 19) transitions.
// Phase 1: matrix 396 rows 448 cols
[2025-05-30 06:36:04] [INFO ] Computed 90 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:36:04] [INFO ] Implicit Places using invariants in 550 ms returned []
[2025-05-30 06:36:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:36:07] [INFO ] Implicit Places using invariants and state equation in 2453 ms returned []
Implicit Place search using SMT with State Equation took 3005 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2025-05-30 06:36:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/448 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:29] [INFO ] Deduced a trap composed of 76 places in 379 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:29] [INFO ] Deduced a trap composed of 76 places in 352 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:30] [INFO ] Deduced a trap composed of 76 places in 354 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:30] [INFO ] Deduced a trap composed of 76 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 06:36:31] [INFO ] Deduced a trap composed of 76 places in 368 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:31] [INFO ] Deduced a trap composed of 76 places in 350 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:31] [INFO ] Deduced a trap composed of 76 places in 352 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:32] [INFO ] Deduced a trap composed of 78 places in 349 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:32] [INFO ] Deduced a trap composed of 78 places in 328 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:33] [INFO ] Deduced a trap composed of 36 places in 342 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:33] [INFO ] Deduced a trap composed of 78 places in 347 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:33] [INFO ] Deduced a trap composed of 78 places in 323 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:34] [INFO ] Deduced a trap composed of 77 places in 357 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:34] [INFO ] Deduced a trap composed of 76 places in 328 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:35] [INFO ] Deduced a trap composed of 77 places in 367 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:35] [INFO ] Deduced a trap composed of 77 places in 364 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:36] [INFO ] Deduced a trap composed of 70 places in 384 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:36] [INFO ] Deduced a trap composed of 71 places in 401 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:37] [INFO ] Deduced a trap composed of 71 places in 331 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:37] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/844 variables, and 110 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/448 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/448 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 20/110 constraints. Problems are: Problem set: 3 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:44] [INFO ] Deduced a trap composed of 78 places in 263 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:45] [INFO ] Deduced a trap composed of 78 places in 360 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:45] [INFO ] Deduced a trap composed of 78 places in 355 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:46] [INFO ] Deduced a trap composed of 78 places in 337 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:46] [INFO ] Deduced a trap composed of 78 places in 320 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:47] [INFO ] Deduced a trap composed of 15 places in 307 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:47] [INFO ] Deduced a trap composed of 27 places in 278 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:48] [INFO ] Deduced a trap composed of 32 places in 379 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:48] [INFO ] Deduced a trap composed of 55 places in 369 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:49] [INFO ] Deduced a trap composed of 33 places in 372 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:49] [INFO ] Deduced a trap composed of 34 places in 273 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:50] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:51] [INFO ] Deduced a trap composed of 72 places in 385 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:51] [INFO ] Deduced a trap composed of 16 places in 315 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:52] [INFO ] Deduced a trap composed of 20 places in 317 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:52] [INFO ] Deduced a trap composed of 18 places in 293 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:53] [INFO ] Deduced a trap composed of 16 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 06:36:53] [INFO ] Deduced a trap composed of 43 places in 428 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:54] [INFO ] Deduced a trap composed of 69 places in 436 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:54] [INFO ] Deduced a trap composed of 69 places in 424 ms of which 83 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 20/130 constraints. Problems are: Problem set: 3 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:55] [INFO ] Deduced a trap composed of 77 places in 362 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:56] [INFO ] Deduced a trap composed of 77 places in 360 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:56] [INFO ] Deduced a trap composed of 77 places in 403 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:57] [INFO ] Deduced a trap composed of 72 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 06:36:57] [INFO ] Deduced a trap composed of 75 places in 321 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:57] [INFO ] Deduced a trap composed of 69 places in 347 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:58] [INFO ] Deduced a trap composed of 69 places in 367 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:58] [INFO ] Deduced a trap composed of 71 places in 431 ms of which 151 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:59] [INFO ] Deduced a trap composed of 71 places in 341 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:59] [INFO ] Deduced a trap composed of 71 places in 350 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:36:59] [INFO ] Deduced a trap composed of 69 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 06:37:00] [INFO ] Deduced a trap composed of 69 places in 355 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:00] [INFO ] Deduced a trap composed of 69 places in 339 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:00] [INFO ] Deduced a trap composed of 69 places in 350 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:01] [INFO ] Deduced a trap composed of 69 places in 354 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:01] [INFO ] Deduced a trap composed of 71 places in 361 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:02] [INFO ] Deduced a trap composed of 71 places in 351 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:02] [INFO ] Deduced a trap composed of 71 places in 351 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:03] [INFO ] Deduced a trap composed of 56 places in 310 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:03] [INFO ] Deduced a trap composed of 33 places in 327 ms of which 47 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 20/150 constraints. Problems are: Problem set: 3 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:04] [INFO ] Deduced a trap composed of 78 places in 353 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:05] [INFO ] Deduced a trap composed of 77 places in 344 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:05] [INFO ] Deduced a trap composed of 77 places in 349 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:06] [INFO ] Deduced a trap composed of 77 places in 323 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:06] [INFO ] Deduced a trap composed of 77 places in 352 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:07] [INFO ] Deduced a trap composed of 77 places in 394 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:07] [INFO ] Deduced a trap composed of 76 places in 393 ms of which 106 ms to minimize.
SMT process timed out in 60224ms, After SMT, problems are : Problem set: 3 solved, 392 unsolved
Search for dead transitions found 3 dead transitions in 60229ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 448/467 places, 393/415 transitions.
Applied a total of 0 rules in 17 ms. Remains 448 /448 variables (removed 0) and now considering 393/393 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63312 ms. Remains : 448/467 places, 393/415 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-03
Product exploration explored 100000 steps with 25000 reset in 491 ms.
Product exploration explored 100000 steps with 25000 reset in 371 ms.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1018 edges and 448 vertex of which 447 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Detected a total of 118/448 stabilizing places and 111/393 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 232 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (289 resets) in 283 ms. (140 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (49 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 698652 steps, run timeout after 3001 ms. (steps per millisecond=232 ) properties seen :0 out of 1
Probabilistic random walk after 698652 steps, saw 109224 distinct states, run finished after 3008 ms. (steps per millisecond=232 ) properties seen :0
// Phase 1: matrix 393 rows 448 cols
[2025-05-30 06:37:12] [INFO ] Computed 90 invariants in 6 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 243/323 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:12] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:12] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:13] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:13] [INFO ] Deduced a trap composed of 26 places in 241 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:13] [INFO ] Deduced a trap composed of 71 places in 243 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:13] [INFO ] Deduced a trap composed of 71 places in 255 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:14] [INFO ] Deduced a trap composed of 71 places in 229 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:14] [INFO ] Deduced a trap composed of 76 places in 247 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:14] [INFO ] Deduced a trap composed of 76 places in 228 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:14] [INFO ] Deduced a trap composed of 76 places in 222 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:15] [INFO ] Deduced a trap composed of 71 places in 254 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:15] [INFO ] Deduced a trap composed of 71 places in 184 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:15] [INFO ] Deduced a trap composed of 72 places in 173 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:15] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 113/436 variables, 36/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:16] [INFO ] Deduced a trap composed of 72 places in 427 ms of which 225 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/438 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 386/824 variables, 438/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:16] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:16] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:17] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:17] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 11 ms to minimize.
SMT process timed out in 5066ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 393/393 transitions.
Graph (trivial) has 205 edges and 448 vertex of which 6 / 448 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 1011 edges and 443 vertex of which 442 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 442 transition count 340
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 397 transition count 340
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 92 place count 397 transition count 244
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 301 place count 284 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 302 place count 283 transition count 243
Iterating global reduction 2 with 1 rules applied. Total rules applied 303 place count 283 transition count 243
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 547 place count 159 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 549 place count 158 transition count 127
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 551 place count 158 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 553 place count 156 transition count 125
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 554 place count 156 transition count 125
Applied a total of 554 rules in 100 ms. Remains 156 /448 variables (removed 292) and now considering 125/393 (removed 268) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 156/448 places, 125/393 transitions.
RANDOM walk for 4266 steps (183 resets) in 35 ms. (118 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 321 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 448 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 448/448 places, 393/393 transitions.
Applied a total of 0 rules in 17 ms. Remains 448 /448 variables (removed 0) and now considering 393/393 (removed 0) transitions.
[2025-05-30 06:37:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:37:18] [INFO ] Implicit Places using invariants in 600 ms returned []
[2025-05-30 06:37:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:37:21] [INFO ] Implicit Places using invariants and state equation in 2338 ms returned []
Implicit Place search using SMT with State Equation took 2940 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2025-05-30 06:37:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/447 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/447 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/448 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/448 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:44] [INFO ] Deduced a trap composed of 76 places in 360 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:44] [INFO ] Deduced a trap composed of 78 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 06:37:45] [INFO ] Deduced a trap composed of 76 places in 334 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:45] [INFO ] Deduced a trap composed of 76 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 06:37:46] [INFO ] Deduced a trap composed of 78 places in 313 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:46] [INFO ] Deduced a trap composed of 77 places in 336 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:46] [INFO ] Deduced a trap composed of 76 places in 371 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:47] [INFO ] Deduced a trap composed of 27 places in 340 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:47] [INFO ] Deduced a trap composed of 77 places in 363 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:48] [INFO ] Deduced a trap composed of 76 places in 366 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:48] [INFO ] Deduced a trap composed of 72 places in 330 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:48] [INFO ] Deduced a trap composed of 76 places in 349 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:49] [INFO ] Deduced a trap composed of 76 places in 348 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:49] [INFO ] Deduced a trap composed of 76 places in 339 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:50] [INFO ] Deduced a trap composed of 73 places in 526 ms of which 244 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:50] [INFO ] Deduced a trap composed of 72 places in 409 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:51] [INFO ] Deduced a trap composed of 72 places in 363 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:51] [INFO ] Deduced a trap composed of 72 places in 322 ms of which 44 ms to minimize.
SMT process timed out in 30197ms, After SMT, problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 30199ms
Finished structural reductions in LTL mode , in 1 iterations and 33160 ms. Remains : 448/448 places, 393/393 transitions.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 1018 edges and 448 vertex of which 447 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (285 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (50 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 722835 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :0 out of 1
Probabilistic random walk after 722835 steps, saw 112091 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
[2025-05-30 06:37:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 243/323 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:55] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:55] [INFO ] Deduced a trap composed of 28 places in 211 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:55] [INFO ] Deduced a trap composed of 69 places in 224 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:55] [INFO ] Deduced a trap composed of 72 places in 202 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:56] [INFO ] Deduced a trap composed of 70 places in 210 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:56] [INFO ] Deduced a trap composed of 73 places in 215 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:56] [INFO ] Deduced a trap composed of 73 places in 210 ms of which 40 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 113/436 variables, 36/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:57] [INFO ] Deduced a trap composed of 33 places in 356 ms of which 57 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/438 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 386/824 variables, 438/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:57] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:57] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:57] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:58] [INFO ] Deduced a trap composed of 20 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:58] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:58] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:58] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/824 variables, 7/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:58] [INFO ] Deduced a trap along path composed of 3 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:58] [INFO ] Deduced a trap along path composed of 3 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:58] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:58] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/824 variables, 4/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/824 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/835 variables, 6/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/835 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/841 variables, 4/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/841 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/841 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 557 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4360 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 448/448 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 79/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 243/323 variables, 50/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 113/436 variables, 36/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:37:59] [INFO ] Deduced a trap composed of 15 places in 341 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:00] [INFO ] Deduced a trap composed of 17 places in 336 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:00] [INFO ] Deduced a trap composed of 18 places in 332 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:00] [INFO ] Deduced a trap composed of 19 places in 320 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:01] [INFO ] Deduced a trap composed of 23 places in 335 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:01] [INFO ] Deduced a trap composed of 27 places in 344 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:01] [INFO ] Deduced a trap composed of 43 places in 344 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:02] [INFO ] Deduced a trap composed of 70 places in 367 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:02] [INFO ] Deduced a trap composed of 70 places in 382 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:03] [INFO ] Deduced a trap composed of 70 places in 358 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:03] [INFO ] Deduced a trap composed of 70 places in 341 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:03] [INFO ] Deduced a trap composed of 71 places in 380 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:04] [INFO ] Deduced a trap composed of 70 places in 573 ms of which 262 ms to minimize.
SMT process timed out in 9551ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 393/393 transitions.
Graph (trivial) has 205 edges and 448 vertex of which 6 / 448 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 1011 edges and 443 vertex of which 442 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 442 transition count 340
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 397 transition count 340
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 92 place count 397 transition count 244
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 301 place count 284 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 302 place count 283 transition count 243
Iterating global reduction 2 with 1 rules applied. Total rules applied 303 place count 283 transition count 243
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 547 place count 159 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 549 place count 158 transition count 127
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 551 place count 158 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 553 place count 156 transition count 125
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 554 place count 156 transition count 125
Applied a total of 554 rules in 92 ms. Remains 156 /448 variables (removed 292) and now considering 125/393 (removed 268) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 156/448 places, 125/393 transitions.
RANDOM walk for 1137 steps (43 resets) in 12 ms. (87 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 175 ms.
Product exploration explored 100000 steps with 25000 reset in 132 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 448/448 places, 393/393 transitions.
Graph (trivial) has 205 edges and 448 vertex of which 6 / 448 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 1012 edges and 443 vertex of which 442 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 442 transition count 386
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 68 Pre rules applied. Total rules applied 46 place count 442 transition count 434
Deduced a syphon composed of 112 places in 0 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 114 place count 442 transition count 434
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 129 place count 427 transition count 407
Deduced a syphon composed of 98 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 144 place count 427 transition count 407
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 246 places in 1 ms
Iterating global reduction 1 with 148 rules applied. Total rules applied 292 place count 427 transition count 407
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 328 place count 391 transition count 371
Deduced a syphon composed of 210 places in 0 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 364 place count 391 transition count 371
Deduced a syphon composed of 210 places in 0 ms
Applied a total of 364 rules in 102 ms. Remains 391 /448 variables (removed 57) and now considering 371/393 (removed 22) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 06:38:06] [INFO ] Redundant transitions in 30 ms returned []
Running 370 sub problems to find dead transitions.
// Phase 1: matrix 371 rows 391 cols
[2025-05-30 06:38:06] [INFO ] Computed 90 invariants in 9 ms
[2025-05-30 06:38:06] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/391 variables, 53/89 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:25] [INFO ] Deduced a trap composed of 14 places in 366 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:25] [INFO ] Deduced a trap composed of 14 places in 283 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:26] [INFO ] Deduced a trap composed of 25 places in 347 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:26] [INFO ] Deduced a trap composed of 35 places in 364 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:27] [INFO ] Deduced a trap composed of 35 places in 331 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:27] [INFO ] Deduced a trap composed of 37 places in 321 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:27] [INFO ] Deduced a trap composed of 37 places in 314 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:28] [INFO ] Deduced a trap composed of 26 places in 335 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:28] [INFO ] Deduced a trap composed of 3 places in 293 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:28] [INFO ] Deduced a trap composed of 26 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 06:38:29] [INFO ] Deduced a trap composed of 26 places in 338 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:29] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:29] [INFO ] Deduced a trap composed of 3 places in 303 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:29] [INFO ] Deduced a trap composed of 36 places in 351 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:30] [INFO ] Deduced a trap composed of 36 places in 352 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:30] [INFO ] Deduced a trap composed of 36 places in 348 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:31] [INFO ] Deduced a trap composed of 36 places in 344 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:31] [INFO ] Deduced a trap composed of 36 places in 310 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:31] [INFO ] Deduced a trap composed of 36 places in 308 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:32] [INFO ] Deduced a trap composed of 36 places in 305 ms of which 34 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 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 TDEAD193 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD234 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 20/110 constraints. Problems are: Problem set: 43 solved, 327 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:32] [INFO ] Deduced a trap composed of 36 places in 369 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:33] [INFO ] Deduced a trap composed of 36 places in 333 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:33] [INFO ] Deduced a trap composed of 36 places in 362 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:33] [INFO ] Deduced a trap composed of 36 places in 330 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:34] [INFO ] Deduced a trap composed of 38 places in 363 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:34] [INFO ] Deduced a trap composed of 38 places in 373 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:35] [INFO ] Deduced a trap composed of 38 places in 359 ms of which 40 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:35] [INFO ] Deduced a trap composed of 3 places in 333 ms of which 16 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:35] [INFO ] Deduced a trap composed of 3 places in 315 ms of which 16 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:36] [INFO ] Deduced a trap composed of 3 places in 336 ms of which 13 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:38:36] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 16 ms to minimize.
SMT process timed out in 30290ms, After SMT, problems are : Problem set: 51 solved, 319 unsolved
Search for dead transitions found 51 dead transitions in 30293ms
Found 51 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 51 transitions
Dead transitions reduction (with SMT) removed 51 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 391/448 places, 320/393 transitions.
Graph (complete) has 1345 edges and 391 vertex of which 351 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.10 ms
Discarding 40 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 171 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 350 transition count 326
Deduced a syphon composed of 171 places in 0 ms
Applied a total of 2 rules in 47 ms. Remains 350 /391 variables (removed 41) and now considering 326/320 (removed -6) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 350/448 places, 326/393 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30481 ms. Remains : 350/448 places, 326/393 transitions.
Built C files in :
/tmp/ltsmin15998063514253613135
[2025-05-30 06:38:36] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15998063514253613135
Running compilation step : cd /tmp/ltsmin15998063514253613135;'/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 1506 ms.
Running link step : cd /tmp/ltsmin15998063514253613135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin15998063514253613135;'/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/stateBased14589506518112379181.hoa' '--buchi-type=spotba'
LTSmin run took 255 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-13-LTLFireability-03 finished in 154243 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 p1) U X(X(X(p1)))))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 415/415 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 452 transition count 400
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 452 transition count 400
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 446 transition count 394
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 446 transition count 394
Applied a total of 42 rules in 48 ms. Remains 446 /467 variables (removed 21) and now considering 394/415 (removed 21) transitions.
// Phase 1: matrix 394 rows 446 cols
[2025-05-30 06:38:38] [INFO ] Computed 90 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:38:39] [INFO ] Implicit Places using invariants in 571 ms returned []
[2025-05-30 06:38:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:38:41] [INFO ] Implicit Places using invariants and state equation in 2286 ms returned []
Implicit Place search using SMT with State Equation took 2860 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2025-05-30 06:38:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:05] [INFO ] Deduced a trap composed of 77 places in 359 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:06] [INFO ] Deduced a trap composed of 77 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 06:39:06] [INFO ] Deduced a trap composed of 77 places in 330 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:06] [INFO ] Deduced a trap composed of 77 places in 309 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:07] [INFO ] Deduced a trap composed of 77 places in 324 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:07] [INFO ] Deduced a trap composed of 77 places in 323 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:07] [INFO ] Deduced a trap composed of 77 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 06:39:08] [INFO ] Deduced a trap composed of 77 places in 341 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:08] [INFO ] Deduced a trap composed of 77 places in 317 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:08] [INFO ] Deduced a trap composed of 77 places in 306 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:09] [INFO ] Deduced a trap composed of 77 places in 307 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:09] [INFO ] Deduced a trap composed of 77 places in 305 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:09] [INFO ] Deduced a trap composed of 77 places in 291 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:10] [INFO ] Deduced a trap composed of 76 places in 310 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:10] [INFO ] Deduced a trap composed of 76 places in 341 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:10] [INFO ] Deduced a trap composed of 76 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 06:39:11] [INFO ] Deduced a trap composed of 76 places in 341 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:11] [INFO ] Deduced a trap composed of 76 places in 323 ms of which 67 ms to minimize.
SMT process timed out in 30270ms, After SMT, problems are : Problem set: 0 solved, 393 unsolved
Search for dead transitions found 0 dead transitions in 30272ms
Starting structural reductions in LTL mode, iteration 1 : 446/467 places, 394/415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33181 ms. Remains : 446/467 places, 394/415 transitions.
Stuttering acceptance computed with spot in 722 ms :[(NOT p1), false, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-04
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-04 finished in 33945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((p1 U p2) U p3))))'
Support contains 6 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 415/415 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 452 transition count 400
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 452 transition count 400
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 446 transition count 394
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 446 transition count 394
Applied a total of 42 rules in 52 ms. Remains 446 /467 variables (removed 21) and now considering 394/415 (removed 21) transitions.
[2025-05-30 06:39:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:39:12] [INFO ] Implicit Places using invariants in 548 ms returned []
[2025-05-30 06:39:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:39:14] [INFO ] Implicit Places using invariants and state equation in 1543 ms returned []
Implicit Place search using SMT with State Equation took 2094 ms to find 0 implicit places.
Running 393 sub problems to find dead transitions.
[2025-05-30 06:39:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:37] [INFO ] Deduced a trap composed of 77 places in 358 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:38] [INFO ] Deduced a trap composed of 77 places in 329 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:38] [INFO ] Deduced a trap composed of 77 places in 362 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:38] [INFO ] Deduced a trap composed of 77 places in 328 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:39] [INFO ] Deduced a trap composed of 77 places in 343 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:39] [INFO ] Deduced a trap composed of 77 places in 334 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:39] [INFO ] Deduced a trap composed of 77 places in 300 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:40] [INFO ] Deduced a trap composed of 77 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 06:39:40] [INFO ] Deduced a trap composed of 77 places in 316 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:40] [INFO ] Deduced a trap composed of 77 places in 347 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:41] [INFO ] Deduced a trap composed of 77 places in 343 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:41] [INFO ] Deduced a trap composed of 77 places in 345 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:42] [INFO ] Deduced a trap composed of 77 places in 334 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:42] [INFO ] Deduced a trap composed of 76 places in 304 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:42] [INFO ] Deduced a trap composed of 76 places in 333 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:43] [INFO ] Deduced a trap composed of 76 places in 355 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:43] [INFO ] Deduced a trap composed of 76 places in 339 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:43] [INFO ] Deduced a trap composed of 76 places in 353 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:44] [INFO ] Deduced a trap composed of 77 places in 329 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:44] [INFO ] Deduced a trap composed of 77 places in 277 ms of which 52 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/840 variables, and 110 constraints, problems are : Problem set: 0 solved, 393 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 393/393 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 393 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 393 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 393 unsolved
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/110 constraints. Problems are: Problem set: 14 solved, 379 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:52] [INFO ] Deduced a trap composed of 74 places in 232 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:52] [INFO ] Deduced a trap composed of 69 places in 337 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:53] [INFO ] Deduced a trap composed of 74 places in 323 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:53] [INFO ] Deduced a trap composed of 74 places in 290 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:53] [INFO ] Deduced a trap composed of 74 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 06:39:54] [INFO ] Deduced a trap composed of 35 places in 339 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:54] [INFO ] Deduced a trap composed of 75 places in 350 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:55] [INFO ] Deduced a trap composed of 75 places in 359 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:55] [INFO ] Deduced a trap composed of 70 places in 332 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:56] [INFO ] Deduced a trap composed of 73 places in 353 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:56] [INFO ] Deduced a trap composed of 70 places in 360 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:57] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:57] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:57] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:58] [INFO ] Deduced a trap composed of 55 places in 302 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:58] [INFO ] Deduced a trap composed of 55 places in 279 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:58] [INFO ] Deduced a trap composed of 68 places in 314 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:59] [INFO ] Deduced a trap composed of 68 places in 322 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:39:59] [INFO ] Deduced a trap composed of 68 places in 318 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:00] [INFO ] Deduced a trap composed of 68 places in 315 ms of which 61 ms to minimize.
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD312 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 20/130 constraints. Problems are: Problem set: 17 solved, 376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:00] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:01] [INFO ] Deduced a trap composed of 76 places in 337 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:01] [INFO ] Deduced a trap composed of 76 places in 334 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:01] [INFO ] Deduced a trap composed of 76 places in 316 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:02] [INFO ] Deduced a trap composed of 76 places in 313 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:02] [INFO ] Deduced a trap composed of 76 places in 316 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:03] [INFO ] Deduced a trap composed of 76 places in 327 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:03] [INFO ] Deduced a trap composed of 76 places in 328 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:03] [INFO ] Deduced a trap composed of 76 places in 320 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:04] [INFO ] Deduced a trap composed of 76 places in 290 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:04] [INFO ] Deduced a trap composed of 76 places in 336 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:04] [INFO ] Deduced a trap composed of 70 places in 325 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:05] [INFO ] Deduced a trap composed of 70 places in 334 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:05] [INFO ] Deduced a trap composed of 70 places in 327 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:05] [INFO ] Deduced a trap composed of 70 places in 326 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:05] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:06] [INFO ] Deduced a trap composed of 53 places in 341 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:06] [INFO ] Deduced a trap composed of 53 places in 355 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:07] [INFO ] Deduced a trap composed of 55 places in 361 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:07] [INFO ] Deduced a trap composed of 55 places in 353 ms of which 79 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 20/150 constraints. Problems are: Problem set: 17 solved, 376 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:08] [INFO ] Deduced a trap composed of 76 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 06:40:08] [INFO ] Deduced a trap composed of 76 places in 332 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:08] [INFO ] Deduced a trap composed of 76 places in 320 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:09] [INFO ] Deduced a trap composed of 76 places in 322 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:09] [INFO ] Deduced a trap composed of 76 places in 329 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:10] [INFO ] Deduced a trap composed of 76 places in 363 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:10] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:10] [INFO ] Deduced a trap composed of 76 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 06:40:11] [INFO ] Deduced a trap composed of 70 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 06:40:11] [INFO ] Deduced a trap composed of 35 places in 336 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:12] [INFO ] Deduced a trap composed of 74 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 06:40:12] [INFO ] Deduced a trap composed of 71 places in 346 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:13] [INFO ] Deduced a trap composed of 13 places in 405 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:14] [INFO ] Deduced a trap composed of 14 places in 400 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:14] [INFO ] Deduced a trap composed of 33 places in 353 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:14] [INFO ] Deduced a trap composed of 35 places in 362 ms of which 34 ms to minimize.
SMT process timed out in 60246ms, After SMT, problems are : Problem set: 17 solved, 376 unsolved
Search for dead transitions found 17 dead transitions in 60248ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 446/467 places, 377/415 transitions.
Applied a total of 0 rules in 17 ms. Remains 446 /446 variables (removed 0) and now considering 377/377 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62415 ms. Remains : 446/467 places, 377/415 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-05
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-05 finished in 62755 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 U (p1||G(p2)))||X(X(F(p3)))))))'
Support contains 5 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 415/415 transitions.
Graph (trivial) has 219 edges and 467 vertex of which 6 / 467 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1043 edges and 462 vertex of which 461 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 461 transition count 356
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 409 transition count 356
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 106 place count 409 transition count 261
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 206 rules applied. Total rules applied 312 place count 298 transition count 261
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 324 place count 286 transition count 249
Iterating global reduction 2 with 12 rules applied. Total rules applied 336 place count 286 transition count 249
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 576 place count 164 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 578 place count 163 transition count 135
Applied a total of 578 rules in 71 ms. Remains 163 /467 variables (removed 304) and now considering 135/415 (removed 280) transitions.
// Phase 1: matrix 135 rows 163 cols
[2025-05-30 06:40:15] [INFO ] Computed 70 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:40:15] [INFO ] Implicit Places using invariants in 325 ms returned [1, 2, 3, 4, 8, 15, 16, 20, 21, 24, 25, 26, 27, 50, 51, 52, 53, 54]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 327 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/467 places, 135/415 transitions.
Applied a total of 0 rules in 8 ms. Remains 145 /145 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 407 ms. Remains : 145/467 places, 135/415 transitions.
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-07
Stuttering criterion allowed to conclude after 91665 steps with 15561 reset in 708 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-07 finished in 1416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(X(p1)))||(p2 U G(p3))))'
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 415/415 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 456 transition count 404
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 456 transition count 404
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 452 transition count 400
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 452 transition count 400
Applied a total of 30 rules in 33 ms. Remains 452 /467 variables (removed 15) and now considering 400/415 (removed 15) transitions.
// Phase 1: matrix 400 rows 452 cols
[2025-05-30 06:40:16] [INFO ] Computed 90 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:40:17] [INFO ] Implicit Places using invariants in 448 ms returned []
[2025-05-30 06:40:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:40:18] [INFO ] Implicit Places using invariants and state equation in 1738 ms returned []
Implicit Place search using SMT with State Equation took 2188 ms to find 0 implicit places.
Running 399 sub problems to find dead transitions.
[2025-05-30 06:40: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/451 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/451 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 1/452 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/452 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:43] [INFO ] Deduced a trap composed of 81 places in 367 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:43] [INFO ] Deduced a trap composed of 82 places in 349 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:44] [INFO ] Deduced a trap composed of 82 places in 352 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:44] [INFO ] Deduced a trap composed of 82 places in 351 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:44] [INFO ] Deduced a trap composed of 81 places in 346 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:45] [INFO ] Deduced a trap composed of 81 places in 402 ms of which 155 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:45] [INFO ] Deduced a trap composed of 81 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 06:40:46] [INFO ] Deduced a trap composed of 82 places in 328 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:46] [INFO ] Deduced a trap composed of 82 places in 334 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:46] [INFO ] Deduced a trap composed of 82 places in 325 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:47] [INFO ] Deduced a trap composed of 59 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 06:40:47] [INFO ] Deduced a trap composed of 15 places in 305 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:47] [INFO ] Deduced a trap composed of 80 places in 331 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:48] [INFO ] Deduced a trap composed of 81 places in 335 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:48] [INFO ] Deduced a trap composed of 81 places in 293 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:48] [INFO ] Deduced a trap composed of 81 places in 321 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:40:49] [INFO ] Deduced a trap composed of 82 places in 384 ms of which 109 ms to minimize.
SMT process timed out in 30372ms, After SMT, problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 30373ms
Starting structural reductions in LTL mode, iteration 1 : 452/467 places, 400/415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32595 ms. Remains : 452/467 places, 400/415 transitions.
Stuttering acceptance computed with spot in 1066 ms :[(AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), true, (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-08
Product exploration explored 100000 steps with 717 reset in 255 ms.
Stack based approach found an accepted trace after 19694 steps with 143 reset with depth 6 and stack size 6 in 104 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-08 finished in 34065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U (p1 U X(X(X(p2)))))))'
Support contains 3 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 415/415 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 455 transition count 403
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 455 transition count 403
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 450 transition count 398
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 450 transition count 398
Applied a total of 34 rules in 59 ms. Remains 450 /467 variables (removed 17) and now considering 398/415 (removed 17) transitions.
// Phase 1: matrix 398 rows 450 cols
[2025-05-30 06:40:50] [INFO ] Computed 90 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:40:51] [INFO ] Implicit Places using invariants in 613 ms returned []
[2025-05-30 06:40:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:40:53] [INFO ] Implicit Places using invariants and state equation in 1893 ms returned []
Implicit Place search using SMT with State Equation took 2508 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2025-05-30 06:40:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/449 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 1/450 variables, 53/89 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:17] [INFO ] Deduced a trap composed of 78 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 06:41:17] [INFO ] Deduced a trap composed of 78 places in 333 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:17] [INFO ] Deduced a trap composed of 78 places in 327 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:18] [INFO ] Deduced a trap composed of 78 places in 343 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:18] [INFO ] Deduced a trap composed of 78 places in 335 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:18] [INFO ] Deduced a trap composed of 77 places in 336 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:19] [INFO ] Deduced a trap composed of 77 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 06:41:19] [INFO ] Deduced a trap composed of 77 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 06:41:19] [INFO ] Deduced a trap composed of 77 places in 330 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:20] [INFO ] Deduced a trap composed of 25 places in 296 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:20] [INFO ] Deduced a trap composed of 77 places in 295 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:20] [INFO ] Deduced a trap composed of 77 places in 305 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:21] [INFO ] Deduced a trap composed of 36 places in 327 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:21] [INFO ] Deduced a trap composed of 79 places in 355 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:22] [INFO ] Deduced a trap composed of 79 places in 338 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:22] [INFO ] Deduced a trap composed of 79 places in 340 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:23] [INFO ] Deduced a trap composed of 79 places in 314 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:23] [INFO ] Deduced a trap composed of 79 places in 301 ms of which 70 ms to minimize.
SMT process timed out in 30156ms, After SMT, problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 30158ms
Starting structural reductions in LTL mode, iteration 1 : 450/467 places, 398/415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32727 ms. Remains : 450/467 places, 398/415 transitions.
Stuttering acceptance computed with spot in 706 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-09 finished in 33475 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 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 415/415 transitions.
Graph (trivial) has 224 edges and 467 vertex of which 6 / 467 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 1043 edges and 462 vertex of which 461 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 460 transition count 352
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 405 transition count 352
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 112 place count 405 transition count 256
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 321 place count 292 transition count 256
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 334 place count 279 transition count 243
Iterating global reduction 2 with 13 rules applied. Total rules applied 347 place count 279 transition count 243
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 579 place count 161 transition count 129
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 583 place count 159 transition count 132
Applied a total of 583 rules in 60 ms. Remains 159 /467 variables (removed 308) and now considering 132/415 (removed 283) transitions.
// Phase 1: matrix 132 rows 159 cols
[2025-05-30 06:41:24] [INFO ] Computed 69 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:41:24] [INFO ] Implicit Places using invariants in 386 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 46, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 387 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 140/467 places, 132/415 transitions.
Applied a total of 0 rules in 6 ms. Remains 140 /140 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 454 ms. Remains : 140/467 places, 132/415 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-10 finished in 524 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(G(p0))))'
Support contains 1 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 415/415 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 453 transition count 401
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 453 transition count 401
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 447 transition count 395
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 447 transition count 395
Applied a total of 40 rules in 54 ms. Remains 447 /467 variables (removed 20) and now considering 395/415 (removed 20) transitions.
// Phase 1: matrix 395 rows 447 cols
[2025-05-30 06:41:24] [INFO ] Computed 90 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:41:25] [INFO ] Implicit Places using invariants in 613 ms returned []
[2025-05-30 06:41:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:41:27] [INFO ] Implicit Places using invariants and state equation in 2109 ms returned []
Implicit Place search using SMT with State Equation took 2725 ms to find 0 implicit places.
Running 394 sub problems to find dead transitions.
[2025-05-30 06:41:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 1/447 variables, 52/88 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/447 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:51] [INFO ] Deduced a trap composed of 77 places in 352 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:51] [INFO ] Deduced a trap composed of 77 places in 318 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:52] [INFO ] Deduced a trap composed of 77 places in 338 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:52] [INFO ] Deduced a trap composed of 77 places in 352 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:52] [INFO ] Deduced a trap composed of 77 places in 344 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:53] [INFO ] Deduced a trap composed of 76 places in 325 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:53] [INFO ] Deduced a trap composed of 77 places in 364 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:53] [INFO ] Deduced a trap composed of 25 places in 324 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:54] [INFO ] Deduced a trap composed of 76 places in 354 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:54] [INFO ] Deduced a trap composed of 76 places in 352 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:55] [INFO ] Deduced a trap composed of 76 places in 348 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:55] [INFO ] Deduced a trap composed of 76 places in 313 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:55] [INFO ] Deduced a trap composed of 36 places in 348 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:56] [INFO ] Deduced a trap composed of 76 places in 359 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:56] [INFO ] Deduced a trap composed of 36 places in 363 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:57] [INFO ] Deduced a trap composed of 77 places in 350 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:57] [INFO ] Deduced a trap composed of 77 places in 342 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:41:57] [INFO ] Deduced a trap composed of 77 places in 351 ms of which 68 ms to minimize.
SMT process timed out in 30353ms, After SMT, problems are : Problem set: 0 solved, 394 unsolved
Search for dead transitions found 0 dead transitions in 30354ms
Starting structural reductions in LTL mode, iteration 1 : 447/467 places, 395/415 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33135 ms. Remains : 447/467 places, 395/415 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-14 finished in 33326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 467 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 467/467 places, 415/415 transitions.
Graph (trivial) has 222 edges and 467 vertex of which 6 / 467 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1043 edges and 462 vertex of which 461 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 460 transition count 353
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 406 transition count 353
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 110 place count 406 transition count 258
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 207 rules applied. Total rules applied 317 place count 294 transition count 258
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 328 place count 283 transition count 247
Iterating global reduction 2 with 11 rules applied. Total rules applied 339 place count 283 transition count 247
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 4 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 573 place count 164 transition count 132
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 577 place count 162 transition count 135
Applied a total of 577 rules in 57 ms. Remains 162 /467 variables (removed 305) and now considering 135/415 (removed 280) transitions.
// Phase 1: matrix 135 rows 162 cols
[2025-05-30 06:41:58] [INFO ] Computed 69 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:41:58] [INFO ] Implicit Places using invariants in 359 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 46, 47, 48, 49, 50]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 363 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/467 places, 135/415 transitions.
Applied a total of 0 rules in 6 ms. Remains 143 /143 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 426 ms. Remains : 143/467 places, 135/415 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-15 finished in 493 ms.
All properties solved by simple procedures.
Total runtime 408793 ms.

BK_STOP 1748587318494

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

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-13.tgz
mv BusinessProcesses-PT-13 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;