About the Execution of ITS-Tools for BusinessProcesses-PT-19
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFFFTTTFTFFFFF? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813400148.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-19, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813400148
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 189K 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-19-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748617188132
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-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 14:59:50] [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 14:59:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 14:59:51] [INFO ] Load time of PNML (sax parser for PT used): 261 ms
[2025-05-30 14:59:51] [INFO ] Transformed 772 places.
[2025-05-30 14:59:51] [INFO ] Transformed 685 transitions.
[2025-05-30 14:59:51] [INFO ] Found NUPN structural information;
[2025-05-30 14:59:51] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 692 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 15 places in 31 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 100 places :
Symmetric choice reduction at 1 with 100 rule applications. Total rules 108 place count 649 transition count 570
Iterating global reduction 1 with 100 rules applied. Total rules applied 208 place count 649 transition count 570
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 259 place count 598 transition count 519
Iterating global reduction 1 with 51 rules applied. Total rules applied 310 place count 598 transition count 519
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 311 place count 597 transition count 518
Iterating global reduction 1 with 1 rules applied. Total rules applied 312 place count 597 transition count 518
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 313 place count 596 transition count 517
Iterating global reduction 1 with 1 rules applied. Total rules applied 314 place count 596 transition count 517
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 315 place count 595 transition count 516
Iterating global reduction 1 with 1 rules applied. Total rules applied 316 place count 595 transition count 516
Applied a total of 316 rules in 496 ms. Remains 595 /757 variables (removed 162) and now considering 516/670 (removed 154) transitions.
// Phase 1: matrix 516 rows 595 cols
[2025-05-30 14:59:52] [INFO ] Computed 117 invariants in 76 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:59:53] [INFO ] Implicit Places using invariants in 1493 ms returned []
[2025-05-30 14:59:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 14:59:58] [INFO ] Implicit Places using invariants and state equation in 4478 ms returned []
Implicit Place search using SMT with State Equation took 6046 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2025-05-30 14:59:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 1/595 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/595 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 595/1111 variables, and 117 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/595 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/594 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/594 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 1/595 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/595 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:49] [INFO ] Deduced a trap composed of 82 places in 467 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:50] [INFO ] Deduced a trap composed of 82 places in 525 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:50] [INFO ] Deduced a trap composed of 82 places in 519 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:50] [INFO ] Deduced a trap composed of 81 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 15:00:51] [INFO ] Deduced a trap composed of 81 places in 458 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:51] [INFO ] Deduced a trap composed of 81 places in 452 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:52] [INFO ] Deduced a trap composed of 80 places in 431 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:52] [INFO ] Deduced a trap composed of 80 places in 484 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:53] [INFO ] Deduced a trap composed of 80 places in 472 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:53] [INFO ] Deduced a trap composed of 80 places in 472 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:54] [INFO ] Deduced a trap composed of 80 places in 396 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:54] [INFO ] Deduced a trap composed of 81 places in 492 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:55] [INFO ] Deduced a trap composed of 81 places in 495 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:55] [INFO ] Deduced a trap composed of 81 places in 471 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:56] [INFO ] Deduced a trap composed of 81 places in 462 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:56] [INFO ] Deduced a trap composed of 81 places in 452 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:57] [INFO ] Deduced a trap composed of 81 places in 463 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:57] [INFO ] Deduced a trap composed of 81 places in 491 ms of which 112 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:58] [INFO ] Deduced a trap composed of 81 places in 485 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:00:58] [INFO ] Deduced a trap composed of 81 places in 467 ms of which 96 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 595/1111 variables, and 137 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/595 constraints, PredecessorRefiner: 0/515 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60443ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60473ms
Starting structural reductions in LTL mode, iteration 1 : 595/757 places, 516/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67057 ms. Remains : 595/757 places, 516/670 transitions.
Support contains 42 out of 595 places after structural reductions.
[2025-05-30 15:00:59] [INFO ] Flatten gal took : 152 ms
[2025-05-30 15:00:59] [INFO ] Flatten gal took : 83 ms
[2025-05-30 15:00:59] [INFO ] Input system was already deterministic with 516 transitions.
RANDOM walk for 40000 steps (218 resets) in 2216 ms. (18 steps per ms) remains 24/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
[2025-05-30 15:01:00] [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/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 207/239 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 209/448 variables, 51/70 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 134/582 variables, 46/116 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:01] [INFO ] Deduced a trap composed of 8 places in 320 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:02] [INFO ] Deduced a trap composed of 13 places in 498 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:02] [INFO ] Deduced a trap composed of 13 places in 329 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:03] [INFO ] Deduced a trap composed of 17 places in 366 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:03] [INFO ] Deduced a trap composed of 27 places in 511 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:04] [INFO ] Deduced a trap composed of 32 places in 512 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:04] [INFO ] Deduced a trap composed of 34 places in 512 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:05] [INFO ] Deduced a trap composed of 34 places in 494 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:05] [INFO ] Deduced a trap composed of 36 places in 524 ms of which 76 ms to minimize.
SMT process timed out in 5068ms, After SMT, problems are : Problem set: 0 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 516/516 transitions.
Graph (complete) has 1317 edges and 595 vertex of which 594 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 594 transition count 454
Reduce places removed 61 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 533 transition count 450
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 131 place count 529 transition count 450
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 131 place count 529 transition count 342
Deduced a syphon composed of 108 places in 2 ms
Ensure Unique test removed 18 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 365 place count 403 transition count 342
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 368 place count 400 transition count 339
Iterating global reduction 3 with 3 rules applied. Total rules applied 371 place count 400 transition count 339
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 155
Deduced a syphon composed of 155 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 314 rules applied. Total rules applied 685 place count 241 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 686 place count 241 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 688 place count 240 transition count 186
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 697 place count 240 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 698 place count 239 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 699 place count 238 transition count 185
Applied a total of 699 rules in 278 ms. Remains 238 /595 variables (removed 357) and now considering 185/516 (removed 331) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 278 ms. Remains : 238/595 places, 185/516 transitions.
RANDOM walk for 40000 steps (3249 resets) in 1544 ms. (25 steps per ms) remains 16/24 properties
BEST_FIRST walk for 4003 steps (72 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (57 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (78 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (82 resets) in 36 ms. (108 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (69 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (73 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (78 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (73 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (72 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (75 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (71 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (72 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (70 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (75 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (65 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (55 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
// Phase 1: matrix 185 rows 238 cols
[2025-05-30 15:01:06] [INFO ] Computed 94 invariants in 8 ms
[2025-05-30 15:01:06] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 83/106 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:06] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 26/132 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:07] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 48/180 variables, 24/66 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:07] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 18 ms to minimize.
Problem AtomicPropp7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:07] [INFO ] Deduced a trap composed of 50 places in 139 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 2/68 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 15:01:07] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 17 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 1/69 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/180 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 7/187 variables, 7/76 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 184/371 variables, 187/263 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/371 variables, 4/267 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/371 variables, 0/267 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 52/423 variables, 51/318 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/423 variables, 23/341 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/423 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 0/423 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 341 constraints, problems are : Problem set: 1 solved, 15 unsolved in 2720 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/238 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.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) 83/105 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 2/18 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 26/131 variables, 24/42 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/42 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 48/179 variables, 23/65 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 3/68 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 15:01:09] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:10] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 2/70 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 15:01:10] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:10] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:10] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:10] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:11] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:11] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:11] [INFO ] Deduced a trap composed of 53 places in 175 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:11] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:11] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:11] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:12] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:12] [INFO ] Deduced a trap composed of 52 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:12] [INFO ] Deduced a trap composed of 52 places in 144 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:12] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:12] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:12] [INFO ] Deduced a trap composed of 53 places in 168 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:13] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:13] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 22 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 18/88 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/179 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 7/186 variables, 7/95 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 1/187 variables, 1/96 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/187 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 184/371 variables, 187/283 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/371 variables, 4/287 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/371 variables, 11/298 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/371 variables, 0/298 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 19 (OVERLAPS) 52/423 variables, 51/349 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/423 variables, 23/372 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/423 variables, 4/376 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 15:01:15] [INFO ] Deduced a trap composed of 6 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 15:01:16] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:16] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:17] [INFO ] Deduced a trap composed of 51 places in 230 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:17] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:17] [INFO ] Deduced a trap composed of 50 places in 208 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:17] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:18] [INFO ] Deduced a trap composed of 51 places in 208 ms of which 28 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/423 variables, 8/384 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 15:01:19] [INFO ] Deduced a trap along path composed of 3 places in 41 ms of which 5 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/423 variables, 1/385 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 15:01:21] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:21] [INFO ] Deduced a trap composed of 51 places in 209 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:22] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:22] [INFO ] Deduced a trap composed of 51 places in 222 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:01:22] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 27 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/423 variables, 5/390 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/423 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 26 (OVERLAPS) 0/423 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 390 constraints, problems are : Problem set: 1 solved, 15 unsolved in 17128 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 238/238 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 15/16 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 19874ms problems are : Problem set: 1 solved, 15 unsolved
Parikh walk visited 13 properties in 1975 ms.
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 185/185 transitions.
Graph (trivial) has 33 edges and 238 vertex of which 2 / 238 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 237 transition count 177
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 231 transition count 177
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 13 place count 231 transition count 164
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 44 place count 213 transition count 164
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 210 transition count 161
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 210 transition count 161
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 19 rules applied. Total rules applied 69 place count 200 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 200 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 198 transition count 150
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 74 place count 198 transition count 150
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 197 transition count 149
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 197 transition count 149
Applied a total of 76 rules in 67 ms. Remains 197 /238 variables (removed 41) and now considering 149/185 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 197/238 places, 149/185 transitions.
RANDOM walk for 599 steps (28 resets) in 8 ms. (66 steps per ms) remains 0/2 properties
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-19-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 537 stabilizing places and 468 stable transitions
Graph (complete) has 1317 edges and 595 vertex of which 594 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.54 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((X(G(p0)) U (p1||X(X(X(F(!p1))))))))'
Support contains 2 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 516/516 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 582 transition count 503
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 582 transition count 503
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 578 transition count 499
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 578 transition count 499
Applied a total of 34 rules in 77 ms. Remains 578 /595 variables (removed 17) and now considering 499/516 (removed 17) transitions.
// Phase 1: matrix 499 rows 578 cols
[2025-05-30 15:01:29] [INFO ] Computed 117 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:01:30] [INFO ] Implicit Places using invariants in 787 ms returned []
[2025-05-30 15:01:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:01:34] [INFO ] Implicit Places using invariants and state equation in 3836 ms returned []
Implicit Place search using SMT with State Equation took 4625 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2025-05-30 15:01:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 0.0)
(s313 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/1077 variables, and 117 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/578 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:23] [INFO ] Deduced a trap composed of 74 places in 435 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:23] [INFO ] Deduced a trap composed of 74 places in 426 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:24] [INFO ] Deduced a trap composed of 93 places in 439 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:24] [INFO ] Deduced a trap composed of 95 places in 539 ms of which 189 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:25] [INFO ] Deduced a trap composed of 95 places in 460 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:25] [INFO ] Deduced a trap composed of 95 places in 482 ms of which 133 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:26] [INFO ] Deduced a trap composed of 95 places in 448 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:26] [INFO ] Deduced a trap composed of 95 places in 467 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:27] [INFO ] Deduced a trap composed of 95 places in 440 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:27] [INFO ] Deduced a trap composed of 95 places in 460 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:28] [INFO ] Deduced a trap composed of 95 places in 457 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:28] [INFO ] Deduced a trap composed of 93 places in 504 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:29] [INFO ] Deduced a trap composed of 93 places in 482 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:29] [INFO ] Deduced a trap composed of 88 places in 492 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:30] [INFO ] Deduced a trap composed of 88 places in 461 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:30] [INFO ] Deduced a trap composed of 74 places in 471 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:31] [INFO ] Deduced a trap composed of 74 places in 464 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:32] [INFO ] Deduced a trap composed of 88 places in 1290 ms of which 918 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:33] [INFO ] Deduced a trap composed of 88 places in 349 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:33] [INFO ] Deduced a trap composed of 74 places in 443 ms of which 99 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:02:34] [INFO ] Deduced a trap composed of 75 places in 439 ms of which 86 ms to minimize.
SMT process timed out in 60501ms, After SMT, problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60508ms
Starting structural reductions in LTL mode, iteration 1 : 578/595 places, 499/516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65213 ms. Remains : 578/595 places, 499/516 transitions.
Stuttering acceptance computed with spot in 551 ms :[false, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-00
Product exploration explored 100000 steps with 19946 reset in 593 ms.
Product exploration explored 100000 steps with 19955 reset in 481 ms.
Computed a total of 521 stabilizing places and 452 stable transitions
Graph (complete) has 1293 edges and 578 vertex of which 577 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.19 ms
Computed a total of 521 stabilizing places and 452 stable transitions
Detected a total of 521/578 stabilizing places and 452/499 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 237 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[false, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
RANDOM walk for 3737 steps (19 resets) in 39 ms. (93 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 419 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[false, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 307 ms :[false, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Support contains 2 out of 578 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 499/499 transitions.
Applied a total of 0 rules in 33 ms. Remains 578 /578 variables (removed 0) and now considering 499/499 (removed 0) transitions.
[2025-05-30 15:02:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:02:38] [INFO ] Implicit Places using invariants in 879 ms returned []
[2025-05-30 15:02:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:02:43] [INFO ] Implicit Places using invariants and state equation in 4264 ms returned []
Implicit Place search using SMT with State Equation took 5149 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2025-05-30 15:02:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/1077 variables, and 117 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/578 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:31] [INFO ] Deduced a trap composed of 74 places in 327 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:32] [INFO ] Deduced a trap composed of 74 places in 417 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:32] [INFO ] Deduced a trap composed of 93 places in 431 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:33] [INFO ] Deduced a trap composed of 95 places in 528 ms of which 188 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:33] [INFO ] Deduced a trap composed of 95 places in 454 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:34] [INFO ] Deduced a trap composed of 95 places in 479 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:34] [INFO ] Deduced a trap composed of 95 places in 422 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:35] [INFO ] Deduced a trap composed of 95 places in 458 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:35] [INFO ] Deduced a trap composed of 95 places in 408 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:36] [INFO ] Deduced a trap composed of 95 places in 453 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:36] [INFO ] Deduced a trap composed of 95 places in 454 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:37] [INFO ] Deduced a trap composed of 93 places in 500 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:37] [INFO ] Deduced a trap composed of 93 places in 467 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:38] [INFO ] Deduced a trap composed of 88 places in 478 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:38] [INFO ] Deduced a trap composed of 88 places in 453 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:39] [INFO ] Deduced a trap composed of 74 places in 478 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:39] [INFO ] Deduced a trap composed of 74 places in 454 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:40] [INFO ] Deduced a trap composed of 88 places in 1306 ms of which 977 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:41] [INFO ] Deduced a trap composed of 88 places in 338 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:41] [INFO ] Deduced a trap composed of 74 places in 454 ms of which 96 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:42] [INFO ] Deduced a trap composed of 75 places in 429 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:03:43] [INFO ] Deduced a trap composed of 75 places in 421 ms of which 89 ms to minimize.
SMT process timed out in 60349ms, After SMT, problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60352ms
Finished structural reductions in LTL mode , in 1 iterations and 65538 ms. Remains : 578/578 places, 499/499 transitions.
Computed a total of 521 stabilizing places and 452 stable transitions
Graph (complete) has 1293 edges and 578 vertex of which 577 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 ms
Computed a total of 521 stabilizing places and 452 stable transitions
Detected a total of 521/578 stabilizing places and 452/499 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 241 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[false, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
RANDOM walk for 2351 steps (11 resets) in 34 ms. (67 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 479 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 311 ms :[false, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 305 ms :[false, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 305 ms :[false, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 19937 reset in 231 ms.
Product exploration explored 100000 steps with 19975 reset in 359 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 292 ms :[false, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Support contains 2 out of 578 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 578/578 places, 499/499 transitions.
Graph (trivial) has 269 edges and 578 vertex of which 6 / 578 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 1287 edges and 573 vertex of which 572 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
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 572 transition count 492
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 65 place count 572 transition count 559
Deduced a syphon composed of 151 places in 1 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 153 place count 572 transition count 559
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 175 place count 550 transition count 518
Deduced a syphon composed of 129 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 197 place count 550 transition count 518
Performed 191 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 320 places in 1 ms
Iterating global reduction 1 with 191 rules applied. Total rules applied 388 place count 550 transition count 518
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 435 place count 503 transition count 471
Deduced a syphon composed of 273 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 482 place count 503 transition count 471
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 274 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 483 place count 503 transition count 484
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 484 place count 502 transition count 482
Deduced a syphon composed of 273 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 485 place count 502 transition count 482
Deduced a syphon composed of 273 places in 0 ms
Applied a total of 485 rules in 276 ms. Remains 502 /578 variables (removed 76) and now considering 482/499 (removed 17) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 15:03:47] [INFO ] Redundant transitions in 61 ms returned []
Running 481 sub problems to find dead transitions.
// Phase 1: matrix 482 rows 502 cols
[2025-05-30 15:03:47] [INFO ] Computed 117 invariants in 23 ms
[2025-05-30 15:03:47] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 71/116 constraints. Problems are: Problem set: 0 solved, 481 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 481 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:04:18] [INFO ] Deduced a trap composed of 4 places in 459 ms of which 22 ms to minimize.
SMT process timed out in 30872ms, After SMT, problems are : Problem set: 0 solved, 481 unsolved
Search for dead transitions found 0 dead transitions in 30876ms
Starting structural reductions in SI_LTL mode, iteration 1 : 502/578 places, 482/499 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31224 ms. Remains : 502/578 places, 482/499 transitions.
Built C files in :
/tmp/ltsmin14301767442263754703
[2025-05-30 15:04:18] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14301767442263754703
Running compilation step : cd /tmp/ltsmin14301767442263754703;'/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 1939 ms.
Running link step : cd /tmp/ltsmin14301767442263754703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin14301767442263754703;'/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/stateBased8174546000402922399.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 578 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 578/578 places, 499/499 transitions.
Applied a total of 0 rules in 13 ms. Remains 578 /578 variables (removed 0) and now considering 499/499 (removed 0) transitions.
// Phase 1: matrix 499 rows 578 cols
[2025-05-30 15:04:33] [INFO ] Computed 117 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:04:33] [INFO ] Implicit Places using invariants in 692 ms returned []
[2025-05-30 15:04:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:04:37] [INFO ] Implicit Places using invariants and state equation in 3653 ms returned []
Implicit Place search using SMT with State Equation took 4353 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2025-05-30 15:04:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 578/1077 variables, and 117 constraints, problems are : Problem set: 0 solved, 498 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/578 constraints, PredecessorRefiner: 498/498 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:27] [INFO ] Deduced a trap composed of 74 places in 404 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:27] [INFO ] Deduced a trap composed of 74 places in 387 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:27] [INFO ] Deduced a trap composed of 93 places in 391 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:28] [INFO ] Deduced a trap composed of 95 places in 437 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:28] [INFO ] Deduced a trap composed of 95 places in 378 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:29] [INFO ] Deduced a trap composed of 95 places in 379 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:29] [INFO ] Deduced a trap composed of 95 places in 395 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:30] [INFO ] Deduced a trap composed of 95 places in 445 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:30] [INFO ] Deduced a trap composed of 95 places in 426 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:30] [INFO ] Deduced a trap composed of 95 places in 441 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:31] [INFO ] Deduced a trap composed of 95 places in 302 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:31] [INFO ] Deduced a trap composed of 93 places in 286 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:32] [INFO ] Deduced a trap composed of 93 places in 410 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:32] [INFO ] Deduced a trap composed of 88 places in 402 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:32] [INFO ] Deduced a trap composed of 88 places in 422 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:33] [INFO ] Deduced a trap composed of 74 places in 454 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:33] [INFO ] Deduced a trap composed of 74 places in 428 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:35] [INFO ] Deduced a trap composed of 88 places in 1202 ms of which 876 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:35] [INFO ] Deduced a trap composed of 88 places in 431 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:35] [INFO ] Deduced a trap composed of 74 places in 396 ms of which 84 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 498 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:36] [INFO ] Deduced a trap composed of 75 places in 338 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:37] [INFO ] Deduced a trap composed of 75 places in 342 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:37] [INFO ] Deduced a trap composed of 75 places in 327 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:05:38] [INFO ] Deduced a trap composed of 96 places in 394 ms of which 92 ms to minimize.
SMT process timed out in 60492ms, After SMT, problems are : Problem set: 0 solved, 498 unsolved
Search for dead transitions found 0 dead transitions in 60494ms
Finished structural reductions in LTL mode , in 1 iterations and 64863 ms. Remains : 578/578 places, 499/499 transitions.
Built C files in :
/tmp/ltsmin13328432737494183645
[2025-05-30 15:05:38] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13328432737494183645
Running compilation step : cd /tmp/ltsmin13328432737494183645;'/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 1461 ms.
Running link step : cd /tmp/ltsmin13328432737494183645;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13328432737494183645;'/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/stateBased5526053117775227574.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 15:05:53] [INFO ] Flatten gal took : 38 ms
[2025-05-30 15:05:53] [INFO ] Flatten gal took : 33 ms
[2025-05-30 15:05:53] [INFO ] Time to serialize gal into /tmp/LTL14930806816585850657.gal : 8 ms
[2025-05-30 15:05:53] [INFO ] Time to serialize properties into /tmp/LTL279403044238356834.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14930806816585850657.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1655874035597985964.hoa' '-atoms' '/tmp/LTL279403044238356834.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL279403044238356834.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1655874035597985964.hoa
Detected timeout of ITS tools.
[2025-05-30 15:06:08] [INFO ] Flatten gal took : 33 ms
[2025-05-30 15:06:08] [INFO ] Flatten gal took : 32 ms
[2025-05-30 15:06:08] [INFO ] Time to serialize gal into /tmp/LTL9374794839161176174.gal : 6 ms
[2025-05-30 15:06:08] [INFO ] Time to serialize properties into /tmp/LTL12076797464212795530.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9374794839161176174.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12076797464212795530.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(G("(p18==1)")))U(("(p470==1)")||(X(X(X(F("(p470!=1)")))))))))
Formula 0 simplified : F(XF!"(p18==1)" R (!"(p470==1)" & XXXG!"(p470!=1)"))
Detected timeout of ITS tools.
[2025-05-30 15:06:23] [INFO ] Flatten gal took : 28 ms
[2025-05-30 15:06:23] [INFO ] Applying decomposition
[2025-05-30 15:06:23] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph599765417322142190.txt' '-o' '/tmp/graph599765417322142190.bin' '-w' '/tmp/graph599765417322142190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph599765417322142190.bin' '-l' '-1' '-v' '-w' '/tmp/graph599765417322142190.weights' '-q' '0' '-e' '0.001'
[2025-05-30 15:06:23] [INFO ] Decomposing Gal with order
[2025-05-30 15:06:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 15:06:24] [INFO ] Removed a total of 286 redundant transitions.
[2025-05-30 15:06:24] [INFO ] Flatten gal took : 115 ms
[2025-05-30 15:06:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 42 ms.
[2025-05-30 15:06:24] [INFO ] Time to serialize gal into /tmp/LTL10921915221314809522.gal : 25 ms
[2025-05-30 15:06:24] [INFO ] Time to serialize properties into /tmp/LTL16348659603208907555.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10921915221314809522.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16348659603208907555.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G((X(G("(i0.i1.u8.p18==1)")))U(("(i6.i1.u139.p470==1)")||(X(X(X(F("(i6.i1.u139.p470!=1)")))))))))
Formula 0 simplified : F(XF!"(i0.i1.u8.p18==1)" R (!"(i6.i1.u139.p470==1)" & XXXG!"(i6.i1.u139.p470!=1)"))
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-19-LTLFireability-00 finished in 309963 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&&F(G(p1))) U (F(p2) U X(X(!p0)))))'
Support contains 5 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 516/516 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 583 transition count 504
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 583 transition count 504
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 579 transition count 500
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 579 transition count 500
Applied a total of 32 rules in 60 ms. Remains 579 /595 variables (removed 16) and now considering 500/516 (removed 16) transitions.
// Phase 1: matrix 500 rows 579 cols
[2025-05-30 15:06:39] [INFO ] Computed 117 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:06:40] [INFO ] Implicit Places using invariants in 871 ms returned []
[2025-05-30 15:06:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:06:43] [INFO ] Implicit Places using invariants and state equation in 3316 ms returned []
Implicit Place search using SMT with State Equation took 4189 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2025-05-30 15:06:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/1079 variables, and 117 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/579 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:32] [INFO ] Deduced a trap composed of 74 places in 438 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:33] [INFO ] Deduced a trap composed of 74 places in 402 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:33] [INFO ] Deduced a trap composed of 74 places in 381 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:34] [INFO ] Deduced a trap composed of 75 places in 377 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:34] [INFO ] Deduced a trap composed of 75 places in 418 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:35] [INFO ] Deduced a trap composed of 75 places in 389 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:35] [INFO ] Deduced a trap composed of 75 places in 401 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:35] [INFO ] Deduced a trap composed of 75 places in 352 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:36] [INFO ] Deduced a trap composed of 39 places in 361 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:36] [INFO ] Deduced a trap composed of 95 places in 356 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:36] [INFO ] Deduced a trap composed of 95 places in 259 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:37] [INFO ] Deduced a trap composed of 74 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 15:07:37] [INFO ] Deduced a trap composed of 74 places in 382 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:38] [INFO ] Deduced a trap composed of 74 places in 447 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:38] [INFO ] Deduced a trap composed of 74 places in 431 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:39] [INFO ] Deduced a trap composed of 74 places in 437 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:39] [INFO ] Deduced a trap composed of 74 places in 462 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:40] [INFO ] Deduced a trap composed of 74 places in 403 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:40] [INFO ] Deduced a trap composed of 74 places in 402 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:40] [INFO ] Deduced a trap composed of 75 places in 353 ms of which 57 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:41] [INFO ] Deduced a trap composed of 95 places in 431 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:42] [INFO ] Deduced a trap composed of 95 places in 461 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:42] [INFO ] Deduced a trap composed of 95 places in 308 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:43] [INFO ] Deduced a trap composed of 95 places in 463 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:43] [INFO ] Deduced a trap composed of 95 places in 439 ms of which 97 ms to minimize.
SMT process timed out in 60247ms, After SMT, problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 60250ms
Starting structural reductions in LTL mode, iteration 1 : 579/595 places, 500/516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64502 ms. Remains : 579/595 places, 500/516 transitions.
Stuttering acceptance computed with spot in 714 ms :[p0, (AND (NOT p2) p0), p0, (AND (NOT p2) p0 (NOT p1)), p0, (AND (NOT p2) p0), (AND (NOT p2) p0), p0, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), p0, (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-01
Product exploration explored 100000 steps with 649 reset in 607 ms.
Product exploration explored 100000 steps with 662 reset in 360 ms.
Computed a total of 522 stabilizing places and 453 stable transitions
Graph (complete) has 1294 edges and 579 vertex of which 578 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 522 stabilizing places and 453 stable transitions
Detected a total of 522/579 stabilizing places and 453/500 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p0), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 1227 ms. Reduced automaton from 13 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[p0, p0, (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), p0, (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (217 resets) in 287 ms. (138 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40002 steps (37 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (38 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
[2025-05-30 15:07:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 158/162 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 263/425 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 139/564 variables, 44/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/567 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 492/1059 variables, 567/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1059 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/1076 variables, 9/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1076 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 3/1079 variables, 3/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1079 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1079 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 696 constraints, problems are : Problem set: 0 solved, 2 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 579/579 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 158/162 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 263/425 variables, 65/70 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 15:07:48] [INFO ] Deduced a trap composed of 12 places in 358 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:49] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:49] [INFO ] Deduced a trap composed of 18 places in 341 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:49] [INFO ] Deduced a trap composed of 28 places in 356 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:50] [INFO ] Deduced a trap composed of 29 places in 356 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:50] [INFO ] Deduced a trap composed of 30 places in 359 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:50] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:50] [INFO ] Deduced a trap composed of 31 places in 181 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:51] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:51] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 10/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 139/564 variables, 44/124 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 15:07:51] [INFO ] Deduced a trap composed of 41 places in 292 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:52] [INFO ] Deduced a trap composed of 44 places in 283 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:52] [INFO ] Deduced a trap composed of 72 places in 556 ms of which 109 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:07:53] [INFO ] Deduced a trap composed of 72 places in 522 ms of which 92 ms to minimize.
SMT process timed out in 6030ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 579 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 579/579 places, 500/500 transitions.
Graph (trivial) has 267 edges and 579 vertex of which 6 / 579 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 1287 edges and 574 vertex of which 573 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 573 transition count 428
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 509 transition count 428
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 121 Pre rules applied. Total rules applied 130 place count 509 transition count 307
Deduced a syphon composed of 121 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 396 place count 364 transition count 307
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 2 with 323 rules applied. Total rules applied 719 place count 200 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 721 place count 199 transition count 151
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 723 place count 199 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 725 place count 197 transition count 149
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 726 place count 197 transition count 149
Applied a total of 726 rules in 113 ms. Remains 197 /579 variables (removed 382) and now considering 149/500 (removed 351) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 197/579 places, 149/500 transitions.
RANDOM walk for 312 steps (14 resets) in 8 ms. (34 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p0), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p2 p1))), (F p2), (F (NOT p0)), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 11 factoid took 3935 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[p0, p0, (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), p0, (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 341 ms :[p0, p0, (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), p0, (AND (NOT p2) (NOT p1))]
[2025-05-30 15:07:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 15:07:58] [INFO ] [Real]Absence check using 70 positive place invariants in 323 ms returned sat
[2025-05-30 15:07:59] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 353 ms returned sat
[2025-05-30 15:08:11] [INFO ] [Real]Absence check using state equation in 12355 ms returned sat
[2025-05-30 15:08:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 15:08:12] [INFO ] [Nat]Absence check using 70 positive place invariants in 134 ms returned sat
[2025-05-30 15:08:12] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 209 ms returned sat
[2025-05-30 15:08:26] [INFO ] [Nat]Absence check using state equation in 13714 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:08:26] [INFO ] Deduced a trap composed of 8 places in 464 ms of which 23 ms to minimize.
[2025-05-30 15:08:26] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 570 ms
Could not prove EG p0
Support contains 5 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 500/500 transitions.
Applied a total of 0 rules in 28 ms. Remains 579 /579 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2025-05-30 15:08:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:08:27] [INFO ] Implicit Places using invariants in 879 ms returned []
[2025-05-30 15:08:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:08:30] [INFO ] Implicit Places using invariants and state equation in 2909 ms returned []
Implicit Place search using SMT with State Equation took 3790 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2025-05-30 15:08:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/1079 variables, and 117 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/579 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:18] [INFO ] Deduced a trap composed of 74 places in 378 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:19] [INFO ] Deduced a trap composed of 74 places in 409 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:19] [INFO ] Deduced a trap composed of 74 places in 411 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:20] [INFO ] Deduced a trap composed of 75 places in 402 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:20] [INFO ] Deduced a trap composed of 75 places in 436 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:21] [INFO ] Deduced a trap composed of 75 places in 417 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:21] [INFO ] Deduced a trap composed of 75 places in 433 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:21] [INFO ] Deduced a trap composed of 75 places in 390 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:22] [INFO ] Deduced a trap composed of 39 places in 399 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:22] [INFO ] Deduced a trap composed of 95 places in 406 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:23] [INFO ] Deduced a trap composed of 95 places in 407 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:23] [INFO ] Deduced a trap composed of 74 places in 453 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:24] [INFO ] Deduced a trap composed of 74 places in 456 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:24] [INFO ] Deduced a trap composed of 74 places in 440 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:25] [INFO ] Deduced a trap composed of 74 places in 429 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:25] [INFO ] Deduced a trap composed of 74 places in 447 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:26] [INFO ] Deduced a trap composed of 74 places in 442 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:26] [INFO ] Deduced a trap composed of 74 places in 447 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:26] [INFO ] Deduced a trap composed of 74 places in 421 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:27] [INFO ] Deduced a trap composed of 75 places in 455 ms of which 93 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:28] [INFO ] Deduced a trap composed of 95 places in 388 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:29] [INFO ] Deduced a trap composed of 95 places in 456 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:29] [INFO ] Deduced a trap composed of 95 places in 416 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:29] [INFO ] Deduced a trap composed of 95 places in 416 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:30] [INFO ] Deduced a trap composed of 95 places in 376 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:30] [INFO ] Deduced a trap composed of 75 places in 382 ms of which 73 ms to minimize.
SMT process timed out in 60365ms, After SMT, problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 60366ms
Finished structural reductions in LTL mode , in 1 iterations and 64188 ms. Remains : 579/579 places, 500/500 transitions.
Computed a total of 522 stabilizing places and 453 stable transitions
Graph (complete) has 1294 edges and 579 vertex of which 578 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 522 stabilizing places and 453 stable transitions
Detected a total of 522/579 stabilizing places and 453/500 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 641 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[p0, p0, (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), p0, (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (218 resets) in 399 ms. (100 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (37 resets) in 157 ms. (253 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 290 ms. (137 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (37 resets) in 279 ms. (142 steps per ms) remains 4/4 properties
[2025-05-30 15:09:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 158/162 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 263/425 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:32] [INFO ] Deduced a trap composed of 8 places in 278 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:33] [INFO ] Deduced a trap composed of 15 places in 289 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:33] [INFO ] Deduced a trap composed of 25 places in 302 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:33] [INFO ] Deduced a trap composed of 26 places in 296 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:34] [INFO ] Deduced a trap composed of 27 places in 308 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:34] [INFO ] Deduced a trap composed of 29 places in 299 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:34] [INFO ] Deduced a trap composed of 31 places in 304 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:35] [INFO ] Deduced a trap composed of 32 places in 302 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:35] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:35] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:36] [INFO ] Deduced a trap composed of 38 places in 293 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:36] [INFO ] Deduced a trap composed of 85 places in 275 ms of which 32 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 139/564 variables, 44/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:36] [INFO ] Deduced a trap composed of 43 places in 160 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:09:36] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 20 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/567 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SMT process timed out in 5016ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 579 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 579/579 places, 500/500 transitions.
Graph (trivial) has 267 edges and 579 vertex of which 6 / 579 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 1287 edges and 574 vertex of which 573 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 573 transition count 428
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 509 transition count 428
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 121 Pre rules applied. Total rules applied 130 place count 509 transition count 307
Deduced a syphon composed of 121 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 2 with 266 rules applied. Total rules applied 396 place count 364 transition count 307
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 2 with 323 rules applied. Total rules applied 719 place count 200 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 721 place count 199 transition count 151
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 723 place count 199 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 725 place count 197 transition count 149
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 726 place count 197 transition count 149
Applied a total of 726 rules in 86 ms. Remains 197 /579 variables (removed 382) and now considering 149/500 (removed 351) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 197/579 places, 149/500 transitions.
RANDOM walk for 1112 steps (55 resets) in 23 ms. (46 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p2 p1))), (F p2), (F (NOT p0)), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 7 factoid took 2477 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[p0, p0, (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), p0, (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 341 ms :[p0, p0, (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), p0, (AND (NOT p2) (NOT p1))]
[2025-05-30 15:09:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 15:09:41] [INFO ] [Real]Absence check using 70 positive place invariants in 331 ms returned sat
[2025-05-30 15:09:41] [INFO ] [Real]Absence check using 70 positive and 47 generalized place invariants in 268 ms returned sat
[2025-05-30 15:09:54] [INFO ] [Real]Absence check using state equation in 13100 ms returned sat
[2025-05-30 15:09:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-30 15:09:55] [INFO ] [Nat]Absence check using 70 positive place invariants in 210 ms returned sat
[2025-05-30 15:09:55] [INFO ] [Nat]Absence check using 70 positive and 47 generalized place invariants in 215 ms returned sat
[2025-05-30 15:10:09] [INFO ] [Nat]Absence check using state equation in 14097 ms returned unknown
Could not prove EG p0
Stuttering acceptance computed with spot in 293 ms :[p0, p0, (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), p0, (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 688 reset in 346 ms.
Product exploration explored 100000 steps with 703 reset in 413 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 333 ms :[p0, p0, (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), p0, (AND (NOT p2) (NOT p1))]
Support contains 5 out of 579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 579/579 places, 500/500 transitions.
Graph (trivial) has 267 edges and 579 vertex of which 6 / 579 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 1288 edges and 574 vertex of which 573 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 573 transition count 493
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 87 Pre rules applied. Total rules applied 65 place count 573 transition count 558
Deduced a syphon composed of 150 places in 2 ms
Iterating global reduction 1 with 87 rules applied. Total rules applied 152 place count 573 transition count 558
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 173 place count 552 transition count 519
Deduced a syphon composed of 129 places in 2 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 194 place count 552 transition count 519
Performed 191 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 320 places in 1 ms
Iterating global reduction 1 with 191 rules applied. Total rules applied 385 place count 552 transition count 519
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 433 place count 504 transition count 471
Deduced a syphon composed of 272 places in 0 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 481 place count 504 transition count 471
Deduced a syphon composed of 272 places in 1 ms
Applied a total of 481 rules in 154 ms. Remains 504 /579 variables (removed 75) and now considering 471/500 (removed 29) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 15:10:11] [INFO ] Redundant transitions in 17 ms returned []
Running 470 sub problems to find dead transitions.
// Phase 1: matrix 471 rows 504 cols
[2025-05-30 15:10:11] [INFO ] Computed 117 invariants in 14 ms
[2025-05-30 15:10:11] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/504 variables, 71/116 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:10:42] [INFO ] Deduced a trap composed of 3 places in 432 ms of which 21 ms to minimize.
SMT process timed out in 30376ms, After SMT, problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 30380ms
Starting structural reductions in SI_LTL mode, iteration 1 : 504/579 places, 471/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30564 ms. Remains : 504/579 places, 471/500 transitions.
Built C files in :
/tmp/ltsmin16090821881748877400
[2025-05-30 15:10:42] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16090821881748877400
Running compilation step : cd /tmp/ltsmin16090821881748877400;'/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 1424 ms.
Running link step : cd /tmp/ltsmin16090821881748877400;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin16090821881748877400;'/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/stateBased1261297315299302082.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 579 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 579/579 places, 500/500 transitions.
Applied a total of 0 rules in 17 ms. Remains 579 /579 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 579 cols
[2025-05-30 15:10:57] [INFO ] Computed 117 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:10:57] [INFO ] Implicit Places using invariants in 644 ms returned []
[2025-05-30 15:10:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:11:01] [INFO ] Implicit Places using invariants and state equation in 3080 ms returned []
Implicit Place search using SMT with State Equation took 3726 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2025-05-30 15:11:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/1079 variables, and 117 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/579 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:50] [INFO ] Deduced a trap composed of 74 places in 437 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:51] [INFO ] Deduced a trap composed of 74 places in 422 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:51] [INFO ] Deduced a trap composed of 74 places in 385 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:51] [INFO ] Deduced a trap composed of 75 places in 398 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:52] [INFO ] Deduced a trap composed of 75 places in 411 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:52] [INFO ] Deduced a trap composed of 75 places in 424 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:53] [INFO ] Deduced a trap composed of 75 places in 448 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:53] [INFO ] Deduced a trap composed of 75 places in 390 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:54] [INFO ] Deduced a trap composed of 39 places in 408 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:54] [INFO ] Deduced a trap composed of 95 places in 425 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:54] [INFO ] Deduced a trap composed of 95 places in 408 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:55] [INFO ] Deduced a trap composed of 74 places in 456 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:56] [INFO ] Deduced a trap composed of 74 places in 465 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:56] [INFO ] Deduced a trap composed of 74 places in 452 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:56] [INFO ] Deduced a trap composed of 74 places in 456 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:57] [INFO ] Deduced a trap composed of 74 places in 443 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:57] [INFO ] Deduced a trap composed of 74 places in 439 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:58] [INFO ] Deduced a trap composed of 74 places in 420 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:58] [INFO ] Deduced a trap composed of 74 places in 399 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:11:59] [INFO ] Deduced a trap composed of 75 places in 456 ms of which 95 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:12:00] [INFO ] Deduced a trap composed of 95 places in 408 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:12:00] [INFO ] Deduced a trap composed of 95 places in 460 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:12:01] [INFO ] Deduced a trap composed of 95 places in 409 ms of which 108 ms to minimize.
SMT process timed out in 60337ms, After SMT, problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 60339ms
Finished structural reductions in LTL mode , in 1 iterations and 64084 ms. Remains : 579/579 places, 500/500 transitions.
Built C files in :
/tmp/ltsmin4835134442100598952
[2025-05-30 15:12:01] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4835134442100598952
Running compilation step : cd /tmp/ltsmin4835134442100598952;'/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 1451 ms.
Running link step : cd /tmp/ltsmin4835134442100598952;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4835134442100598952;'/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/stateBased15700795457509294584.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 15:12:16] [INFO ] Flatten gal took : 21 ms
[2025-05-30 15:12:16] [INFO ] Flatten gal took : 18 ms
[2025-05-30 15:12:16] [INFO ] Time to serialize gal into /tmp/LTL9969931735237623272.gal : 4 ms
[2025-05-30 15:12:16] [INFO ] Time to serialize properties into /tmp/LTL13840387100474011043.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9969931735237623272.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3225126920870691648.hoa' '-atoms' '/tmp/LTL13840387100474011043.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13840387100474011043.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3225126920870691648.hoa
Detected timeout of ITS tools.
[2025-05-30 15:12:31] [INFO ] Flatten gal took : 18 ms
[2025-05-30 15:12:31] [INFO ] Flatten gal took : 18 ms
[2025-05-30 15:12:31] [INFO ] Time to serialize gal into /tmp/LTL7783413409308856407.gal : 3 ms
[2025-05-30 15:12:31] [INFO ] Time to serialize properties into /tmp/LTL7519414358924137801.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7783413409308856407.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7519414358924137801.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((("(p316!=1)")&&(F(G("(p516!=1)"))))U((F("(((p100==1)&&(p443==1))&&(p618==1))"))U(X(X("(p316==1)"))))))
Formula 0 simplified : (!"(p316!=1)" | GF!"(p516!=1)") R (G!"(((p100==1)&&(p443==1))&&(p618==1))" R XX!"(p316==1)")
Detected timeout of ITS tools.
[2025-05-30 15:12:46] [INFO ] Flatten gal took : 17 ms
[2025-05-30 15:12:46] [INFO ] Applying decomposition
[2025-05-30 15:12:46] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11578181618977581444.txt' '-o' '/tmp/graph11578181618977581444.bin' '-w' '/tmp/graph11578181618977581444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11578181618977581444.bin' '-l' '-1' '-v' '-w' '/tmp/graph11578181618977581444.weights' '-q' '0' '-e' '0.001'
[2025-05-30 15:12:46] [INFO ] Decomposing Gal with order
[2025-05-30 15:12:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 15:12:46] [INFO ] Removed a total of 289 redundant transitions.
[2025-05-30 15:12:46] [INFO ] Flatten gal took : 47 ms
[2025-05-30 15:12:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 15 ms.
[2025-05-30 15:12:46] [INFO ] Time to serialize gal into /tmp/LTL18198640431085652226.gal : 10 ms
[2025-05-30 15:12:46] [INFO ] Time to serialize properties into /tmp/LTL13019767795987662351.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18198640431085652226.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13019767795987662351.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((("(i13.i1.u100.p316!=1)")&&(F(G("(i15.i2.u148.p516!=1)"))))U((F("(((i8.u37.p100==1)&&(i8.u133.p443==1))&&(i8.u167.p618==1))"))U(X(...186
Formula 0 simplified : (!"(i13.i1.u100.p316!=1)" | GF!"(i15.i2.u148.p516!=1)") R (G!"(((i8.u37.p100==1)&&(i8.u133.p443==1))&&(i8.u167.p618==1))" R XX!"(i13...174
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t216, t301, t313, t321, t358, t403, t406, t479, t480, t484, t486, t488, t491...1586
Computing Next relation with stutter on 109584 deadlock states
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-19-LTLFireability-01 finished in 382747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(X(G(p1)))))))'
Support contains 4 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 516/516 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 583 transition count 504
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 583 transition count 504
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 580 transition count 501
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 580 transition count 501
Applied a total of 30 rules in 49 ms. Remains 580 /595 variables (removed 15) and now considering 501/516 (removed 15) transitions.
// Phase 1: matrix 501 rows 580 cols
[2025-05-30 15:13:02] [INFO ] Computed 117 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:13:02] [INFO ] Implicit Places using invariants in 916 ms returned []
[2025-05-30 15:13:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:13:05] [INFO ] Implicit Places using invariants and state equation in 2828 ms returned []
Implicit Place search using SMT with State Equation took 3751 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2025-05-30 15:13:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1081 variables, and 117 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/580 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:13:54] [INFO ] Deduced a trap composed of 76 places in 308 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:13:54] [INFO ] Deduced a trap composed of 76 places in 313 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:13:54] [INFO ] Deduced a trap composed of 76 places in 287 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:13:55] [INFO ] Deduced a trap composed of 76 places in 313 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:13:55] [INFO ] Deduced a trap composed of 76 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 15:13:56] [INFO ] Deduced a trap composed of 76 places in 427 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:13:56] [INFO ] Deduced a trap composed of 76 places in 402 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:13:56] [INFO ] Deduced a trap composed of 76 places in 394 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:13:57] [INFO ] Deduced a trap composed of 76 places in 387 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:13:57] [INFO ] Deduced a trap composed of 76 places in 367 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:13:58] [INFO ] Deduced a trap composed of 76 places in 360 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:13:58] [INFO ] Deduced a trap composed of 76 places in 331 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:13:58] [INFO ] Deduced a trap composed of 76 places in 375 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:13:59] [INFO ] Deduced a trap composed of 76 places in 365 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:13:59] [INFO ] Deduced a trap composed of 77 places in 417 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:14:00] [INFO ] Deduced a trap composed of 77 places in 411 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:14:00] [INFO ] Deduced a trap composed of 77 places in 435 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:14:01] [INFO ] Deduced a trap composed of 77 places in 418 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:14:01] [INFO ] Deduced a trap composed of 76 places in 408 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:14:01] [INFO ] Deduced a trap composed of 76 places in 410 ms of which 102 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:14:03] [INFO ] Deduced a trap composed of 77 places in 389 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:14:03] [INFO ] Deduced a trap composed of 77 places in 419 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:14:03] [INFO ] Deduced a trap composed of 77 places in 420 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:14:04] [INFO ] Deduced a trap composed of 77 places in 413 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:14:04] [INFO ] Deduced a trap composed of 77 places in 416 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:14:05] [INFO ] Deduced a trap composed of 77 places in 441 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:14:05] [INFO ] Deduced a trap composed of 77 places in 426 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:14:06] [INFO ] Deduced a trap composed of 77 places in 422 ms of which 93 ms to minimize.
SMT process timed out in 60385ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60386ms
Starting structural reductions in LTL mode, iteration 1 : 580/595 places, 501/516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64188 ms. Remains : 580/595 places, 501/516 transitions.
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-02
Stuttering criterion allowed to conclude after 171 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-02 finished in 64541 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 595 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 595/595 places, 516/516 transitions.
Graph (trivial) has 286 edges and 595 vertex of which 6 / 595 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 1311 edges and 590 vertex of which 589 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 588 transition count 436
Reduce places removed 72 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 73 rules applied. Total rules applied 147 place count 516 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 515 transition count 435
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 148 place count 515 transition count 311
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 420 place count 367 transition count 311
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 432 place count 355 transition count 299
Iterating global reduction 3 with 12 rules applied. Total rules applied 444 place count 355 transition count 299
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 309 rules applied. Total rules applied 753 place count 198 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 755 place count 197 transition count 150
Applied a total of 755 rules in 93 ms. Remains 197 /595 variables (removed 398) and now considering 150/516 (removed 366) transitions.
// Phase 1: matrix 150 rows 197 cols
[2025-05-30 15:14:06] [INFO ] Computed 88 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:14:07] [INFO ] Implicit Places using invariants in 457 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 60, 61, 172]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 468 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/595 places, 150/516 transitions.
Applied a total of 0 rules in 11 ms. Remains 168 /168 variables (removed 0) and now considering 150/150 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 573 ms. Remains : 168/595 places, 150/516 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-04 finished in 753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(X((p1||X(p2))) U ((X((p1||X(p2)))&&(p2 U (p3||G(p2))))||X(G((p1||X(p2))))))))'
Support contains 3 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 516/516 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 583 transition count 504
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 583 transition count 504
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 579 transition count 500
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 579 transition count 500
Applied a total of 32 rules in 51 ms. Remains 579 /595 variables (removed 16) and now considering 500/516 (removed 16) transitions.
// Phase 1: matrix 500 rows 579 cols
[2025-05-30 15:14:07] [INFO ] Computed 117 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:14:08] [INFO ] Implicit Places using invariants in 789 ms returned []
[2025-05-30 15:14:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:14:11] [INFO ] Implicit Places using invariants and state equation in 3149 ms returned []
Implicit Place search using SMT with State Equation took 3941 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2025-05-30 15:14:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/1079 variables, and 117 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/579 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:14:59] [INFO ] Deduced a trap composed of 74 places in 292 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:00] [INFO ] Deduced a trap composed of 74 places in 286 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:00] [INFO ] Deduced a trap composed of 93 places in 429 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:01] [INFO ] Deduced a trap composed of 88 places in 560 ms of which 218 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:01] [INFO ] Deduced a trap composed of 88 places in 428 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:02] [INFO ] Deduced a trap composed of 88 places in 457 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:02] [INFO ] Deduced a trap composed of 41 places in 406 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:03] [INFO ] Deduced a trap composed of 88 places in 427 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:03] [INFO ] Deduced a trap composed of 88 places in 409 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:03] [INFO ] Deduced a trap composed of 88 places in 407 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:04] [INFO ] Deduced a trap composed of 75 places in 385 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:04] [INFO ] Deduced a trap composed of 89 places in 412 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:05] [INFO ] Deduced a trap composed of 89 places in 383 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:05] [INFO ] Deduced a trap composed of 75 places in 390 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:05] [INFO ] Deduced a trap composed of 89 places in 364 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:06] [INFO ] Deduced a trap composed of 89 places in 371 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:06] [INFO ] Deduced a trap composed of 39 places in 395 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:07] [INFO ] Deduced a trap composed of 95 places in 395 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:07] [INFO ] Deduced a trap composed of 74 places in 386 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:08] [INFO ] Deduced a trap composed of 75 places in 423 ms of which 89 ms to minimize.
Problem TDEAD416 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD428 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 4 solved, 495 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:09] [INFO ] Deduced a trap composed of 93 places in 406 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:10] [INFO ] Deduced a trap composed of 93 places in 431 ms of which 113 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:10] [INFO ] Deduced a trap composed of 93 places in 435 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:10] [INFO ] Deduced a trap composed of 93 places in 433 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:11] [INFO ] Deduced a trap composed of 93 places in 409 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:11] [INFO ] Deduced a trap composed of 93 places in 342 ms of which 94 ms to minimize.
SMT process timed out in 60388ms, After SMT, problems are : Problem set: 4 solved, 495 unsolved
Search for dead transitions found 4 dead transitions in 60391ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 579/595 places, 496/516 transitions.
Applied a total of 0 rules in 25 ms. Remains 579 /579 variables (removed 0) and now considering 496/496 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64412 ms. Remains : 579/595 places, 496/516 transitions.
Stuttering acceptance computed with spot in 613 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (NOT p0), true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-05
Product exploration explored 100000 steps with 39940 reset in 285 ms.
Product exploration explored 100000 steps with 40045 reset in 316 ms.
Computed a total of 522 stabilizing places and 449 stable transitions
Graph (complete) has 1286 edges and 579 vertex of which 578 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 522 stabilizing places and 449 stable transitions
Detected a total of 522/579 stabilizing places and 449/496 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Knowledge obtained : [(AND p3 p2 p1 p0), (X p2), (X p3), (X (NOT (AND (NOT p3) p2))), (X p1), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X p3)), (X (X (NOT (AND (NOT p3) p2)))), (X (X p0)), (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 20 factoid took 28 ms. Reduced automaton from 12 states, 29 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-19-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-19-LTLFireability-05 finished in 65738 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)||(p1 U (G(p1)||(p1&&G(p2))))))'
Support contains 5 out of 595 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 595/595 places, 516/516 transitions.
Graph (trivial) has 284 edges and 595 vertex of which 6 / 595 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 1311 edges and 590 vertex of which 589 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 588 transition count 436
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 516 transition count 436
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 146 place count 516 transition count 313
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 416 place count 369 transition count 313
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 428 place count 357 transition count 301
Iterating global reduction 2 with 12 rules applied. Total rules applied 440 place count 357 transition count 301
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 305 rules applied. Total rules applied 745 place count 202 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 747 place count 201 transition count 154
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 753 place count 201 transition count 154
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 754 place count 200 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 755 place count 199 transition count 153
Applied a total of 755 rules in 105 ms. Remains 199 /595 variables (removed 396) and now considering 153/516 (removed 363) transitions.
// Phase 1: matrix 153 rows 199 cols
[2025-05-30 15:15:13] [INFO ] Computed 87 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:15:13] [INFO ] Implicit Places using invariants in 366 ms returned [62, 158]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 368 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 197/595 places, 153/516 transitions.
Applied a total of 0 rules in 11 ms. Remains 197 /197 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 486 ms. Remains : 197/595 places, 153/516 transitions.
Stuttering acceptance computed with spot in 285 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-06
Product exploration explored 100000 steps with 14308 reset in 543 ms.
Product exploration explored 100000 steps with 14455 reset in 527 ms.
Computed a total of 177 stabilizing places and 139 stable transitions
Computed a total of 177 stabilizing places and 139 stable transitions
Detected a total of 177/197 stabilizing places and 139/153 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 30 factoid took 6323 ms. Reduced automaton from 8 states, 30 edges and 3 AP (stutter insensitive) to 8 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 366 ms :[true, (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (6251 resets) in 972 ms. (41 steps per ms) remains 15/21 properties
BEST_FIRST walk for 4004 steps (175 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (192 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (169 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (174 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (170 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (199 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (170 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (152 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (138 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (186 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (172 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (138 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (190 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (144 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (144 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
// Phase 1: matrix 153 rows 197 cols
[2025-05-30 15:15:22] [INFO ] Computed 85 invariants in 3 ms
[2025-05-30 15:15:22] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem apf4 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
Problem apf15 is UNSAT
Problem apf16 is UNSAT
Problem apf17 is UNSAT
Problem apf20 is UNSAT
At refinement iteration 1 (OVERLAPS) 99/104 variables, 34/34 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/34 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/35 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/35 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 25/130 variables, 15/50 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/50 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 7/137 variables, 7/57 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/57 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 148/285 variables, 137/194 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 2/196 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 0/196 constraints. Problems are: Problem set: 7 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 63/348 variables, 59/255 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/348 variables, 28/283 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 2/285 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/348 variables, 0/285 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 1/349 variables, 1/286 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/349 variables, 0/286 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/349 variables, 0/286 constraints. Problems are: Problem set: 7 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/350 variables, and 286 constraints, problems are : Problem set: 7 solved, 8 unsolved in 1055 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 197/197 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 99/104 variables, 34/34 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/34 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/105 variables, 1/35 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/35 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 25/130 variables, 15/50 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/50 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 7/137 variables, 7/57 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/57 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 148/285 variables, 137/194 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 2/196 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 8/204 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/204 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 63/348 variables, 59/263 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 28/291 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/348 variables, 2/293 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/348 variables, 0/293 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 1/349 variables, 1/294 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/349 variables, 0/294 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/349 variables, 0/294 constraints. Problems are: Problem set: 7 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/350 variables, and 294 constraints, problems are : Problem set: 7 solved, 8 unsolved in 2010 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 197/197 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 8/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3077ms problems are : Problem set: 7 solved, 8 unsolved
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 291 ms.
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 153/153 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 197 transition count 152
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 197 transition count 150
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 195 transition count 150
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 195 transition count 150
Applied a total of 6 rules in 26 ms. Remains 195 /197 variables (removed 2) and now considering 150/153 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 195/197 places, 150/153 transitions.
RANDOM walk for 5117 steps (217 resets) in 60 ms. (83 steps per ms) remains 0/8 properties
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X p0), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 (NOT p2) p0)), (G (OR p2 p0)), (G (OR p1 p2)), (G (OR p1 p0)), (G (OR (NOT p1) p2 p0)), (G (OR p1 p2 (NOT p0))), (G (OR p1 p2 p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X p1), (X (AND p0 p2 (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND p0 p2 p1)), (X (NOT (AND p0 p2 p1))), (X (AND p2 p1)), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p2) p0))), (F (NOT (AND p1 p2))), (F (NOT (AND p2 p0))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT p2)), (F (NOT (AND p1 p2 p0))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2) p0)))]
Knowledge based reduction with 37 factoid took 10644 ms. Reduced automaton from 8 states, 30 edges and 3 AP (stutter insensitive) to 8 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 348 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 358 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 153/153 transitions.
Applied a total of 0 rules in 14 ms. Remains 197 /197 variables (removed 0) and now considering 153/153 (removed 0) transitions.
[2025-05-30 15:15:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:15:37] [INFO ] Implicit Places using invariants in 414 ms returned []
[2025-05-30 15:15:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:15:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-30 15:15:38] [INFO ] Implicit Places using invariants and state equation in 1036 ms returned [63, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 89, 104, 106, 110, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 139]
Discarding 30 places :
Implicit Place search using SMT with State Equation took 1453 ms to find 30 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 167/197 places, 153/153 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 167 transition count 140
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 154 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 153 transition count 139
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 32 place count 149 transition count 134
Iterating global reduction 3 with 4 rules applied. Total rules applied 36 place count 149 transition count 134
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 39 place count 149 transition count 131
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 42 place count 146 transition count 131
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 58 place count 137 transition count 124
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 62 place count 135 transition count 122
Applied a total of 62 rules in 15 ms. Remains 135 /167 variables (removed 32) and now considering 122/153 (removed 31) transitions.
// Phase 1: matrix 122 rows 135 cols
[2025-05-30 15:15:38] [INFO ] Computed 55 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:15:38] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-05-30 15:15:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:15:38] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-05-30 15:15:39] [INFO ] Implicit Places using invariants and state equation in 534 ms returned [3, 4, 5, 6, 7, 9, 11, 17, 20, 21, 22, 25, 26, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 705 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 111/197 places, 122/153 transitions.
Graph (complete) has 411 edges and 111 vertex of which 102 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 91 transition count 83
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 91 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 25 place count 91 transition count 81
Applied a total of 25 rules in 5 ms. Remains 91 /111 variables (removed 20) and now considering 81/122 (removed 41) transitions.
// Phase 1: matrix 81 rows 91 cols
[2025-05-30 15:15:39] [INFO ] Computed 26 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:15:39] [INFO ] Implicit Places using invariants in 127 ms returned [14, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 137 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 89/197 places, 81/153 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 2333 ms. Remains : 89/197 places, 81/153 transitions.
Computed a total of 69 stabilizing places and 67 stable transitions
Computed a total of 69 stabilizing places and 67 stable transitions
Detected a total of 69/89 stabilizing places and 67/81 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND p1 p2 p0)), (X (NOT (AND p1 p2 p0))), (X (AND (NOT p1) p2 p0)), (X (NOT (AND (NOT p1) p2 p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 30 factoid took 6767 ms. Reduced automaton from 8 states, 30 edges and 3 AP (stutter insensitive) to 8 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 360 ms :[true, (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (6437 resets) in 403 ms. (99 steps per ms) remains 15/21 properties
BEST_FIRST walk for 4003 steps (172 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (194 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (165 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (169 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (167 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (198 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (171 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (148 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (144 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (192 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (174 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (143 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (187 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (146 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (136 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
// Phase 1: matrix 81 rows 89 cols
[2025-05-30 15:15:46] [INFO ] Computed 24 invariants in 0 ms
[2025-05-30 15:15:46] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem apf4 is UNSAT
Problem apf16 is UNSAT
Problem apf20 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/42 variables, 12/12 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 6/48 variables, 3/15 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 55/103 variables, 48/63 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 2/65 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/65 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 31/134 variables, 23/88 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 8/96 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 1/97 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/97 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 6/140 variables, 1/98 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/98 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 12/152 variables, 9/107 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 0/107 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 9/161 variables, 4/111 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/161 variables, 1/112 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/161 variables, 0/112 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Problem apf9 is UNSAT
Problem apf10 is UNSAT
Problem apf15 is UNSAT
Problem apf17 is UNSAT
At refinement iteration 19 (OVERLAPS) 5/166 variables, 3/115 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/166 variables, 1/116 constraints. Problems are: Problem set: 7 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/166 variables, 0/116 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 22 (OVERLAPS) 2/168 variables, 1/117 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/168 variables, 0/117 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 1/169 variables, 1/118 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/169 variables, 0/118 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 26 (OVERLAPS) 0/169 variables, 0/118 constraints. Problems are: Problem set: 7 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/170 variables, and 118 constraints, problems are : Problem set: 7 solved, 8 unsolved in 1360 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 37/42 variables, 12/12 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 6/48 variables, 3/15 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 55/103 variables, 48/63 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 2/65 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 1/66 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/66 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 31/134 variables, 23/89 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 8/97 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 1/98 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 7/105 constraints. Problems are: Problem set: 7 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:48] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:48] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 2/107 constraints. Problems are: Problem set: 7 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:48] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:48] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:48] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/134 variables, 3/110 constraints. Problems are: Problem set: 7 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:15:48] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/134 variables, 1/111 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/134 variables, 0/111 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 6/140 variables, 1/112 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/140 variables, 0/112 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 12/152 variables, 9/121 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/152 variables, 0/121 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 9/161 variables, 4/125 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/161 variables, 1/126 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/161 variables, 0/126 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 5/166 variables, 3/129 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/166 variables, 1/130 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/166 variables, 0/130 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 2/168 variables, 1/131 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/168 variables, 0/131 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 29 (OVERLAPS) 1/169 variables, 1/132 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/169 variables, 0/132 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 31 (OVERLAPS) 0/169 variables, 0/132 constraints. Problems are: Problem set: 7 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/170 variables, and 132 constraints, problems are : Problem set: 7 solved, 8 unsolved in 2496 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 89/89 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 8/15 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3865ms problems are : Problem set: 7 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Finished Parikh walk after 34 steps, including 1 resets, run visited all 3 properties in 2 ms. (steps per millisecond=17 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 204 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p1 (NOT p2) p0)), (G (OR p2 p0)), (G (OR p1 p2)), (G (OR p1 p0)), (G (OR (NOT p1) p2 p0)), (G (OR p1 p2 (NOT p0))), (G (OR p1 p2 p0))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND p1 p2 p0)), (X (NOT (AND p1 p2 p0))), (X (AND (NOT p1) p2 p0)), (X (NOT (AND (NOT p1) p2 p0))), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p2) p0))), (F (NOT (AND p1 p2))), (F (NOT (AND p2 p0))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT p2)), (F (NOT (AND p1 p2 p0))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2) p0)))]
Knowledge based reduction with 37 factoid took 11145 ms. Reduced automaton from 8 states, 30 edges and 3 AP (stutter insensitive) to 8 states, 30 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 327 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 369 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 369 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 14756 reset in 335 ms.
Product exploration explored 100000 steps with 14711 reset in 357 ms.
Built C files in :
/tmp/ltsmin9884364357045809902
[2025-05-30 15:16:03] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2025-05-30 15:16:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 15:16:03] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2025-05-30 15:16:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 15:16:03] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2025-05-30 15:16:03] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 15:16:03] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9884364357045809902
Running compilation step : cd /tmp/ltsmin9884364357045809902;'/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 439 ms.
Running link step : cd /tmp/ltsmin9884364357045809902;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin9884364357045809902;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased598441335948765592.hoa' '--buchi-type=spotba'
LTSmin run took 4380 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-19-LTLFireability-06 finished in 55466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X((p0||X(p1))))) U (p2 U p3)))'
Support contains 4 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 516/516 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 584 transition count 505
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 584 transition count 505
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 580 transition count 501
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 580 transition count 501
Applied a total of 30 rules in 48 ms. Remains 580 /595 variables (removed 15) and now considering 501/516 (removed 15) transitions.
// Phase 1: matrix 501 rows 580 cols
[2025-05-30 15:16:08] [INFO ] Computed 117 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:16:09] [INFO ] Implicit Places using invariants in 623 ms returned []
[2025-05-30 15:16:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:16:11] [INFO ] Implicit Places using invariants and state equation in 2779 ms returned []
Implicit Place search using SMT with State Equation took 3404 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2025-05-30 15:16:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1081 variables, and 117 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/580 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:01] [INFO ] Deduced a trap composed of 74 places in 484 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:01] [INFO ] Deduced a trap composed of 74 places in 421 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:01] [INFO ] Deduced a trap composed of 93 places in 426 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:02] [INFO ] Deduced a trap composed of 88 places in 457 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:02] [INFO ] Deduced a trap composed of 88 places in 496 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:03] [INFO ] Deduced a trap composed of 88 places in 463 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:04] [INFO ] Deduced a trap composed of 88 places in 679 ms of which 328 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:04] [INFO ] Deduced a trap composed of 88 places in 293 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:05] [INFO ] Deduced a trap composed of 88 places in 629 ms of which 370 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:05] [INFO ] Deduced a trap composed of 88 places in 433 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:06] [INFO ] Deduced a trap composed of 88 places in 1012 ms of which 705 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:07] [INFO ] Deduced a trap composed of 88 places in 509 ms of which 211 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:07] [INFO ] Deduced a trap composed of 88 places in 390 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:08] [INFO ] Deduced a trap composed of 88 places in 1010 ms of which 727 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:08] [INFO ] Deduced a trap composed of 88 places in 292 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:09] [INFO ] Deduced a trap composed of 88 places in 395 ms of which 206 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:09] [INFO ] Deduced a trap composed of 88 places in 368 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:10] [INFO ] Deduced a trap composed of 88 places in 842 ms of which 487 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:10] [INFO ] Deduced a trap composed of 88 places in 465 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:17:11] [INFO ] Deduced a trap composed of 88 places in 474 ms of which 132 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 580/1081 variables, and 137 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/580 constraints, PredecessorRefiner: 0/500 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 580/595 places, 501/516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63586 ms. Remains : 580/595 places, 501/516 transitions.
Stuttering acceptance computed with spot in 660 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-08
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-08 finished in 64281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&(G(p1) U p2)))))))'
Support contains 2 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 516/516 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 583 transition count 504
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 583 transition count 504
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 580 transition count 501
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 580 transition count 501
Applied a total of 30 rules in 83 ms. Remains 580 /595 variables (removed 15) and now considering 501/516 (removed 15) transitions.
// Phase 1: matrix 501 rows 580 cols
[2025-05-30 15:17:12] [INFO ] Computed 117 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:17:13] [INFO ] Implicit Places using invariants in 874 ms returned []
[2025-05-30 15:17:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:17:16] [INFO ] Implicit Places using invariants and state equation in 3174 ms returned []
Implicit Place search using SMT with State Equation took 4049 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2025-05-30 15:17:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1081 variables, and 117 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/580 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:06] [INFO ] Deduced a trap composed of 74 places in 448 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:06] [INFO ] Deduced a trap composed of 74 places in 455 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:07] [INFO ] Deduced a trap composed of 74 places in 404 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:07] [INFO ] Deduced a trap composed of 93 places in 449 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:08] [INFO ] Deduced a trap composed of 93 places in 389 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:08] [INFO ] Deduced a trap composed of 74 places in 439 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:08] [INFO ] Deduced a trap composed of 95 places in 424 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:09] [INFO ] Deduced a trap composed of 95 places in 408 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:09] [INFO ] Deduced a trap composed of 95 places in 448 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:10] [INFO ] Deduced a trap composed of 90 places in 420 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:10] [INFO ] Deduced a trap composed of 95 places in 431 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:11] [INFO ] Deduced a trap composed of 95 places in 445 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:11] [INFO ] Deduced a trap composed of 95 places in 422 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:12] [INFO ] Deduced a trap composed of 95 places in 439 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:12] [INFO ] Deduced a trap composed of 95 places in 474 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:13] [INFO ] Deduced a trap composed of 95 places in 444 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:13] [INFO ] Deduced a trap composed of 95 places in 581 ms of which 235 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:14] [INFO ] Deduced a trap composed of 95 places in 458 ms of which 120 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:14] [INFO ] Deduced a trap composed of 95 places in 431 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:15] [INFO ] Deduced a trap composed of 95 places in 572 ms of which 232 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:16] [INFO ] Deduced a trap composed of 95 places in 452 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:17] [INFO ] Deduced a trap composed of 95 places in 441 ms of which 99 ms to minimize.
SMT process timed out in 60178ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Starting structural reductions in LTL mode, iteration 1 : 580/595 places, 501/516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64313 ms. Remains : 580/595 places, 501/516 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-09
Product exploration explored 100000 steps with 25000 reset in 235 ms.
Product exploration explored 100000 steps with 25000 reset in 253 ms.
Computed a total of 523 stabilizing places and 454 stable transitions
Graph (complete) has 1297 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 523 stabilizing places and 454 stable transitions
Detected a total of 523/580 stabilizing places and 454/501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 255 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
RANDOM walk for 40000 steps (216 resets) in 634 ms. (62 steps per ms) remains 3/9 properties
BEST_FIRST walk for 40002 steps (38 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (39 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (39 resets) in 136 ms. (292 steps per ms) remains 3/3 properties
[2025-05-30 15:18:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 138/140 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 288/428 variables, 67/71 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:19] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:19] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:19] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:20] [INFO ] Deduced a trap composed of 25 places in 296 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:20] [INFO ] Deduced a trap composed of 26 places in 317 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:20] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:21] [INFO ] Deduced a trap composed of 36 places in 307 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:21] [INFO ] Deduced a trap composed of 38 places in 309 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:21] [INFO ] Deduced a trap composed of 41 places in 304 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:22] [INFO ] Deduced a trap composed of 89 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 15:18:22] [INFO ] Deduced a trap composed of 89 places in 315 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:22] [INFO ] Deduced a trap composed of 89 places in 315 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:23] [INFO ] Deduced a trap composed of 89 places in 313 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:23] [INFO ] Deduced a trap composed of 89 places in 302 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:23] [INFO ] Deduced a trap composed of 89 places in 324 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:18:24] [INFO ] Deduced a trap composed of 90 places in 311 ms of which 59 ms to minimize.
SMT process timed out in 5101ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (trivial) has 269 edges and 580 vertex of which 6 / 580 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 1290 edges and 575 vertex of which 574 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 574 transition count 429
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 510 transition count 429
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 122 Pre rules applied. Total rules applied 130 place count 510 transition count 307
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 399 place count 363 transition count 307
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 2 with 324 rules applied. Total rules applied 723 place count 199 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 725 place count 198 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 727 place count 198 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 729 place count 196 transition count 148
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 730 place count 196 transition count 148
Applied a total of 730 rules in 56 ms. Remains 196 /580 variables (removed 384) and now considering 148/501 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 196/580 places, 148/501 transitions.
RANDOM walk for 34436 steps (1713 resets) in 386 ms. (88 steps per ms) remains 0/2 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p1) (OR p2 p1)))), (F (NOT (AND p0 (OR p2 p1)))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND (OR p0 (NOT p1)) (OR p2 (NOT p1))))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 5 factoid took 955 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Support contains 1 out of 580 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Applied a total of 0 rules in 27 ms. Remains 580 /580 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2025-05-30 15:18:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:18:26] [INFO ] Implicit Places using invariants in 821 ms returned []
[2025-05-30 15:18:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:18:29] [INFO ] Implicit Places using invariants and state equation in 2842 ms returned []
Implicit Place search using SMT with State Equation took 3665 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2025-05-30 15:18:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1081 variables, and 117 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/580 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:19] [INFO ] Deduced a trap composed of 74 places in 474 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:19] [INFO ] Deduced a trap composed of 74 places in 438 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:19] [INFO ] Deduced a trap composed of 74 places in 370 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:20] [INFO ] Deduced a trap composed of 93 places in 366 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:20] [INFO ] Deduced a trap composed of 93 places in 351 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:21] [INFO ] Deduced a trap composed of 74 places in 424 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:21] [INFO ] Deduced a trap composed of 95 places in 457 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:22] [INFO ] Deduced a trap composed of 95 places in 417 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:22] [INFO ] Deduced a trap composed of 95 places in 469 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:23] [INFO ] Deduced a trap composed of 90 places in 462 ms of which 114 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:23] [INFO ] Deduced a trap composed of 95 places in 458 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:24] [INFO ] Deduced a trap composed of 95 places in 454 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:24] [INFO ] Deduced a trap composed of 95 places in 404 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:24] [INFO ] Deduced a trap composed of 95 places in 450 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:25] [INFO ] Deduced a trap composed of 95 places in 447 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:25] [INFO ] Deduced a trap composed of 95 places in 445 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:26] [INFO ] Deduced a trap composed of 95 places in 589 ms of which 238 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:26] [INFO ] Deduced a trap composed of 95 places in 449 ms of which 116 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:27] [INFO ] Deduced a trap composed of 95 places in 449 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:28] [INFO ] Deduced a trap composed of 95 places in 575 ms of which 233 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:29] [INFO ] Deduced a trap composed of 95 places in 465 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:29] [INFO ] Deduced a trap composed of 95 places in 445 ms of which 99 ms to minimize.
SMT process timed out in 60515ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60516ms
Finished structural reductions in LTL mode , in 1 iterations and 64209 ms. Remains : 580/580 places, 501/501 transitions.
Computed a total of 523 stabilizing places and 454 stable transitions
Graph (complete) has 1297 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 523 stabilizing places and 454 stable transitions
Detected a total of 523/580 stabilizing places and 454/501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p2), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (220 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (39 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (39 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (39 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 412399 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 3
Probabilistic random walk after 412399 steps, saw 67345 distinct states, run finished after 3010 ms. (steps per millisecond=137 ) properties seen :0
[2025-05-30 15:19:33] [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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 134/135 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 293/428 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:33] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:33] [INFO ] Deduced a trap composed of 24 places in 116 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:34] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:34] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:34] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:34] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:34] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:34] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:34] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:34] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:34] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:34] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 138/566 variables, 44/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:35] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/568 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 493/1061 variables, 568/698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:35] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1061 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1061 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 17/1078 variables, 9/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 3/1081 variables, 3/711 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1081 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1081 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1081/1081 variables, and 711 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3803 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 134/135 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 293/428 variables, 68/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 138/566 variables, 44/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:37] [INFO ] Deduced a trap composed of 15 places in 443 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:38] [INFO ] Deduced a trap composed of 26 places in 460 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:38] [INFO ] Deduced a trap composed of 30 places in 466 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:39] [INFO ] Deduced a trap composed of 38 places in 476 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:39] [INFO ] Deduced a trap composed of 41 places in 472 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:40] [INFO ] Deduced a trap composed of 42 places in 451 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:40] [INFO ] Deduced a trap composed of 43 places in 425 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:19:41] [INFO ] Deduced a trap composed of 44 places in 402 ms of which 63 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/568 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/568 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 493/1061 variables, 568/706 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1061 variables, 3/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1061 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1061 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 17/1078 variables, 9/719 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1078 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 3/1081 variables, 3/722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1081/1081 variables, and 722 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8819ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (trivial) has 270 edges and 580 vertex of which 6 / 580 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 1290 edges and 575 vertex of which 574 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 574 transition count 429
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 510 transition count 429
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 130 place count 510 transition count 306
Deduced a syphon composed of 123 places in 2 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 401 place count 362 transition count 306
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 2 with 324 rules applied. Total rules applied 725 place count 198 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 727 place count 197 transition count 149
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 729 place count 197 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 731 place count 195 transition count 147
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 732 place count 195 transition count 147
Applied a total of 732 rules in 60 ms. Remains 195 /580 variables (removed 385) and now considering 147/501 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 195/580 places, 147/501 transitions.
RANDOM walk for 395 steps (16 resets) in 13 ms. (28 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 3 factoid took 278 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 500 ms.
Product exploration explored 100000 steps with 25000 reset in 424 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0))]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (trivial) has 270 edges and 580 vertex of which 6 / 580 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 1291 edges and 575 vertex of which 574 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 574 transition count 494
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 65 place count 574 transition count 561
Deduced a syphon composed of 151 places in 2 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 153 place count 574 transition count 561
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 175 place count 552 transition count 520
Deduced a syphon composed of 129 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 197 place count 552 transition count 520
Performed 195 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 324 places in 0 ms
Iterating global reduction 1 with 195 rules applied. Total rules applied 392 place count 552 transition count 520
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 439 place count 505 transition count 473
Deduced a syphon composed of 277 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 486 place count 505 transition count 473
Deduced a syphon composed of 277 places in 0 ms
Applied a total of 486 rules in 70 ms. Remains 505 /580 variables (removed 75) and now considering 473/501 (removed 28) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 15:19:44] [INFO ] Redundant transitions in 5 ms returned []
Running 472 sub problems to find dead transitions.
// Phase 1: matrix 473 rows 505 cols
[2025-05-30 15:19:44] [INFO ] Computed 117 invariants in 8 ms
[2025-05-30 15:19:44] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 1/505 variables, 71/116 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:20:15] [INFO ] Deduced a trap composed of 3 places in 446 ms of which 20 ms to minimize.
SMT process timed out in 30667ms, After SMT, problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 30668ms
Starting structural reductions in SI_LTL mode, iteration 1 : 505/580 places, 473/501 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30751 ms. Remains : 505/580 places, 473/501 transitions.
Built C files in :
/tmp/ltsmin4503947292566521999
[2025-05-30 15:20:15] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4503947292566521999
Running compilation step : cd /tmp/ltsmin4503947292566521999;'/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 1568 ms.
Running link step : cd /tmp/ltsmin4503947292566521999;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4503947292566521999;'/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/stateBased1465340415706631973.hoa' '--buchi-type=spotba'
LTSmin run took 279 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-19-LTLFireability-09 finished in 184341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 3 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 516/516 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 584 transition count 505
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 584 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 581 transition count 502
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 581 transition count 502
Applied a total of 28 rules in 81 ms. Remains 581 /595 variables (removed 14) and now considering 502/516 (removed 14) transitions.
// Phase 1: matrix 502 rows 581 cols
[2025-05-30 15:20:17] [INFO ] Computed 117 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:20:18] [INFO ] Implicit Places using invariants in 903 ms returned []
[2025-05-30 15:20:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:20:21] [INFO ] Implicit Places using invariants and state equation in 3452 ms returned []
Implicit Place search using SMT with State Equation took 4357 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2025-05-30 15:20: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/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 581/1083 variables, and 117 constraints, problems are : Problem set: 0 solved, 501 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/581 constraints, PredecessorRefiner: 501/501 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:10] [INFO ] Deduced a trap composed of 77 places in 355 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:11] [INFO ] Deduced a trap composed of 77 places in 475 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:11] [INFO ] Deduced a trap composed of 77 places in 415 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:12] [INFO ] Deduced a trap composed of 96 places in 437 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:12] [INFO ] Deduced a trap composed of 96 places in 427 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:13] [INFO ] Deduced a trap composed of 98 places in 462 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:13] [INFO ] Deduced a trap composed of 98 places in 464 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:14] [INFO ] Deduced a trap composed of 98 places in 461 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:14] [INFO ] Deduced a trap composed of 98 places in 458 ms of which 118 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:15] [INFO ] Deduced a trap composed of 98 places in 615 ms of which 274 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:15] [INFO ] Deduced a trap composed of 98 places in 474 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:16] [INFO ] Deduced a trap composed of 78 places in 470 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:16] [INFO ] Deduced a trap composed of 77 places in 458 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:17] [INFO ] Deduced a trap composed of 96 places in 452 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:17] [INFO ] Deduced a trap composed of 78 places in 470 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:18] [INFO ] Deduced a trap composed of 77 places in 474 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:19] [INFO ] Deduced a trap composed of 77 places in 480 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:19] [INFO ] Deduced a trap composed of 77 places in 450 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:19] [INFO ] Deduced a trap composed of 77 places in 408 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:20] [INFO ] Deduced a trap composed of 77 places in 405 ms of which 80 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 501 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:21] [INFO ] Deduced a trap composed of 76 places in 385 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:21:21] [INFO ] Deduced a trap composed of 76 places in 388 ms of which 76 ms to minimize.
SMT process timed out in 60205ms, After SMT, problems are : Problem set: 0 solved, 501 unsolved
Search for dead transitions found 0 dead transitions in 60206ms
Starting structural reductions in LTL mode, iteration 1 : 581/595 places, 502/516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64647 ms. Remains : 581/595 places, 502/516 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-12
Stuttering criterion allowed to conclude after 2385 steps with 12 reset in 8 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-12 finished in 64822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1))))'
Support contains 3 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 516/516 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 583 transition count 504
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 583 transition count 504
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 579 transition count 500
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 579 transition count 500
Applied a total of 32 rules in 71 ms. Remains 579 /595 variables (removed 16) and now considering 500/516 (removed 16) transitions.
// Phase 1: matrix 500 rows 579 cols
[2025-05-30 15:21:22] [INFO ] Computed 117 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:21:22] [INFO ] Implicit Places using invariants in 744 ms returned []
[2025-05-30 15:21:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:21:25] [INFO ] Implicit Places using invariants and state equation in 2813 ms returned []
Implicit Place search using SMT with State Equation took 3558 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2025-05-30 15:21:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/1079 variables, and 117 constraints, problems are : Problem set: 0 solved, 499 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/579 constraints, PredecessorRefiner: 499/499 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:15] [INFO ] Deduced a trap composed of 74 places in 285 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:15] [INFO ] Deduced a trap composed of 74 places in 418 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:15] [INFO ] Deduced a trap composed of 74 places in 420 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:16] [INFO ] Deduced a trap composed of 94 places in 446 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:16] [INFO ] Deduced a trap composed of 94 places in 425 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:17] [INFO ] Deduced a trap composed of 94 places in 426 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:17] [INFO ] Deduced a trap composed of 96 places in 414 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:18] [INFO ] Deduced a trap composed of 96 places in 434 ms of which 110 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:18] [INFO ] Deduced a trap composed of 96 places in 440 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:19] [INFO ] Deduced a trap composed of 96 places in 413 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:19] [INFO ] Deduced a trap composed of 96 places in 388 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:19] [INFO ] Deduced a trap composed of 96 places in 395 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:20] [INFO ] Deduced a trap composed of 96 places in 386 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:20] [INFO ] Deduced a trap composed of 96 places in 432 ms of which 126 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:21] [INFO ] Deduced a trap composed of 96 places in 458 ms of which 115 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:21] [INFO ] Deduced a trap composed of 96 places in 406 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:22] [INFO ] Deduced a trap composed of 96 places in 433 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:22] [INFO ] Deduced a trap composed of 96 places in 449 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:23] [INFO ] Deduced a trap composed of 95 places in 438 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:23] [INFO ] Deduced a trap composed of 75 places in 454 ms of which 100 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 499 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:24] [INFO ] Deduced a trap composed of 96 places in 396 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:25] [INFO ] Deduced a trap composed of 96 places in 419 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:22:25] [INFO ] Deduced a trap composed of 96 places in 416 ms of which 103 ms to minimize.
SMT process timed out in 60197ms, After SMT, problems are : Problem set: 0 solved, 499 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Starting structural reductions in LTL mode, iteration 1 : 579/595 places, 500/516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63830 ms. Remains : 579/595 places, 500/516 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-13
Stuttering criterion allowed to conclude after 203 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-13 finished in 64056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X((p1||G((p1||X(G(p2)))))))))'
Support contains 3 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 516/516 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 583 transition count 504
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 583 transition count 504
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 580 transition count 501
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 580 transition count 501
Applied a total of 30 rules in 76 ms. Remains 580 /595 variables (removed 15) and now considering 501/516 (removed 15) transitions.
// Phase 1: matrix 501 rows 580 cols
[2025-05-30 15:22:26] [INFO ] Computed 117 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:22:26] [INFO ] Implicit Places using invariants in 871 ms returned []
[2025-05-30 15:22:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:22:30] [INFO ] Implicit Places using invariants and state equation in 3167 ms returned []
Implicit Place search using SMT with State Equation took 4039 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2025-05-30 15:22:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1081 variables, and 117 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/580 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:19] [INFO ] Deduced a trap composed of 77 places in 442 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:20] [INFO ] Deduced a trap composed of 77 places in 435 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:20] [INFO ] Deduced a trap composed of 77 places in 444 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:21] [INFO ] Deduced a trap composed of 77 places in 413 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:21] [INFO ] Deduced a trap composed of 77 places in 414 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:22] [INFO ] Deduced a trap composed of 76 places in 435 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:22] [INFO ] Deduced a trap composed of 76 places in 382 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:23] [INFO ] Deduced a trap composed of 76 places in 384 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:23] [INFO ] Deduced a trap composed of 76 places in 375 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:23] [INFO ] Deduced a trap composed of 76 places in 342 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:24] [INFO ] Deduced a trap composed of 76 places in 339 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:24] [INFO ] Deduced a trap composed of 76 places in 330 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:24] [INFO ] Deduced a trap composed of 97 places in 382 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:25] [INFO ] Deduced a trap composed of 97 places in 443 ms of which 117 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:25] [INFO ] Deduced a trap composed of 97 places in 467 ms of which 111 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:26] [INFO ] Deduced a trap composed of 97 places in 460 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:26] [INFO ] Deduced a trap composed of 97 places in 464 ms of which 131 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:27] [INFO ] Deduced a trap composed of 97 places in 390 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:27] [INFO ] Deduced a trap composed of 97 places in 411 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:28] [INFO ] Deduced a trap composed of 97 places in 462 ms of which 104 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:29] [INFO ] Deduced a trap composed of 98 places in 421 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:23:30] [INFO ] Deduced a trap composed of 98 places in 1139 ms of which 823 ms to minimize.
SMT process timed out in 60399ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60399ms
Starting structural reductions in LTL mode, iteration 1 : 580/595 places, 501/516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64517 ms. Remains : 580/595 places, 501/516 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-14
Stuttering criterion allowed to conclude after 182 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-14 finished in 64775 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 X((X(X(G(!p1)))||(p2 U p1)))))'
Support contains 5 out of 595 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 595/595 places, 516/516 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 584 transition count 505
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 584 transition count 505
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 580 transition count 501
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 580 transition count 501
Applied a total of 30 rules in 83 ms. Remains 580 /595 variables (removed 15) and now considering 501/516 (removed 15) transitions.
// Phase 1: matrix 501 rows 580 cols
[2025-05-30 15:23:30] [INFO ] Computed 117 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:23:31] [INFO ] Implicit Places using invariants in 871 ms returned []
[2025-05-30 15:23:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:23:34] [INFO ] Implicit Places using invariants and state equation in 3126 ms returned []
Implicit Place search using SMT with State Equation took 3998 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2025-05-30 15:23:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1081 variables, and 117 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/580 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:24] [INFO ] Deduced a trap composed of 75 places in 456 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:25] [INFO ] Deduced a trap composed of 75 places in 442 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:25] [INFO ] Deduced a trap composed of 75 places in 410 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:26] [INFO ] Deduced a trap composed of 75 places in 381 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:26] [INFO ] Deduced a trap composed of 75 places in 375 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:26] [INFO ] Deduced a trap composed of 75 places in 342 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:27] [INFO ] Deduced a trap composed of 75 places in 329 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:27] [INFO ] Deduced a trap composed of 75 places in 337 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:27] [INFO ] Deduced a trap composed of 75 places in 309 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:28] [INFO ] Deduced a trap composed of 75 places in 308 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:28] [INFO ] Deduced a trap composed of 75 places in 254 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:28] [INFO ] Deduced a trap composed of 75 places in 322 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:29] [INFO ] Deduced a trap composed of 75 places in 351 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:29] [INFO ] Deduced a trap composed of 75 places in 465 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:30] [INFO ] Deduced a trap composed of 75 places in 444 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:30] [INFO ] Deduced a trap composed of 75 places in 446 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:31] [INFO ] Deduced a trap composed of 75 places in 427 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:31] [INFO ] Deduced a trap composed of 75 places in 443 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:31] [INFO ] Deduced a trap composed of 75 places in 421 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:32] [INFO ] Deduced a trap composed of 75 places in 405 ms of which 85 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:33] [INFO ] Deduced a trap composed of 76 places in 397 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:34] [INFO ] Deduced a trap composed of 76 places in 419 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:34] [INFO ] Deduced a trap composed of 76 places in 441 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:34] [INFO ] Deduced a trap composed of 76 places in 428 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:35] [INFO ] Deduced a trap composed of 76 places in 446 ms of which 92 ms to minimize.
SMT process timed out in 60534ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60535ms
Starting structural reductions in LTL mode, iteration 1 : 580/595 places, 501/516 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64619 ms. Remains : 580/595 places, 501/516 transitions.
Stuttering acceptance computed with spot in 370 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-15
Product exploration explored 100000 steps with 554 reset in 357 ms.
Product exploration explored 100000 steps with 550 reset in 420 ms.
Computed a total of 523 stabilizing places and 454 stable transitions
Graph (complete) has 1296 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 523 stabilizing places and 454 stable transitions
Detected a total of 523/580 stabilizing places and 454/501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 388 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (219 resets) in 338 ms. (117 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (40 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (38 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (28 resets) in 123 ms. (322 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (36 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (35 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (28 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
[2025-05-30 15:24:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 150/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 270/425 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:38] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:38] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:38] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:38] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:38] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:38] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:38] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:39] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:39] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:39] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:39] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:39] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:39] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:39] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 14/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 141/566 variables, 45/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:40] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:40] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/568 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/568 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 493/1061 variables, 568/701 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:41] [INFO ] Deduced a trap composed of 77 places in 398 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:41] [INFO ] Deduced a trap composed of 77 places in 402 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:42] [INFO ] Deduced a trap composed of 77 places in 407 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:24:42] [INFO ] Deduced a trap composed of 50 places in 403 ms of which 66 ms to minimize.
SMT process timed out in 5057ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (complete) has 1296 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 579 transition count 437
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 516 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 131 place count 514 transition count 435
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 131 place count 514 transition count 311
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 273 rules applied. Total rules applied 404 place count 365 transition count 311
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 3 with 323 rules applied. Total rules applied 727 place count 201 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 728 place count 201 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 730 place count 200 transition count 154
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 736 place count 200 transition count 154
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 737 place count 199 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 738 place count 198 transition count 153
Applied a total of 738 rules in 69 ms. Remains 198 /580 variables (removed 382) and now considering 153/501 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 198/580 places, 153/501 transitions.
RANDOM walk for 40000 steps (4333 resets) in 422 ms. (94 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1065 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1072 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1073 resets) in 199 ms. (200 steps per ms) remains 2/4 properties
// Phase 1: matrix 153 rows 198 cols
[2025-05-30 15:24:43] [INFO ] Computed 86 invariants in 3 ms
[2025-05-30 15:24:43] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 42/97 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/102 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 31/133 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/140 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 153/293 variables, 140/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 58/351 variables, 58/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 27/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/351 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/351 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 288 constraints, problems are : Problem set: 0 solved, 2 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 198/198 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 42/97 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/102 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 31/133 variables, 16/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/140 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 153/293 variables, 140/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/293 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 58/351 variables, 58/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/351 variables, 27/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/351 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/351 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/351 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 290 constraints, problems are : Problem set: 0 solved, 2 unsolved in 964 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 198/198 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1316ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 153/153 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 198/198 places, 153/153 transitions.
RANDOM walk for 40000 steps (4303 resets) in 355 ms. (112 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1061 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1075 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1437 steps, run visited all 2 properties in 25 ms. (steps per millisecond=57 )
Probabilistic random walk after 1437 steps, saw 779 distinct states, run finished after 33 ms. (steps per millisecond=43 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F p1), (F p0), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 15 factoid took 1019 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 358 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Applied a total of 0 rules in 26 ms. Remains 580 /580 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 580 cols
[2025-05-30 15:24:46] [INFO ] Computed 117 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:24:47] [INFO ] Implicit Places using invariants in 890 ms returned []
[2025-05-30 15:24:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:24:50] [INFO ] Implicit Places using invariants and state equation in 2921 ms returned []
Implicit Place search using SMT with State Equation took 3813 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2025-05-30 15:24:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1081 variables, and 117 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/580 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:38] [INFO ] Deduced a trap composed of 75 places in 424 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:38] [INFO ] Deduced a trap composed of 75 places in 287 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:39] [INFO ] Deduced a trap composed of 75 places in 296 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:39] [INFO ] Deduced a trap composed of 75 places in 300 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:39] [INFO ] Deduced a trap composed of 75 places in 293 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:40] [INFO ] Deduced a trap composed of 75 places in 446 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:40] [INFO ] Deduced a trap composed of 75 places in 418 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:41] [INFO ] Deduced a trap composed of 75 places in 410 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:41] [INFO ] Deduced a trap composed of 75 places in 390 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:41] [INFO ] Deduced a trap composed of 75 places in 360 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:42] [INFO ] Deduced a trap composed of 75 places in 275 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:42] [INFO ] Deduced a trap composed of 75 places in 281 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:42] [INFO ] Deduced a trap composed of 75 places in 283 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:43] [INFO ] Deduced a trap composed of 75 places in 303 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:43] [INFO ] Deduced a trap composed of 75 places in 448 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:44] [INFO ] Deduced a trap composed of 75 places in 445 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:44] [INFO ] Deduced a trap composed of 75 places in 414 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:44] [INFO ] Deduced a trap composed of 75 places in 382 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:45] [INFO ] Deduced a trap composed of 75 places in 426 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:45] [INFO ] Deduced a trap composed of 75 places in 401 ms of which 92 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:46] [INFO ] Deduced a trap composed of 76 places in 271 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:47] [INFO ] Deduced a trap composed of 76 places in 355 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:47] [INFO ] Deduced a trap composed of 76 places in 439 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:48] [INFO ] Deduced a trap composed of 76 places in 431 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:48] [INFO ] Deduced a trap composed of 76 places in 438 ms of which 92 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:49] [INFO ] Deduced a trap composed of 76 places in 418 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:49] [INFO ] Deduced a trap composed of 76 places in 406 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:49] [INFO ] Deduced a trap composed of 76 places in 437 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:50] [INFO ] Deduced a trap composed of 76 places in 404 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:50] [INFO ] Deduced a trap composed of 76 places in 369 ms of which 71 ms to minimize.
SMT process timed out in 60345ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60347ms
Finished structural reductions in LTL mode , in 1 iterations and 64188 ms. Remains : 580/580 places, 501/501 transitions.
Computed a total of 523 stabilizing places and 454 stable transitions
Graph (complete) has 1296 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 523 stabilizing places and 454 stable transitions
Detected a total of 523/580 stabilizing places and 454/501 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 334 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (217 resets) in 321 ms. (124 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (38 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (37 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (28 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (39 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (35 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (37 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (28 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 529699 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :6 out of 7
Probabilistic random walk after 529699 steps, saw 81986 distinct states, run finished after 3003 ms. (steps per millisecond=176 ) properties seen :6
[2025-05-30 15:25: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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 124/126 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 299/425 variables, 67/70 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 15:25:55] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:55] [INFO ] Deduced a trap composed of 14 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:55] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:55] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:56] [INFO ] Deduced a trap composed of 27 places in 292 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:56] [INFO ] Deduced a trap composed of 34 places in 184 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:56] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:56] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:57] [INFO ] Deduced a trap composed of 38 places in 319 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:57] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:57] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:57] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:57] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 13/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 141/566 variables, 45/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/568 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/568 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 493/1061 variables, 568/698 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 15:25:58] [INFO ] Deduced a trap composed of 38 places in 410 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:58] [INFO ] Deduced a trap composed of 43 places in 275 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:59] [INFO ] Deduced a trap composed of 92 places in 304 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:25:59] [INFO ] Deduced a trap composed of 92 places in 446 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:00] [INFO ] Deduced a trap composed of 92 places in 460 ms of which 110 ms to minimize.
SMT process timed out in 5182ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (trivial) has 269 edges and 580 vertex of which 6 / 580 are part of one of the 1 SCC in 0 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 1289 edges and 575 vertex of which 574 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 574 transition count 429
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 510 transition count 429
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 123 Pre rules applied. Total rules applied 130 place count 510 transition count 306
Deduced a syphon composed of 123 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 401 place count 362 transition count 306
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 2 with 323 rules applied. Total rules applied 724 place count 198 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 726 place count 197 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 728 place count 197 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 730 place count 195 transition count 148
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 731 place count 195 transition count 148
Applied a total of 731 rules in 68 ms. Remains 195 /580 variables (removed 385) and now considering 148/501 (removed 353) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 195/580 places, 148/501 transitions.
RANDOM walk for 40000 steps (1786 resets) in 275 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 619 steps (12 resets) in 5 ms. (103 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F p1), (F p0), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 15 factoid took 920 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 356 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 365 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 551 reset in 299 ms.
Product exploration explored 100000 steps with 552 reset in 257 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 253 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Graph (complete) has 1296 edges and 580 vertex of which 579 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 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 579 transition count 500
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 65 place count 579 transition count 566
Deduced a syphon composed of 152 places in 2 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 153 place count 579 transition count 566
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 175 place count 557 transition count 525
Deduced a syphon composed of 130 places in 2 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 197 place count 557 transition count 525
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 323 places in 0 ms
Iterating global reduction 1 with 193 rules applied. Total rules applied 390 place count 557 transition count 525
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 436 place count 511 transition count 479
Deduced a syphon composed of 277 places in 1 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 482 place count 511 transition count 479
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 280 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 485 place count 511 transition count 491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 486 place count 511 transition count 490
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 489 place count 508 transition count 484
Deduced a syphon composed of 277 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 492 place count 508 transition count 484
Deduced a syphon composed of 277 places in 1 ms
Applied a total of 492 rules in 139 ms. Remains 508 /580 variables (removed 72) and now considering 484/501 (removed 17) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 15:26:03] [INFO ] Redundant transitions in 7 ms returned []
Running 483 sub problems to find dead transitions.
// Phase 1: matrix 484 rows 508 cols
[2025-05-30 15:26:03] [INFO ] Computed 117 invariants in 17 ms
[2025-05-30 15:26:03] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 2 (OVERLAPS) 1/508 variables, 71/116 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/992 variables, and 117 constraints, problems are : Problem set: 0 solved, 483 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/508 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 483/483 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 483 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/507 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/507 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 2 (OVERLAPS) 1/508 variables, 71/116 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:50] [INFO ] Deduced a trap composed of 3 places in 312 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:50] [INFO ] Deduced a trap composed of 4 places in 467 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:51] [INFO ] Deduced a trap composed of 4 places in 493 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:51] [INFO ] Deduced a trap composed of 4 places in 486 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:51] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:52] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:52] [INFO ] Deduced a trap composed of 4 places in 405 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:53] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:53] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:54] [INFO ] Deduced a trap composed of 3 places in 466 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:54] [INFO ] Deduced a trap composed of 5 places in 436 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:55] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:55] [INFO ] Deduced a trap composed of 3 places in 382 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:55] [INFO ] Deduced a trap composed of 6 places in 410 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:56] [INFO ] Deduced a trap composed of 14 places in 450 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:56] [INFO ] Deduced a trap composed of 37 places in 439 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:57] [INFO ] Deduced a trap composed of 46 places in 431 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:57] [INFO ] Deduced a trap composed of 48 places in 432 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:58] [INFO ] Deduced a trap composed of 3 places in 407 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:58] [INFO ] Deduced a trap composed of 3 places in 407 ms of which 18 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 20/137 constraints. Problems are: Problem set: 97 solved, 386 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:59] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:26:59] [INFO ] Deduced a trap composed of 4 places in 316 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:27:00] [INFO ] Deduced a trap composed of 14 places in 437 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:27:00] [INFO ] Deduced a trap composed of 36 places in 462 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:27:01] [INFO ] Deduced a trap composed of 45 places in 453 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:27:01] [INFO ] Deduced a trap composed of 47 places in 468 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:27:02] [INFO ] Deduced a trap composed of 47 places in 451 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:27:02] [INFO ] Deduced a trap composed of 45 places in 445 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:27:02] [INFO ] Deduced a trap composed of 37 places in 463 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:27:03] [INFO ] Deduced a trap composed of 46 places in 444 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:27:03] [INFO ] Deduced a trap composed of 48 places in 466 ms of which 57 ms to minimize.
SMT process timed out in 60647ms, After SMT, problems are : Problem set: 97 solved, 386 unsolved
Search for dead transitions found 97 dead transitions in 60649ms
Found 97 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 97 transitions
Dead transitions reduction (with SMT) removed 97 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 508/580 places, 387/501 transitions.
Graph (complete) has 1336 edges and 508 vertex of which 425 are kept as prefixes of interest. Removing 83 places using SCC suffix rule.2 ms
Discarding 83 places :
Also discarding 0 output transitions
Deduced a syphon composed of 194 places in 0 ms
Applied a total of 1 rules in 16 ms. Remains 425 /508 variables (removed 83) and now considering 387/387 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 425/580 places, 387/501 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60825 ms. Remains : 425/580 places, 387/501 transitions.
Built C files in :
/tmp/ltsmin7482833880488104151
[2025-05-30 15:27:04] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7482833880488104151
Running compilation step : cd /tmp/ltsmin7482833880488104151;'/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 1427 ms.
Running link step : cd /tmp/ltsmin7482833880488104151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7482833880488104151;'/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/stateBased11564340346417777150.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 501/501 transitions.
Applied a total of 0 rules in 17 ms. Remains 580 /580 variables (removed 0) and now considering 501/501 (removed 0) transitions.
// Phase 1: matrix 501 rows 580 cols
[2025-05-30 15:27:19] [INFO ] Computed 117 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:27:19] [INFO ] Implicit Places using invariants in 584 ms returned []
[2025-05-30 15:27:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 15:27:23] [INFO ] Implicit Places using invariants and state equation in 3725 ms returned []
Implicit Place search using SMT with State Equation took 4311 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2025-05-30 15:27:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 580/1081 variables, and 117 constraints, problems are : Problem set: 0 solved, 500 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 47/47 constraints, State Equation: 0/580 constraints, PredecessorRefiner: 500/500 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:12] [INFO ] Deduced a trap composed of 75 places in 449 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:12] [INFO ] Deduced a trap composed of 75 places in 453 ms of which 97 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:13] [INFO ] Deduced a trap composed of 75 places in 444 ms of which 96 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:13] [INFO ] Deduced a trap composed of 75 places in 424 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:14] [INFO ] Deduced a trap composed of 75 places in 419 ms of which 93 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:14] [INFO ] Deduced a trap composed of 75 places in 433 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:15] [INFO ] Deduced a trap composed of 75 places in 410 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:15] [INFO ] Deduced a trap composed of 75 places in 415 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:15] [INFO ] Deduced a trap composed of 75 places in 401 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:16] [INFO ] Deduced a trap composed of 75 places in 387 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:16] [INFO ] Deduced a trap composed of 75 places in 417 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:17] [INFO ] Deduced a trap composed of 75 places in 405 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:17] [INFO ] Deduced a trap composed of 75 places in 369 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:17] [INFO ] Deduced a trap composed of 75 places in 396 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:18] [INFO ] Deduced a trap composed of 75 places in 384 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:18] [INFO ] Deduced a trap composed of 75 places in 384 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:19] [INFO ] Deduced a trap composed of 75 places in 342 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:19] [INFO ] Deduced a trap composed of 75 places in 327 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:19] [INFO ] Deduced a trap composed of 75 places in 373 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:20] [INFO ] Deduced a trap composed of 75 places in 407 ms of which 94 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 500 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:21] [INFO ] Deduced a trap composed of 76 places in 434 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:22] [INFO ] Deduced a trap composed of 76 places in 458 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:22] [INFO ] Deduced a trap composed of 76 places in 410 ms of which 91 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:22] [INFO ] Deduced a trap composed of 76 places in 380 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:23] [INFO ] Deduced a trap composed of 76 places in 360 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 15:28:23] [INFO ] Deduced a trap composed of 76 places in 334 ms of which 66 ms to minimize.
SMT process timed out in 60157ms, After SMT, problems are : Problem set: 0 solved, 500 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Finished structural reductions in LTL mode , in 1 iterations and 64497 ms. Remains : 580/580 places, 501/501 transitions.
Built C files in :
/tmp/ltsmin18114585950240790947
[2025-05-30 15:28:23] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18114585950240790947
Running compilation step : cd /tmp/ltsmin18114585950240790947;'/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 1397 ms.
Running link step : cd /tmp/ltsmin18114585950240790947;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18114585950240790947;'/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/stateBased7042651365733592122.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 15:28:38] [INFO ] Flatten gal took : 32 ms
[2025-05-30 15:28:38] [INFO ] Flatten gal took : 17 ms
[2025-05-30 15:28:38] [INFO ] Time to serialize gal into /tmp/LTL12367140274843443247.gal : 3 ms
[2025-05-30 15:28:38] [INFO ] Time to serialize properties into /tmp/LTL12910820689832577209.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12367140274843443247.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8554163058935121907.hoa' '-atoms' '/tmp/LTL12910820689832577209.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12910820689832577209.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8554163058935121907.hoa
Detected timeout of ITS tools.
[2025-05-30 15:28:53] [INFO ] Flatten gal took : 16 ms
[2025-05-30 15:28:53] [INFO ] Flatten gal took : 16 ms
[2025-05-30 15:28:53] [INFO ] Time to serialize gal into /tmp/LTL16473392391555183540.gal : 4 ms
[2025-05-30 15:28:53] [INFO ] Time to serialize properties into /tmp/LTL15980321316547197664.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16473392391555183540.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15980321316547197664.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F("((p449==1)&&(p606==1))"))U(X((X(X(G(!("(((p146==1)&&(p482==1))&&(p737==1))")))))||(("(p606==1)")U("(((p146==1)&&(p482==1))&&(p7...169
Formula 0 simplified : G!"((p449==1)&&(p606==1))" R X(XXF"(((p146==1)&&(p482==1))&&(p737==1))" & (!"(p606==1)" R !"(((p146==1)&&(p482==1))&&(p737==1))"))
Detected timeout of ITS tools.
[2025-05-30 15:29:08] [INFO ] Flatten gal took : 14 ms
[2025-05-30 15:29:08] [INFO ] Applying decomposition
[2025-05-30 15:29:09] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11231058962330019284.txt' '-o' '/tmp/graph11231058962330019284.bin' '-w' '/tmp/graph11231058962330019284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11231058962330019284.bin' '-l' '-1' '-v' '-w' '/tmp/graph11231058962330019284.weights' '-q' '0' '-e' '0.001'
[2025-05-30 15:29:09] [INFO ] Decomposing Gal with order
[2025-05-30 15:29:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 15:29:09] [INFO ] Removed a total of 290 redundant transitions.
[2025-05-30 15:29:09] [INFO ] Flatten gal took : 41 ms
[2025-05-30 15:29:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 13 ms.
[2025-05-30 15:29:09] [INFO ] Time to serialize gal into /tmp/LTL7995826341507162269.gal : 8 ms
[2025-05-30 15:29:09] [INFO ] Time to serialize properties into /tmp/LTL4199905715691509097.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7995826341507162269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4199905715691509097.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((F("((i4.i2.u135.p449==1)&&(i9.i1.u165.p606==1))"))U(X((X(X(G(!("(((i3.i1.u49.p146==1)&&(i10.u142.p482==1))&&(i9.i1.u165.p737==1))"...262
Formula 0 simplified : G!"((i4.i2.u135.p449==1)&&(i9.i1.u165.p606==1))" R X(XXF"(((i3.i1.u49.p146==1)&&(i10.u142.p482==1))&&(i9.i1.u165.p737==1))" & (!"(i9...246
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t10, t216, t301, t321, t329, t358, t403, t406, t479, t480, t484, t486, t488, t489...1572
Computing Next relation with stutter on 109584 deadlock states
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-19-LTLFireability-15 finished in 353451 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((X(G(p0)) U (p1||X(X(X(F(!p1))))))))'
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&&F(G(p1))) U (F(p2) U X(X(!p0)))))'
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 X((X(X(G(!p1)))||(p2 U p1)))))'
[2025-05-30 15:29:24] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12964596492080582759
[2025-05-30 15:29:24] [INFO ] Computing symmetric may disable matrix : 516 transitions.
[2025-05-30 15:29:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 15:29:24] [INFO ] Applying decomposition
[2025-05-30 15:29:24] [INFO ] Computing symmetric may enable matrix : 516 transitions.
[2025-05-30 15:29:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 15:29:24] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6527205199014927601.txt' '-o' '/tmp/graph6527205199014927601.bin' '-w' '/tmp/graph6527205199014927601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6527205199014927601.bin' '-l' '-1' '-v' '-w' '/tmp/graph6527205199014927601.weights' '-q' '0' '-e' '0.001'
[2025-05-30 15:29:24] [INFO ] Decomposing Gal with order
[2025-05-30 15:29:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 15:29:24] [INFO ] Computing Do-Not-Accords matrix : 516 transitions.
[2025-05-30 15:29:24] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 15:29:24] [INFO ] Removed a total of 287 redundant transitions.
[2025-05-30 15:29:24] [INFO ] Built C files in 181ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12964596492080582759
Running compilation step : cd /tmp/ltsmin12964596492080582759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' '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'
[2025-05-30 15:29:24] [INFO ] Flatten gal took : 57 ms
[2025-05-30 15:29:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 11 ms.
[2025-05-30 15:29:24] [INFO ] Time to serialize gal into /tmp/LTLFireability14205817807037073865.gal : 20 ms
[2025-05-30 15:29:25] [INFO ] Time to serialize properties into /tmp/LTLFireability13783489608369615335.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14205817807037073865.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13783489608369615335.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 3 LTL properties
Checking formula 0 : !((G((X(G("(i2.u8.p18==1)")))U(("(i12.i1.u141.p470==1)")||(X(X(X(F("(i12.i1.u141.p470!=1)")))))))))
Formula 0 simplified : F(XF!"(i2.u8.p18==1)" R (!"(i12.i1.u141.p470==1)" & XXXG!"(i12.i1.u141.p470!=1)"))
Compilation finished in 1853 ms.
Running link step : cd /tmp/ltsmin12964596492080582759;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin12964596492080582759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X([]((LTLAPp0==true))) U ((LTLAPp1==true)||X(X(X(<>(!(LTLAPp1==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t216, t301, t317, t325, t329, t406, t479, t480, t486, t488, t491, t493, t511, i0....1739
Computing Next relation with stutter on 109584 deadlock states
LTSmin run took 72932 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin12964596492080582759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp2==true)&&<>([]((LTLAPp3==true)))) U (<>((LTLAPp4==true)) U X(X(!(LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 245 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin12964596492080582759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp5==true)) U X((X(X([](!(LTLAPp6==true))))||((LTLAPp7==true) U (LTLAPp6==true)))))' '--buchi-type=spotba'
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
5410 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,54.2362,985940,1,0,1.67536e+06,1221,9258,3.80687e+06,354,4429,3388657
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Checking formula 1 : !(((("(i9.i3.u100.p316!=1)")&&(F(G("(i18.i2.u151.p516!=1)"))))U((F("(((i16.i0.u38.p100==1)&&(i13.i1.u134.p443==1))&&(i16.i0.u174.p618=...196
Formula 1 simplified : (!"(i9.i3.u100.p316!=1)" | GF!"(i18.i2.u151.p516!=1)") R (G!"(((i16.i0.u38.p100==1)&&(i13.i1.u134.p443==1))&&(i16.i0.u174.p618==1))"...184
Computing Next relation with stutter on 109584 deadlock states
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin12964596492080582759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp5==true)) U X((X(X([](!(LTLAPp6==true))))||((LTLAPp7==true) U (LTLAPp6==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin12964596492080582759;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp5==true)) U X((X(X([](!(LTLAPp6==true))))||((LTLAPp7==true) U (LTLAPp6==true)))))' '--buchi-type=spotba'
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
35684 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,411.092,2201476,1,0,2.99561e+06,1259,2950,1.09687e+07,155,4829,1579762
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
Checking formula 2 : !(((F("((i16.i2.u136.p449==1)&&(i20.u162.p606==1))"))U(X((X(X(G(!("(((i3.u50.p146==1)&&(i17.i0.u143.p482==1))&&(i20.u162.p737==1))")))...255
Formula 2 simplified : G!"((i16.i2.u136.p449==1)&&(i20.u162.p606==1))" R X(XXF"(((i3.u50.p146==1)&&(i17.i0.u143.p482==1))&&(i20.u162.p737==1))" & (!"(i20.u...239
Computing Next relation with stutter on 109584 deadlock states
Detected timeout of ITS tools.
[2025-05-30 15:59:16] [INFO ] Applying decomposition
[2025-05-30 15:59:16] [INFO ] Flatten gal took : 51 ms
[2025-05-30 15:59:16] [INFO ] Decomposing Gal with order
[2025-05-30 15:59:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 15:59:17] [INFO ] Removed a total of 141 redundant transitions.
[2025-05-30 15:59:17] [INFO ] Flatten gal took : 120 ms
[2025-05-30 15:59:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 882 ms.
[2025-05-30 15:59:18] [INFO ] Time to serialize gal into /tmp/LTLFireability14907753761812355745.gal : 54 ms
[2025-05-30 15:59:18] [INFO ] Time to serialize properties into /tmp/LTLFireability17378443568224406335.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14907753761812355745.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17378443568224406335.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !(((F("((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u145.p449==1)&&(i1.u182.p606==1))"))U(X((X(X(G(!("(((...536
Formula 0 simplified : G!"((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u145.p449==1)&&(i1.u182.p606==1))" R X(XXF"(((i0.i0.i0....520
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-19"
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-19, 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-174853813400148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-19.tgz
mv BusinessProcesses-PT-19 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;