Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399800588.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BusinessProcesses-PT-18, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399800588
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 177K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-18-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717226066675

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:14:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:14:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:14:28] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2024-06-01 07:14:28] [INFO ] Transformed 717 places.
[2024-06-01 07:14:28] [INFO ] Transformed 642 transitions.
[2024-06-01 07:14:28] [INFO ] Found NUPN structural information;
[2024-06-01 07:14:28] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 411 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 15 places in 29 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 102 place count 600 transition count 533
Iterating global reduction 1 with 94 rules applied. Total rules applied 196 place count 600 transition count 533
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 243 place count 553 transition count 486
Iterating global reduction 1 with 47 rules applied. Total rules applied 290 place count 553 transition count 486
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 291 place count 552 transition count 485
Iterating global reduction 1 with 1 rules applied. Total rules applied 292 place count 552 transition count 485
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 293 place count 551 transition count 484
Iterating global reduction 1 with 1 rules applied. Total rules applied 294 place count 551 transition count 484
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 295 place count 550 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 296 place count 550 transition count 483
Applied a total of 296 rules in 523 ms. Remains 550 /702 variables (removed 152) and now considering 483/627 (removed 144) transitions.
// Phase 1: matrix 483 rows 550 cols
[2024-06-01 07:14:29] [INFO ] Computed 106 invariants in 48 ms
[2024-06-01 07:14:30] [INFO ] Implicit Places using invariants in 689 ms returned []
[2024-06-01 07:14:30] [INFO ] Invariant cache hit.
[2024-06-01 07:14:31] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1783 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-06-01 07:14:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/549 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/549 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/550 variables, 65/106 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 77 places in 181 ms of which 27 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:14:40] [INFO ] Deduced a trap composed of 109 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 111 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 112 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 118 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:14:41] [INFO ] Deduced a trap composed of 105 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 5 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 104 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:14:42] [INFO ] Deduced a trap composed of 102 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 80 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:14:47] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 78 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 114 places in 116 ms of which 6 ms to minimize.
[2024-06-01 07:14:48] [INFO ] Deduced a trap composed of 129 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:14:49] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:14:50] [INFO ] Deduced a trap composed of 111 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 110 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 4 ms to minimize.
[2024-06-01 07:14:51] [INFO ] Deduced a trap composed of 109 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 103 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 2 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 101 places in 163 ms of which 5 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:14:52] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 3 ms to minimize.
Problem TDEAD400 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 20/166 constraints. Problems are: Problem set: 16 solved, 466 unsolved
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 104 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 137 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:14:53] [INFO ] Deduced a trap composed of 129 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 111 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 105 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:14:54] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 108 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 105 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 103 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:14:55] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 3 ms to minimize.
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 20/186 constraints. Problems are: Problem set: 31 solved, 451 unsolved
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 135 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 134 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 107 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 130 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 105 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 103 places in 152 ms of which 3 ms to minimize.
SMT process timed out in 30244ms, After SMT, problems are : Problem set: 31 solved, 451 unsolved
Search for dead transitions found 31 dead transitions in 30293ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 550/702 places, 452/627 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 549 transition count 452
Applied a total of 1 rules in 15 ms. Remains 549 /550 variables (removed 1) and now considering 452/452 (removed 0) transitions.
// Phase 1: matrix 452 rows 549 cols
[2024-06-01 07:15:01] [INFO ] Computed 110 invariants in 13 ms
[2024-06-01 07:15:02] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-06-01 07:15:02] [INFO ] Invariant cache hit.
[2024-06-01 07:15:02] [INFO ] Implicit Places using invariants and state equation in 589 ms returned [123, 126]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 811 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 547/702 places, 452/627 transitions.
Applied a total of 0 rules in 10 ms. Remains 547 /547 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 33502 ms. Remains : 547/702 places, 452/627 transitions.
Support contains 42 out of 547 places after structural reductions.
[2024-06-01 07:15:02] [INFO ] Flatten gal took : 71 ms
[2024-06-01 07:15:03] [INFO ] Flatten gal took : 42 ms
[2024-06-01 07:15:03] [INFO ] Input system was already deterministic with 452 transitions.
RANDOM walk for 40000 steps (202 resets) in 1917 ms. (20 steps per ms) remains 12/31 properties
BEST_FIRST walk for 40004 steps (37 resets) in 157 ms. (253 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (36 resets) in 262 ms. (152 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (38 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (37 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (36 resets) in 166 ms. (239 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (34 resets) in 159 ms. (250 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (36 resets) in 132 ms. (300 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (36 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (36 resets) in 162 ms. (245 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (38 resets) in 111 ms. (357 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (30 resets) in 132 ms. (300 steps per ms) remains 11/11 properties
// Phase 1: matrix 452 rows 547 cols
[2024-06-01 07:15:04] [INFO ] Computed 108 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 155/171 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 236/407 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 126/533 variables, 42/107 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 2/535 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 444/979 variables, 535/643 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/979 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 17/996 variables, 9/652 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/996 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 3/999 variables, 3/655 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/999 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/999 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 999/999 variables, and 655 constraints, problems are : Problem set: 0 solved, 11 unsolved in 986 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 547/547 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 155/171 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 236/407 variables, 57/65 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:15:05] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:15:06] [INFO ] Deduced a trap composed of 72 places in 92 ms of which 3 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:15:07] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 3 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:15:08] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 126/533 variables, 42/142 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 110 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 4 ms to minimize.
[2024-06-01 07:15:09] [INFO ] Deduced a trap composed of 112 places in 162 ms of which 4 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 102 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 111 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:15:10] [INFO ] Deduced a trap composed of 108 places in 155 ms of which 3 ms to minimize.
SMT process timed out in 6142ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 452/452 transitions.
Graph (complete) has 1149 edges and 547 vertex of which 546 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 546 transition count 389
Reduce places removed 62 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 65 rules applied. Total rules applied 128 place count 484 transition count 386
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 131 place count 481 transition count 386
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 131 place count 481 transition count 276
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 23 places
Reduce places removed 133 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 374 place count 348 transition count 276
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 381 place count 341 transition count 269
Iterating global reduction 3 with 7 rules applied. Total rules applied 388 place count 341 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 390 place count 341 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 391 place count 340 transition count 267
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 5 with 293 rules applied. Total rules applied 684 place count 190 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 685 place count 190 transition count 123
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 6 with 2 rules applied. Total rules applied 687 place count 189 transition count 126
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 695 place count 189 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 696 place count 188 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 697 place count 187 transition count 125
Applied a total of 697 rules in 95 ms. Remains 187 /547 variables (removed 360) and now considering 125/452 (removed 327) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 187/547 places, 125/452 transitions.
RANDOM walk for 40000 steps (3197 resets) in 1701 ms. (23 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (1046 resets) in 225 ms. (177 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (1045 resets) in 329 ms. (121 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (1058 resets) in 244 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1043 resets) in 289 ms. (137 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1027 resets) in 210 ms. (189 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (1068 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1040 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1069 resets) in 181 ms. (219 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (1032 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (996 resets) in 150 ms. (264 steps per ms) remains 10/10 properties
Finished probabilistic random walk after 970434 steps, run visited all 10 properties in 2849 ms. (steps per millisecond=340 )
Probabilistic random walk after 970434 steps, saw 260436 distinct states, run finished after 2866 ms. (steps per millisecond=338 ) properties seen :10
FORMULA BusinessProcesses-PT-18-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 489 stabilizing places and 403 stable transitions
Graph (complete) has 1149 edges and 547 vertex of which 546 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.22 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 452/452 transitions.
Graph (trivial) has 270 edges and 547 vertex of which 7 / 547 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1141 edges and 541 vertex of which 540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 539 transition count 374
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 471 transition count 374
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 115 Pre rules applied. Total rules applied 138 place count 471 transition count 259
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 2 with 255 rules applied. Total rules applied 393 place count 331 transition count 259
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 404 place count 320 transition count 248
Iterating global reduction 2 with 11 rules applied. Total rules applied 415 place count 320 transition count 248
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 22 ms
Ensure Unique test removed 7 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 291 rules applied. Total rules applied 706 place count 171 transition count 106
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 708 place count 170 transition count 109
Applied a total of 708 rules in 102 ms. Remains 170 /547 variables (removed 377) and now considering 109/452 (removed 343) transitions.
// Phase 1: matrix 109 rows 170 cols
[2024-06-01 07:15:15] [INFO ] Computed 76 invariants in 1 ms
[2024-06-01 07:15:21] [INFO ] Implicit Places using invariants in 6026 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 6029 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/547 places, 109/452 transitions.
Applied a total of 0 rules in 11 ms. Remains 142 /142 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6144 ms. Remains : 142/547 places, 109/452 transitions.
Stuttering acceptance computed with spot in 297 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-00 finished in 6550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((p1||(!p1 U p0)))))'
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 452/452 transitions.
Graph (trivial) has 267 edges and 547 vertex of which 7 / 547 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1141 edges and 541 vertex of which 540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 539 transition count 376
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 473 transition count 376
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 134 place count 473 transition count 262
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 387 place count 334 transition count 262
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 397 place count 324 transition count 252
Iterating global reduction 2 with 10 rules applied. Total rules applied 407 place count 324 transition count 252
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 293 rules applied. Total rules applied 700 place count 174 transition count 109
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 702 place count 173 transition count 112
Applied a total of 702 rules in 81 ms. Remains 173 /547 variables (removed 374) and now considering 112/452 (removed 340) transitions.
// Phase 1: matrix 112 rows 173 cols
[2024-06-01 07:15:22] [INFO ] Computed 76 invariants in 2 ms
[2024-06-01 07:15:22] [INFO ] Implicit Places using invariants in 219 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 222 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/547 places, 112/452 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 309 ms. Remains : 145/547 places, 112/452 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-01 finished in 489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(G(p1))))))'
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 452/452 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 534 transition count 439
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 534 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 534 transition count 438
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 529 transition count 433
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 529 transition count 433
Applied a total of 37 rules in 46 ms. Remains 529 /547 variables (removed 18) and now considering 433/452 (removed 19) transitions.
// Phase 1: matrix 433 rows 529 cols
[2024-06-01 07:15:22] [INFO ] Computed 108 invariants in 8 ms
[2024-06-01 07:15:22] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-06-01 07:15:22] [INFO ] Invariant cache hit.
[2024-06-01 07:15:23] [INFO ] Implicit Places using invariants and state equation in 792 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2024-06-01 07:15:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (OVERLAPS) 1/529 variables, 65/108 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 98 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 72 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:15:33] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 97 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 99 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:15:34] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 100 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 88 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 92 places in 184 ms of which 2 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 96 places in 177 ms of which 5 ms to minimize.
[2024-06-01 07:15:36] [INFO ] Deduced a trap composed of 88 places in 152 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 81 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 85 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 79 places in 210 ms of which 3 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 96 places in 212 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 77 places in 186 ms of which 3 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 80 places in 222 ms of which 4 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 81 places in 182 ms of which 5 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 76 places in 182 ms of which 7 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 79 places in 183 ms of which 5 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 82 places in 205 ms of which 3 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 97 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 73 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 92 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 90 places in 183 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 92 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 91 places in 157 ms of which 4 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 5 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 84 places in 189 ms of which 8 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 76 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 79 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 92 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:15:49] [INFO ] Deduced a trap composed of 81 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 96 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 88 places in 206 ms of which 5 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 90 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:15:51] [INFO ] Deduced a trap composed of 98 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 93 places in 180 ms of which 2 ms to minimize.
[2024-06-01 07:15:52] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/962 variables, and 188 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/529 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (OVERLAPS) 1/529 variables, 65/108 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 80/188 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 95 places in 235 ms of which 5 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 97 places in 192 ms of which 3 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 91 places in 192 ms of which 5 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 93 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 80 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 77 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 77 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 75 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 100 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 98 places in 201 ms of which 11 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 95 places in 189 ms of which 5 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 95 places in 160 ms of which 5 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 96 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 81 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 97 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 5 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 124 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 81 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 125 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 84 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 119 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 88 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 123 places in 167 ms of which 15 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 82 places in 207 ms of which 6 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 7 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 99 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 84 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 80 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 96 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 95 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 4 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 96 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 97 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 79 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 98 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 20/288 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 87 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 83 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 4 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 20/308 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 83 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/962 variables, and 317 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/529 constraints, PredecessorRefiner: 0/432 constraints, Known Traps: 209/209 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60204ms
Starting structural reductions in LTL mode, iteration 1 : 529/547 places, 433/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61421 ms. Remains : 529/547 places, 433/452 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-02 finished in 61722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((X((p1 U X(p2))) U (p3&&X((p1 U X(p2))))))||p0))))'
Support contains 5 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 452/452 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 537 transition count 442
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 537 transition count 442
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 534 transition count 439
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 534 transition count 439
Applied a total of 26 rules in 51 ms. Remains 534 /547 variables (removed 13) and now considering 439/452 (removed 13) transitions.
// Phase 1: matrix 439 rows 534 cols
[2024-06-01 07:16:24] [INFO ] Computed 108 invariants in 10 ms
[2024-06-01 07:16:24] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-06-01 07:16:24] [INFO ] Invariant cache hit.
[2024-06-01 07:16:25] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 884 ms to find 0 implicit places.
Running 438 sub problems to find dead transitions.
[2024-06-01 07:16:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (OVERLAPS) 1/534 variables, 65/108 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 100 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 101 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 100 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 99 places in 112 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 114 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 96 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 116 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 106 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 4 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:16:43] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 4 ms to minimize.
[2024-06-01 07:16:44] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 99 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 96 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:16:45] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:16:46] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 123 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 114 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:16:47] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 101 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 99 places in 181 ms of which 4 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 100 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 94 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:16:53] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 105 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:54] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/973 variables, and 208 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/534 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/533 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/533 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (OVERLAPS) 1/534 variables, 65/108 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/534 variables, 100/208 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 97 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 4 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 95 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 118 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 101 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:17:08] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:17:09] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:17:10] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 44 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 36 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 3 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 20/288 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 95 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 77 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 20 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 22 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:17:20] [INFO ] Deduced a trap composed of 18 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 29 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:17:21] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 20/308 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 81 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:17:23] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:24] [INFO ] Deduced a trap composed of 139 places in 254 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/973 variables, and 312 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/534 constraints, PredecessorRefiner: 0/438 constraints, Known Traps: 204/204 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 438 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in LTL mode, iteration 1 : 534/547 places, 439/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61081 ms. Remains : 534/547 places, 439/452 transitions.
Stuttering acceptance computed with spot in 528 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-03
Entered a terminal (fully accepting) state of product in 6483 steps with 34 reset in 90 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-03 finished in 61742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p1)||p0)))'
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 452/452 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 533 transition count 438
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 533 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 533 transition count 437
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 528 transition count 432
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 528 transition count 432
Applied a total of 39 rules in 40 ms. Remains 528 /547 variables (removed 19) and now considering 432/452 (removed 20) transitions.
// Phase 1: matrix 432 rows 528 cols
[2024-06-01 07:17:26] [INFO ] Computed 108 invariants in 11 ms
[2024-06-01 07:17:26] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-06-01 07:17:26] [INFO ] Invariant cache hit.
[2024-06-01 07:17:27] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-06-01 07:17:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 1/528 variables, 65/108 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 74 places in 151 ms of which 5 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 93 places in 167 ms of which 5 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 76 places in 196 ms of which 6 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 72 places in 233 ms of which 6 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 73 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 73 places in 198 ms of which 3 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 94 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 78 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 78 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 97 places in 183 ms of which 4 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 93 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 95 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:17:41] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 5 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 75 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:17:42] [INFO ] Deduced a trap composed of 90 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 93 places in 197 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:17:43] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 93 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 91 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 71 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 89 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 85 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 73 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 73 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 93 places in 226 ms of which 5 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 95 places in 178 ms of which 4 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 95 places in 161 ms of which 5 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 74 places in 179 ms of which 4 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 76 places in 154 ms of which 5 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 5 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 76 places in 152 ms of which 5 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 79 places in 152 ms of which 5 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 83 places in 151 ms of which 4 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 5 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 126 places in 171 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 8 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 101 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 100 places in 196 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 101 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 89 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 110 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 94 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/960 variables, and 188 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/528 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 1/528 variables, 65/108 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 80/188 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 82 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 81 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 98 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 81 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 101 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 4 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 36 places in 173 ms of which 4 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 73 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 74 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 122 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 130 places in 213 ms of which 7 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 129 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 102 places in 242 ms of which 7 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 99 places in 200 ms of which 4 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 101 places in 157 ms of which 5 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 95 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 4 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 125 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 94 places in 187 ms of which 2 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 98 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 89 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 90 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 75 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 4 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:18:11] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:18:12] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 88 places in 167 ms of which 4 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 92 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:18:13] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 5 ms to minimize.
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 85 places in 141 ms of which 4 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 88 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 4 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 94 places in 164 ms of which 4 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 109 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 78 places in 163 ms of which 5 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 78 places in 216 ms of which 5 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 48 places in 200 ms of which 6 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 5 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 3 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 2 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 51 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 6 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:18:23] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:18:24] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 20/288 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 528/960 variables, and 288 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/528 constraints, PredecessorRefiner: 0/431 constraints, Known Traps: 180/180 constraints]
After SMT, in 60168ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 528/547 places, 432/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61273 ms. Remains : 528/547 places, 432/452 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-04
Entered a terminal (fully accepting) state of product in 37 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-04 finished in 61446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p0&&G(F(((p0&&X((p1||F(p2))))||G((p1||F(p2)))))))))))'
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 452/452 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 535 transition count 440
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 535 transition count 440
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 535 transition count 439
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 530 transition count 434
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 530 transition count 434
Applied a total of 35 rules in 44 ms. Remains 530 /547 variables (removed 17) and now considering 434/452 (removed 18) transitions.
// Phase 1: matrix 434 rows 530 cols
[2024-06-01 07:18:27] [INFO ] Computed 108 invariants in 3 ms
[2024-06-01 07:18:27] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-06-01 07:18:27] [INFO ] Invariant cache hit.
[2024-06-01 07:18:28] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 1002 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-06-01 07:18:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/529 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/529 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/530 variables, 65/108 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 74 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:18:34] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 4 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 5 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 99 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 94 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:18:35] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 98 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:18:36] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 5 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 4 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 97 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 93 places in 206 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:18:40] [INFO ] Deduced a trap composed of 94 places in 184 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 101 places in 178 ms of which 2 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 95 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 102 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:18:41] [INFO ] Deduced a trap composed of 98 places in 217 ms of which 3 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 94 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 96 places in 223 ms of which 7 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 94 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 98 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 97 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 97 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 4 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 94 places in 188 ms of which 1 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 94 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 4 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 4 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 105 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 4 ms to minimize.
[2024-06-01 07:18:53] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 5 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 101 places in 150 ms of which 5 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 98 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 76 places in 162 ms of which 4 ms to minimize.
[2024-06-01 07:18:54] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 89 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 89 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 98 places in 189 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 98 places in 182 ms of which 4 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 98 places in 160 ms of which 5 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 91 places in 195 ms of which 6 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 88 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 102 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 94 places in 161 ms of which 2 ms to minimize.
SMT process timed out in 30193ms, After SMT, problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 30199ms
Starting structural reductions in LTL mode, iteration 1 : 530/547 places, 434/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31247 ms. Remains : 530/547 places, 434/452 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-06
Product exploration explored 100000 steps with 522 reset in 455 ms.
Product exploration explored 100000 steps with 531 reset in 413 ms.
Computed a total of 475 stabilizing places and 389 stable transitions
Graph (complete) has 1127 edges and 530 vertex of which 529 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 475 stabilizing places and 389 stable transitions
Detected a total of 475/530 stabilizing places and 389/434 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 323 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
RANDOM walk for 40000 steps (200 resets) in 460 ms. (86 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (33 resets) in 219 ms. (181 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (34 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (38 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
[2024-06-01 07:19:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 333/391 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 30 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 127/518 variables, 43/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 426/944 variables, 518/633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/944 variables, 2/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/944 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 17/961 variables, 9/644 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/961 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/961 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 3/964 variables, 3/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/964 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/964 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 964/964 variables, and 648 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1748 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 530/530 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 333/391 variables, 62/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:19:02] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:19:03] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 127/518 variables, 43/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 426/944 variables, 518/645 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/944 variables, 3/648 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 34 places in 189 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/944 variables, 5/653 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:19:05] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/944 variables, 1/654 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/944 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 17/961 variables, 9/663 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/961 variables, 1/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/961 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 3/964 variables, 3/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/964 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/964 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 964/964 variables, and 667 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2867 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 530/530 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 26/26 constraints]
After SMT, in 4626ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 1750 ms.
Support contains 3 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 434/434 transitions.
Graph (trivial) has 250 edges and 530 vertex of which 6 / 530 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 1112 edges and 525 vertex of which 524 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 524 transition count 366
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 464 transition count 366
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 122 place count 464 transition count 253
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 373 place count 326 transition count 253
Performed 145 Post agglomeration using F-continuation condition.Transition count delta: 145
Deduced a syphon composed of 145 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 297 rules applied. Total rules applied 670 place count 174 transition count 108
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 672 place count 173 transition count 111
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 673 place count 173 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 674 place count 172 transition count 110
Applied a total of 674 rules in 75 ms. Remains 172 /530 variables (removed 358) and now considering 110/434 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 172/530 places, 110/434 transitions.
RANDOM walk for 40000 steps (2020 resets) in 484 ms. (82 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (578 resets) in 141 ms. (281 steps per ms) remains 1/2 properties
// Phase 1: matrix 110 rows 172 cols
[2024-06-01 07:19:07] [INFO ] Computed 76 invariants in 2 ms
[2024-06-01 07:19:07] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 139/150 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:19:07] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:19:07] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:19:07] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:19:07] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:19:08] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:19:08] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/168 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 110/278 variables, 168/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 8/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/282 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/282 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 172/172 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 139/150 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 6/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/168 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 110/278 variables, 168/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 8/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/282 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/282 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/282 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 183 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 172/172 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 736ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 110/110 transitions.
Applied a total of 0 rules in 7 ms. Remains 172 /172 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 172/172 places, 110/110 transitions.
RANDOM walk for 40000 steps (2062 resets) in 287 ms. (138 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (575 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 127222 steps, run visited all 1 properties in 337 ms. (steps per millisecond=377 )
Probabilistic random walk after 127222 steps, saw 33385 distinct states, run finished after 337 ms. (steps per millisecond=377 ) properties seen :1
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 15 factoid took 958 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Support contains 3 out of 530 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 530/530 places, 434/434 transitions.
Graph (trivial) has 250 edges and 530 vertex of which 6 / 530 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 1120 edges and 525 vertex of which 524 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 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 523 transition count 366
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 463 transition count 366
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 122 place count 463 transition count 253
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 373 place count 325 transition count 253
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 295 rules applied. Total rules applied 668 place count 174 transition count 109
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 670 place count 173 transition count 112
Applied a total of 670 rules in 58 ms. Remains 173 /530 variables (removed 357) and now considering 112/434 (removed 322) transitions.
// Phase 1: matrix 112 rows 173 cols
[2024-06-01 07:19:10] [INFO ] Computed 76 invariants in 1 ms
[2024-06-01 07:19:10] [INFO ] Implicit Places using invariants in 156 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 30, 31, 32, 33, 34, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 170 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/530 places, 112/434 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 235 ms. Remains : 146/530 places, 112/434 transitions.
Computed a total of 123 stabilizing places and 94 stable transitions
Computed a total of 123 stabilizing places and 94 stable transitions
Detected a total of 123/146 stabilizing places and 94/112 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 16 factoid took 619 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
RANDOM walk for 40000 steps (5203 resets) in 1130 ms. (35 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40002 steps (1921 resets) in 239 ms. (166 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (1500 resets) in 85 ms. (465 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (1786 resets) in 125 ms. (317 steps per ms) remains 1/2 properties
// Phase 1: matrix 112 rows 146 cols
[2024-06-01 07:19:11] [INFO ] Computed 49 invariants in 2 ms
[2024-06-01 07:19:11] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/132 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:19:12] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/142 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 111/253 variables, 142/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/257 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/257 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/258 variables, and 200 constraints, problems are : Problem set: 0 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 146/146 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/132 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/142 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 111/253 variables, 142/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/257 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/257 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/258 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 146/146 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 410ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 112/112 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 146 transition count 111
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 146 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 145 transition count 110
Applied a total of 3 rules in 10 ms. Remains 145 /146 variables (removed 1) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 145/146 places, 110/112 transitions.
RANDOM walk for 40000 steps (1957 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (543 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 127198 steps, run visited all 1 properties in 425 ms. (steps per millisecond=299 )
Probabilistic random walk after 127198 steps, saw 33382 distinct states, run finished after 425 ms. (steps per millisecond=299 ) properties seen :1
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 16 factoid took 1166 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 349 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 11113 reset in 429 ms.
Product exploration explored 100000 steps with 11242 reset in 322 ms.
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 112/112 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-06-01 07:19:15] [INFO ] Invariant cache hit.
[2024-06-01 07:19:15] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-01 07:19:15] [INFO ] Invariant cache hit.
[2024-06-01 07:19:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:19:16] [INFO ] Implicit Places using invariants and state equation in 317 ms returned [3, 14, 18, 47, 49, 53, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 130, 132, 134]
Discarding 27 places :
Implicit Place search using SMT with State Equation took 454 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/146 places, 112/112 transitions.
Graph (complete) has 321 edges and 119 vertex of which 110 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 110 transition count 97
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 99 transition count 97
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 27 place count 95 transition count 92
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 95 transition count 92
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 95 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 37 place count 92 transition count 89
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 40 place count 89 transition count 86
Iterating global reduction 4 with 3 rules applied. Total rules applied 43 place count 89 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 89 transition count 85
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 50 place count 86 transition count 82
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 52 place count 86 transition count 82
Applied a total of 52 rules in 10 ms. Remains 86 /119 variables (removed 33) and now considering 82/112 (removed 30) transitions.
// Phase 1: matrix 82 rows 86 cols
[2024-06-01 07:19:16] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 07:19:16] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 07:19:16] [INFO ] Invariant cache hit.
[2024-06-01 07:19:16] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:19:16] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/146 places, 82/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 668 ms. Remains : 86/146 places, 82/112 transitions.
Treatment of property BusinessProcesses-PT-18-LTLFireability-06 finished in 48993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G(p1)&&F(p2)) U X(!p2)))'
Support contains 5 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 452/452 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 534 transition count 439
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 534 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 534 transition count 438
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 530 transition count 434
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 530 transition count 434
Applied a total of 35 rules in 39 ms. Remains 530 /547 variables (removed 17) and now considering 434/452 (removed 18) transitions.
// Phase 1: matrix 434 rows 530 cols
[2024-06-01 07:19:16] [INFO ] Computed 108 invariants in 7 ms
[2024-06-01 07:19:16] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-06-01 07:19:16] [INFO ] Invariant cache hit.
[2024-06-01 07:19:17] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-06-01 07:19:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/529 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/529 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/530 variables, 65/108 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 72 places in 170 ms of which 5 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 94 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:19:23] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 75 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 77 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 100 places in 167 ms of which 2 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 93 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 94 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 101 places in 157 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 99 places in 155 ms of which 5 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 97 places in 163 ms of which 5 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 100 places in 160 ms of which 5 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 5 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 5 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 98 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 89 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 6 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 79 places in 197 ms of which 6 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 96 places in 530 ms of which 2 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 90 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 73 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 99 places in 238 ms of which 5 ms to minimize.
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 77 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 75 places in 164 ms of which 4 ms to minimize.
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 76 places in 187 ms of which 2 ms to minimize.
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 86 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 91 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 95 places in 207 ms of which 3 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 93 places in 239 ms of which 17 ms to minimize.
[2024-06-01 07:19:39] [INFO ] Deduced a trap composed of 86 places in 4172 ms of which 28 ms to minimize.
[2024-06-01 07:19:40] [INFO ] Deduced a trap composed of 100 places in 166 ms of which 7 ms to minimize.
[2024-06-01 07:19:40] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:19:40] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:19:40] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:19:40] [INFO ] Deduced a trap composed of 72 places in 160 ms of which 5 ms to minimize.
[2024-06-01 07:19:40] [INFO ] Deduced a trap composed of 74 places in 183 ms of which 27 ms to minimize.
[2024-06-01 07:19:41] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:19:41] [INFO ] Deduced a trap composed of 89 places in 179 ms of which 2 ms to minimize.
[2024-06-01 07:19:41] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:19:41] [INFO ] Deduced a trap composed of 86 places in 208 ms of which 2 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 81 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 113 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 98 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:19:42] [INFO ] Deduced a trap composed of 97 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 98 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 94 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 97 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:19:43] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:19:44] [INFO ] Deduced a trap composed of 79 places in 192 ms of which 3 ms to minimize.
[2024-06-01 07:19:44] [INFO ] Deduced a trap composed of 95 places in 192 ms of which 3 ms to minimize.
[2024-06-01 07:19:44] [INFO ] Deduced a trap composed of 118 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:19:44] [INFO ] Deduced a trap composed of 81 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:19:44] [INFO ] Deduced a trap composed of 124 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 73 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 74 places in 210 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 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 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 433 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/964 variables, and 188 constraints, problems are : Problem set: 0 solved, 433 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/530 constraints, PredecessorRefiner: 433/433 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 433 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/529 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/529 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/530 variables, 65/108 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 80/188 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:19:50] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 88 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 90 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:19:51] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:19:52] [INFO ] Deduced a trap composed of 93 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:19:52] [INFO ] Deduced a trap composed of 79 places in 220 ms of which 6 ms to minimize.
[2024-06-01 07:19:52] [INFO ] Deduced a trap composed of 88 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:19:53] [INFO ] Deduced a trap composed of 77 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:19:53] [INFO ] Deduced a trap composed of 72 places in 214 ms of which 6 ms to minimize.
[2024-06-01 07:19:53] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:19:53] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:19:53] [INFO ] Deduced a trap composed of 80 places in 149 ms of which 5 ms to minimize.
[2024-06-01 07:19:53] [INFO ] Deduced a trap composed of 78 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:19:54] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:19:54] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:19:54] [INFO ] Deduced a trap composed of 96 places in 205 ms of which 2 ms to minimize.
[2024-06-01 07:19:54] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 82 places in 181 ms of which 5 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 76 places in 150 ms of which 4 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 78 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 94 places in 170 ms of which 4 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 96 places in 173 ms of which 5 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:19:56] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 75 places in 174 ms of which 4 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 75 places in 185 ms of which 4 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 4 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 70 places in 173 ms of which 4 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 77 places in 171 ms of which 5 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 74 places in 169 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 72 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 72 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 78 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 78 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 73 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 94 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 74 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 76 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 46 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 82 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 78 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 82 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:20:04] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:20:04] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:20:04] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:20:04] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:20:04] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:20:04] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 27 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 75 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 81 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 51 places in 53 ms of which 2 ms to minimize.
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 95 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:20:07] [INFO ] Deduced a trap composed of 101 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 97 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:20:08] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 100 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 97 places in 164 ms of which 5 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 5 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 6 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 101 places in 140 ms of which 4 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 74 places in 187 ms of which 3 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 71 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 20/288 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 73 places in 162 ms of which 4 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 72 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 81 places in 164 ms of which 5 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 84 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 71 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 4 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 90 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 94 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 4 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 4 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 94 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 75 places in 201 ms of which 5 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 77 places in 147 ms of which 5 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 78 places in 176 ms of which 5 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 20/308 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 1 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 93 places in 237 ms of which 6 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 72 places in 211 ms of which 7 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 75 places in 157 ms of which 5 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 80 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 74 places in 163 ms of which 4 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 70 places in 162 ms of which 4 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 5 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 72 places in 167 ms of which 4 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 78 places in 162 ms of which 5 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 71 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 75 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 75 places in 161 ms of which 5 ms to minimize.
SMT process timed out in 60224ms, After SMT, problems are : Problem set: 0 solved, 433 unsolved
Search for dead transitions found 0 dead transitions in 60242ms
Starting structural reductions in LTL mode, iteration 1 : 530/547 places, 434/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61111 ms. Remains : 530/547 places, 434/452 transitions.
Stuttering acceptance computed with spot in 195 ms :[p2, p2, p2, true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-07 finished in 61352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 452/452 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 534 transition count 439
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 534 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 534 transition count 438
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 529 transition count 433
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 529 transition count 433
Applied a total of 37 rules in 53 ms. Remains 529 /547 variables (removed 18) and now considering 433/452 (removed 19) transitions.
// Phase 1: matrix 433 rows 529 cols
[2024-06-01 07:20:17] [INFO ] Computed 108 invariants in 6 ms
[2024-06-01 07:20:18] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-06-01 07:20:18] [INFO ] Invariant cache hit.
[2024-06-01 07:20:18] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2024-06-01 07:20:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/528 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/528 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (OVERLAPS) 1/529 variables, 65/108 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 71 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:20:25] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 73 places in 185 ms of which 5 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 76 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:20:26] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 100 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 96 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 95 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 96 places in 168 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 73 places in 143 ms of which 1 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 94 places in 182 ms of which 2 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 79 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 84 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 79 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 90 places in 181 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 96 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 73 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 89 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 94 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 95 places in 241 ms of which 7 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 72 places in 248 ms of which 17 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 93 places in 186 ms of which 5 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 75 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 92 places in 161 ms of which 6 ms to minimize.
[2024-06-01 07:20:38] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:20:39] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:20:39] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 6 ms to minimize.
[2024-06-01 07:20:39] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 5 ms to minimize.
[2024-06-01 07:20:39] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 6 ms to minimize.
[2024-06-01 07:20:40] [INFO ] Deduced a trap composed of 90 places in 177 ms of which 4 ms to minimize.
[2024-06-01 07:20:40] [INFO ] Deduced a trap composed of 77 places in 163 ms of which 5 ms to minimize.
[2024-06-01 07:20:40] [INFO ] Deduced a trap composed of 98 places in 165 ms of which 5 ms to minimize.
[2024-06-01 07:20:40] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 5 ms to minimize.
[2024-06-01 07:20:40] [INFO ] Deduced a trap composed of 77 places in 164 ms of which 5 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 72 places in 170 ms of which 5 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 3 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 96 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 75 places in 220 ms of which 6 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 90 places in 174 ms of which 4 ms to minimize.
[2024-06-01 07:20:43] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 94 places in 226 ms of which 3 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 95 places in 170 ms of which 4 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 94 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 94 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 79 places in 176 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 80 places in 157 ms of which 4 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 83 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
SMT process timed out in 30149ms, After SMT, problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 30153ms
Starting structural reductions in LTL mode, iteration 1 : 529/547 places, 433/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31114 ms. Remains : 529/547 places, 433/452 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 246 ms.
Product exploration explored 100000 steps with 33333 reset in 182 ms.
Computed a total of 474 stabilizing places and 388 stable transitions
Graph (complete) has 1124 edges and 529 vertex of which 528 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 474 stabilizing places and 388 stable transitions
Detected a total of 474/529 stabilizing places and 388/433 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 23 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-18-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLFireability-10 finished in 31717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 452/452 transitions.
Graph (trivial) has 270 edges and 547 vertex of which 7 / 547 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1141 edges and 541 vertex of which 540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 539 transition count 374
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 471 transition count 374
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 138 place count 471 transition count 260
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 391 place count 332 transition count 260
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 402 place count 321 transition count 249
Iterating global reduction 2 with 11 rules applied. Total rules applied 413 place count 321 transition count 249
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 293 rules applied. Total rules applied 706 place count 171 transition count 106
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 708 place count 170 transition count 109
Applied a total of 708 rules in 41 ms. Remains 170 /547 variables (removed 377) and now considering 109/452 (removed 343) transitions.
// Phase 1: matrix 109 rows 170 cols
[2024-06-01 07:20:49] [INFO ] Computed 76 invariants in 2 ms
[2024-06-01 07:20:49] [INFO ] Implicit Places using invariants in 165 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 167 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/547 places, 109/452 transitions.
Applied a total of 0 rules in 16 ms. Remains 142 /142 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 225 ms. Remains : 142/547 places, 109/452 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-11 finished in 277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(!p0)) U (p1 U p2))))'
Support contains 5 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 452/452 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 534 transition count 439
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 534 transition count 439
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 534 transition count 438
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 531 transition count 435
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 531 transition count 435
Applied a total of 33 rules in 24 ms. Remains 531 /547 variables (removed 16) and now considering 435/452 (removed 17) transitions.
// Phase 1: matrix 435 rows 531 cols
[2024-06-01 07:20:49] [INFO ] Computed 108 invariants in 4 ms
[2024-06-01 07:20:50] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-06-01 07:20:50] [INFO ] Invariant cache hit.
[2024-06-01 07:20:50] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2024-06-01 07:20:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/108 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 77 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 75 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 80 places in 214 ms of which 5 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 96 places in 236 ms of which 5 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 93 places in 204 ms of which 5 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 88 places in 197 ms of which 4 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 118 places in 153 ms of which 5 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 102 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 117 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 98 places in 141 ms of which 4 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-01 07:21:06] [INFO ] Deduced a trap composed of 96 places in 170 ms of which 4 ms to minimize.
[2024-06-01 07:21:07] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 4 ms to minimize.
[2024-06-01 07:21:07] [INFO ] Deduced a trap composed of 100 places in 155 ms of which 5 ms to minimize.
[2024-06-01 07:21:07] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:21:07] [INFO ] Deduced a trap composed of 94 places in 152 ms of which 4 ms to minimize.
[2024-06-01 07:21:07] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:21:07] [INFO ] Deduced a trap composed of 113 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 127 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 99 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 94 places in 165 ms of which 5 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 96 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 99 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:21:10] [INFO ] Deduced a trap composed of 88 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:21:10] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 93 places in 218 ms of which 5 ms to minimize.
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 98 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 98 places in 185 ms of which 5 ms to minimize.
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 98 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 94 places in 180 ms of which 2 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 96 places in 205 ms of which 2 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 97 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 97 places in 179 ms of which 4 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 100 places in 170 ms of which 4 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 99 places in 210 ms of which 5 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 95 places in 177 ms of which 5 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 94 places in 173 ms of which 4 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 100 places in 203 ms of which 3 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 95 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 101 places in 155 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 83 places in 172 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 93 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 80 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 119 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 91 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 99 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 434 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/966 variables, and 188 constraints, problems are : Problem set: 0 solved, 434 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 65/65 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/531 constraints, PredecessorRefiner: 434/434 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 434 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 65/108 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 80/188 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-01 07:21:24] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 94 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:21:25] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 85 places in 165 ms of which 6 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 83 places in 162 ms of which 4 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 84 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:21:26] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 4 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 82 places in 193 ms of which 4 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 88 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 97 places in 173 ms of which 5 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:21:27] [INFO ] Deduced a trap composed of 89 places in 205 ms of which 19 ms to minimize.
[2024-06-01 07:21:28] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-01 07:21:40] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:21:40] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 99 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 97 places in 192 ms of which 2 ms to minimize.
[2024-06-01 07:21:41] [INFO ] Deduced a trap composed of 97 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:21:44] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 2 ms to minimize.
[2024-06-01 07:21:44] [INFO ] Deduced a trap composed of 96 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:21:44] [INFO ] Deduced a trap composed of 96 places in 171 ms of which 2 ms to minimize.
[2024-06-01 07:21:44] [INFO ] Deduced a trap composed of 100 places in 180 ms of which 2 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 2 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 2 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 25 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 2 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 24 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 93 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 101 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 101 places in 203 ms of which 2 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 95 places in 232 ms of which 5 ms to minimize.
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 34 places in 234 ms of which 5 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 2 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 2 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:21:51] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 2 ms to minimize.
SMT process timed out in 60294ms, After SMT, problems are : Problem set: 0 solved, 434 unsolved
Search for dead transitions found 0 dead transitions in 60298ms
Starting structural reductions in LTL mode, iteration 1 : 531/547 places, 435/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61273 ms. Remains : 531/547 places, 435/452 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p2), p0]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-12
Product exploration explored 100000 steps with 538 reset in 575 ms.
Stack based approach found an accepted trace after 39343 steps with 216 reset with depth 5 and stack size 5 in 251 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-12 finished in 62275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&G(p1))))'
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 452/452 transitions.
Graph (trivial) has 270 edges and 547 vertex of which 7 / 547 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1141 edges and 541 vertex of which 540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 539 transition count 375
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 472 transition count 374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 471 transition count 374
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 138 place count 471 transition count 259
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 393 place count 331 transition count 259
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 405 place count 319 transition count 247
Iterating global reduction 3 with 12 rules applied. Total rules applied 417 place count 319 transition count 247
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 285 rules applied. Total rules applied 702 place count 173 transition count 108
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 704 place count 172 transition count 111
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 705 place count 171 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 706 place count 170 transition count 110
Applied a total of 706 rules in 61 ms. Remains 170 /547 variables (removed 377) and now considering 110/452 (removed 342) transitions.
// Phase 1: matrix 110 rows 170 cols
[2024-06-01 07:21:52] [INFO ] Computed 75 invariants in 2 ms
[2024-06-01 07:21:52] [INFO ] Implicit Places using invariants in 166 ms returned [36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 167 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/547 places, 110/452 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 231 ms. Remains : 159/547 places, 110/452 transitions.
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-13 finished in 319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F((X(p2)||p1)))))'
Support contains 5 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 452/452 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 533 transition count 438
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 533 transition count 438
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 533 transition count 437
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 528 transition count 432
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 528 transition count 432
Applied a total of 39 rules in 40 ms. Remains 528 /547 variables (removed 19) and now considering 432/452 (removed 20) transitions.
// Phase 1: matrix 432 rows 528 cols
[2024-06-01 07:21:52] [INFO ] Computed 108 invariants in 8 ms
[2024-06-01 07:21:52] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-06-01 07:21:52] [INFO ] Invariant cache hit.
[2024-06-01 07:21:53] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
Running 431 sub problems to find dead transitions.
[2024-06-01 07:21:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (OVERLAPS) 1/528 variables, 65/108 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 74 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:22:00] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 72 places in 202 ms of which 2 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 73 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 78 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 76 places in 188 ms of which 2 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 97 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 96 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 72 places in 114 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 74 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 74 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 89 places in 182 ms of which 3 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 93 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 90 places in 190 ms of which 3 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 90 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 97 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 91 places in 207 ms of which 3 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 93 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 91 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 90 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 88 places in 207 ms of which 3 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 71 places in 189 ms of which 2 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 89 places in 170 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 85 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 77 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 81 places in 207 ms of which 2 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 73 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 93 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 95 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 95 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 74 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 76 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 76 places in 252 ms of which 5 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 79 places in 173 ms of which 2 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 98 places in 281 ms of which 5 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 126 places in 135 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 91 places in 241 ms of which 6 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 97 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 95 places in 200 ms of which 2 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:22:17] [INFO ] Deduced a trap composed of 94 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:22:17] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:22:17] [INFO ] Deduced a trap composed of 88 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:22:17] [INFO ] Deduced a trap composed of 94 places in 176 ms of which 2 ms to minimize.
[2024-06-01 07:22:17] [INFO ] Deduced a trap composed of 94 places in 224 ms of which 6 ms to minimize.
[2024-06-01 07:22:18] [INFO ] Deduced a trap composed of 101 places in 215 ms of which 5 ms to minimize.
[2024-06-01 07:22:18] [INFO ] Deduced a trap composed of 100 places in 216 ms of which 6 ms to minimize.
[2024-06-01 07:22:18] [INFO ] Deduced a trap composed of 101 places in 176 ms of which 3 ms to minimize.
[2024-06-01 07:22:18] [INFO ] Deduced a trap composed of 93 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:22:18] [INFO ] Deduced a trap composed of 89 places in 216 ms of which 5 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 92 places in 176 ms of which 5 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 110 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 94 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 431 unsolved
[2024-06-01 07:22:23] [INFO ] Deduced a trap composed of 119 places in 172 ms of which 3 ms to minimize.
SMT process timed out in 30296ms, After SMT, problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 30302ms
Starting structural reductions in LTL mode, iteration 1 : 528/547 places, 432/452 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31240 ms. Remains : 528/547 places, 432/452 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 263 ms.
Product exploration explored 100000 steps with 50000 reset in 236 ms.
Computed a total of 473 stabilizing places and 387 stable transitions
Graph (complete) has 1123 edges and 528 vertex of which 527 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 473 stabilizing places and 387 stable transitions
Detected a total of 473/528 stabilizing places and 387/432 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 28 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-18-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLFireability-14 finished in 32002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 4 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 452/452 transitions.
Graph (complete) has 1149 edges and 547 vertex of which 546 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 65 place count 545 transition count 386
Reduce places removed 64 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 67 rules applied. Total rules applied 132 place count 481 transition count 383
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 135 place count 478 transition count 383
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 135 place count 478 transition count 265
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 261 rules applied. Total rules applied 396 place count 335 transition count 265
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 409 place count 322 transition count 252
Iterating global reduction 3 with 13 rules applied. Total rules applied 422 place count 322 transition count 252
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 424 place count 322 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 425 place count 321 transition count 250
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 5 with 287 rules applied. Total rules applied 712 place count 174 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 713 place count 174 transition count 109
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 6 with 2 rules applied. Total rules applied 715 place count 173 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 716 place count 172 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 717 place count 171 transition count 111
Applied a total of 717 rules in 68 ms. Remains 171 /547 variables (removed 376) and now considering 111/452 (removed 341) transitions.
// Phase 1: matrix 111 rows 171 cols
[2024-06-01 07:22:24] [INFO ] Computed 75 invariants in 3 ms
[2024-06-01 07:22:24] [INFO ] Implicit Places using invariants in 148 ms returned [31, 32, 33, 34, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 149 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 157/547 places, 111/452 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 222 ms. Remains : 157/547 places, 111/452 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLFireability-15 finished in 340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p0&&G(F(((p0&&X((p1||F(p2))))||G((p1||F(p2)))))))))))'
Found a Shortening insensitive property : BusinessProcesses-PT-18-LTLFireability-06
Stuttering acceptance computed with spot in 347 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 547/547 places, 452/452 transitions.
Graph (trivial) has 268 edges and 547 vertex of which 7 / 547 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1141 edges and 541 vertex of which 540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 539 transition count 374
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 471 transition count 374
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 138 place count 471 transition count 261
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 389 place count 333 transition count 261
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 399 place count 323 transition count 251
Iterating global reduction 2 with 10 rules applied. Total rules applied 409 place count 323 transition count 251
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 291 rules applied. Total rules applied 700 place count 174 transition count 109
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 702 place count 173 transition count 112
Applied a total of 702 rules in 53 ms. Remains 173 /547 variables (removed 374) and now considering 112/452 (removed 340) transitions.
// Phase 1: matrix 112 rows 173 cols
[2024-06-01 07:22:25] [INFO ] Computed 76 invariants in 2 ms
[2024-06-01 07:22:25] [INFO ] Implicit Places using invariants in 166 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 30, 31, 32, 33, 34, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 167 ms to find 27 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 146/547 places, 112/452 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 224 ms. Remains : 146/547 places, 112/452 transitions.
Running random walk in product with property : BusinessProcesses-PT-18-LTLFireability-06
Product exploration explored 100000 steps with 11138 reset in 222 ms.
Product exploration explored 100000 steps with 11128 reset in 259 ms.
Computed a total of 123 stabilizing places and 94 stable transitions
Computed a total of 123 stabilizing places and 94 stable transitions
Detected a total of 123/146 stabilizing places and 94/112 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 753 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
RANDOM walk for 40000 steps (5181 resets) in 266 ms. (149 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40002 steps (1425 resets) in 98 ms. (404 steps per ms) remains 1/3 properties
// Phase 1: matrix 112 rows 146 cols
[2024-06-01 07:22:27] [INFO ] Computed 49 invariants in 1 ms
[2024-06-01 07:22:27] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/132 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/142 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 111/253 variables, 142/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/257 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/257 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/258 variables, and 200 constraints, problems are : Problem set: 0 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 146/146 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/132 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/142 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 111/253 variables, 142/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/253 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/253 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/257 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/257 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/258 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 146/146 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 418ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 112/112 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 146 transition count 111
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 146 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 145 transition count 110
Applied a total of 3 rules in 11 ms. Remains 145 /146 variables (removed 1) and now considering 110/112 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 145/146 places, 110/112 transitions.
RANDOM walk for 40000 steps (1994 resets) in 313 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (582 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 111684 steps, run visited all 1 properties in 529 ms. (steps per millisecond=211 )
Probabilistic random walk after 111684 steps, saw 29285 distinct states, run finished after 529 ms. (steps per millisecond=211 ) properties seen :1
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 14 factoid took 1265 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 112/112 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-06-01 07:22:30] [INFO ] Invariant cache hit.
[2024-06-01 07:22:30] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 07:22:30] [INFO ] Invariant cache hit.
[2024-06-01 07:22:30] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:22:30] [INFO ] Implicit Places using invariants and state equation in 235 ms returned [3, 14, 18, 47, 49, 53, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 130, 132, 134]
Discarding 27 places :
Implicit Place search using SMT with State Equation took 392 ms to find 27 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/146 places, 112/112 transitions.
Graph (complete) has 321 edges and 119 vertex of which 110 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 110 transition count 97
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 99 transition count 97
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 27 place count 95 transition count 92
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 95 transition count 92
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 95 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 37 place count 92 transition count 89
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 40 place count 89 transition count 86
Iterating global reduction 4 with 3 rules applied. Total rules applied 43 place count 89 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 89 transition count 85
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 50 place count 86 transition count 82
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 52 place count 86 transition count 82
Applied a total of 52 rules in 8 ms. Remains 86 /119 variables (removed 33) and now considering 82/112 (removed 30) transitions.
// Phase 1: matrix 82 rows 86 cols
[2024-06-01 07:22:30] [INFO ] Computed 17 invariants in 1 ms
[2024-06-01 07:22:30] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 07:22:30] [INFO ] Invariant cache hit.
[2024-06-01 07:22:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:22:30] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/146 places, 82/112 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 667 ms. Remains : 86/146 places, 82/112 transitions.
Computed a total of 63 stabilizing places and 64 stable transitions
Graph (complete) has 265 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 63 stabilizing places and 64 stable transitions
Detected a total of 63/86 stabilizing places and 64/82 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 16 factoid took 612 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
RANDOM walk for 40000 steps (5214 resets) in 452 ms. (88 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40002 steps (1472 resets) in 146 ms. (272 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (1853 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
[2024-06-01 07:22:31] [INFO ] Invariant cache hit.
[2024-06-01 07:22:31] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/33 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/83 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 65/148 variables, 43/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 9/157 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/157 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 7/164 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/164 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/167 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/167 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/167 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/168 variables, and 106 constraints, problems are : Problem set: 0 solved, 2 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/33 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 50/83 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 65/148 variables, 43/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 9/157 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:22:32] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/157 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/157 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 7/164 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/164 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 3/167 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/167 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/167 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/168 variables, and 112 constraints, problems are : Problem set: 0 solved, 2 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 613ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 29 ms.
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 82/82 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 86 transition count 81
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 86 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 85 transition count 80
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 85 transition count 76
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 11 place count 81 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 81 transition count 75
Applied a total of 12 rules in 10 ms. Remains 81 /86 variables (removed 5) and now considering 75/82 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 81/86 places, 75/82 transitions.
RANDOM walk for 40000 steps (2606 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (708 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 110146 steps, run visited all 1 properties in 351 ms. (steps per millisecond=313 )
Probabilistic random walk after 110146 steps, saw 30474 distinct states, run finished after 351 ms. (steps per millisecond=313 ) properties seen :1
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 p1)))]
Knowledge based reduction with 16 factoid took 1245 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 11083 reset in 175 ms.
Product exploration explored 100000 steps with 11119 reset in 154 ms.
Support contains 3 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 82/82 transitions.
Applied a total of 0 rules in 15 ms. Remains 86 /86 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-06-01 07:22:35] [INFO ] Invariant cache hit.
[2024-06-01 07:22:35] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-01 07:22:35] [INFO ] Invariant cache hit.
[2024-06-01 07:22:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:22:35] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-06-01 07:22:35] [INFO ] Redundant transitions in 1 ms returned []
Running 78 sub problems to find dead transitions.
[2024-06-01 07:22:35] [INFO ] Invariant cache hit.
[2024-06-01 07:22:35] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 1/86 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:22:36] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:22:37] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 7 (OVERLAPS) 81/167 variables, 86/124 constraints. Problems are: Problem set: 5 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 3/127 constraints. Problems are: Problem set: 5 solved, 73 unsolved
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:22:38] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:22:39] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 7/134 constraints. Problems are: Problem set: 5 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/134 constraints. Problems are: Problem set: 5 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/167 variables, 0/134 constraints. Problems are: Problem set: 5 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/168 variables, and 134 constraints, problems are : Problem set: 5 solved, 73 unsolved in 4102 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 5 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 15/18 constraints. Problems are: Problem set: 5 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/18 constraints. Problems are: Problem set: 5 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 1/86 variables, 14/32 constraints. Problems are: Problem set: 5 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 13/45 constraints. Problems are: Problem set: 5 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/45 constraints. Problems are: Problem set: 5 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 81/167 variables, 86/131 constraints. Problems are: Problem set: 5 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 3/134 constraints. Problems are: Problem set: 5 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 73/207 constraints. Problems are: Problem set: 5 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/207 constraints. Problems are: Problem set: 5 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/167 variables, 0/207 constraints. Problems are: Problem set: 5 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/168 variables, and 207 constraints, problems are : Problem set: 5 solved, 73 unsolved in 3804 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 73/78 constraints, Known Traps: 28/28 constraints]
After SMT, in 7970ms problems are : Problem set: 5 solved, 73 unsolved
Search for dead transitions found 5 dead transitions in 7971ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 86/86 places, 77/82 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 2 ms. Remains 85 /86 variables (removed 1) and now considering 77/77 (removed 0) transitions.
[2024-06-01 07:22:43] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 8248 ms. Remains : 85/86 places, 77/82 transitions.
Treatment of property BusinessProcesses-PT-18-LTLFireability-06 finished in 19037 ms.
[2024-06-01 07:22:43] [INFO ] Flatten gal took : 51 ms
[2024-06-01 07:22:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 07:22:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 547 places, 452 transitions and 1339 arcs took 10 ms.
Total runtime 495329 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BusinessProcesses-PT-18-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717226941780

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name BusinessProcesses-PT-18-LTLFireability-06
ltl formula formula --ltl=/tmp/5586/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 547 places, 452 transitions and 1339 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5586/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5586/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5586/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.020 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5586/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 548 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 548, there are 471 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~160 levels ~10000 states ~48820 transitions
pnml2lts-mc( 1/ 4): ~160 levels ~20000 states ~103360 transitions
pnml2lts-mc( 3/ 4): ~366 levels ~40000 states ~191688 transitions
pnml2lts-mc( 3/ 4): ~366 levels ~80000 states ~402620 transitions
pnml2lts-mc( 1/ 4): ~160 levels ~160000 states ~969372 transitions
pnml2lts-mc( 1/ 4): ~160 levels ~320000 states ~2084028 transitions
pnml2lts-mc( 1/ 4): ~160 levels ~640000 states ~4433300 transitions
pnml2lts-mc( 1/ 4): ~160 levels ~1280000 states ~9251004 transitions
pnml2lts-mc( 1/ 4): ~160 levels ~2560000 states ~19389436 transitions
pnml2lts-mc( 1/ 4): ~160 levels ~5120000 states ~41312040 transitions
pnml2lts-mc( 1/ 4): ~175 levels ~10240000 states ~85962252 transitions
pnml2lts-mc( 1/ 4): ~466 levels ~20480000 states ~166154884 transitions
pnml2lts-mc( 1/ 4): ~466 levels ~40960000 states ~346736160 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 19881385
pnml2lts-mc( 0/ 4): unique states count: 33547416
pnml2lts-mc( 0/ 4): unique transitions count: 275463337
pnml2lts-mc( 0/ 4): - self-loop count: 311
pnml2lts-mc( 0/ 4): - claim dead count: 235075788
pnml2lts-mc( 0/ 4): - claim found count: 6832418
pnml2lts-mc( 0/ 4): - claim success count: 33547450
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2918
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33547450 states 275463392 transitions, fanout: 8.211
pnml2lts-mc( 0/ 4): Total exploration time 377.000 sec (376.980 sec minimum, 376.985 sec on average)
pnml2lts-mc( 0/ 4): States per second: 88985, Transitions per second: 730672
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 259.8MB, 8.1 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/5.0%
pnml2lts-mc( 0/ 4): Stored 455 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 259.8MB (~256.0MB paged-in)

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-18"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-18, 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 r472-tajo-171620399800588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-18.tgz
mv BusinessProcesses-PT-18 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;