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.r047-tajo-171620398500596.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 greatspnxred
Input is BusinessProcesses-PT-19, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398500596
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 3.8K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K 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 189K 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-19-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716308939456

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:29:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 16:29:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:29:00] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-21 16:29:00] [INFO ] Transformed 772 places.
[2024-05-21 16:29:00] [INFO ] Transformed 685 transitions.
[2024-05-21 16:29:00] [INFO ] Found NUPN structural information;
[2024-05-21 16:29:00] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 15 places in 16 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-19-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-19-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 757 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 757/757 places, 670/670 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 749 transition count 670
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 106 place count 651 transition count 572
Iterating global reduction 1 with 98 rules applied. Total rules applied 204 place count 651 transition count 572
Discarding 51 places :
Symmetric choice reduction at 1 with 51 rule applications. Total rules 255 place count 600 transition count 521
Iterating global reduction 1 with 51 rules applied. Total rules applied 306 place count 600 transition count 521
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 307 place count 599 transition count 520
Iterating global reduction 1 with 1 rules applied. Total rules applied 308 place count 599 transition count 520
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 309 place count 598 transition count 519
Iterating global reduction 1 with 1 rules applied. Total rules applied 310 place count 598 transition count 519
Applied a total of 310 rules in 274 ms. Remains 598 /757 variables (removed 159) and now considering 519/670 (removed 151) transitions.
// Phase 1: matrix 519 rows 598 cols
[2024-05-21 16:29:01] [INFO ] Computed 117 invariants in 39 ms
[2024-05-21 16:29:02] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-21 16:29:02] [INFO ] Invariant cache hit.
[2024-05-21 16:29:02] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1372 ms to find 0 implicit places.
Running 518 sub problems to find dead transitions.
[2024-05-21 16:29:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/597 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/597 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (OVERLAPS) 1/598 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/598 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 89 places in 189 ms of which 26 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 128 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 132 places in 152 ms of which 4 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 115 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 113 places in 135 ms of which 4 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 134 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:29:16] [INFO ] Deduced a trap composed of 132 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 116 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 115 places in 137 ms of which 4 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 113 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 133 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:29:17] [INFO ] Deduced a trap composed of 133 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 113 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:29:18] [INFO ] Deduced a trap composed of 136 places in 155 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 135 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 118 places in 206 ms of which 3 ms to minimize.
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 113 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:29:19] [INFO ] Deduced a trap composed of 133 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 117 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 122 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 111 places in 166 ms of which 4 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 129 places in 125 ms of which 4 ms to minimize.
[2024-05-21 16:29:20] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 4 ms to minimize.
[2024-05-21 16:29:21] [INFO ] Deduced a trap composed of 108 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:29:21] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:29:21] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 8 ms to minimize.
[2024-05-21 16:29:21] [INFO ] Deduced a trap composed of 110 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:29:21] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:29:21] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:29:21] [INFO ] Deduced a trap composed of 114 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 117 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 116 places in 138 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 4 ms to minimize.
[2024-05-21 16:29:22] [INFO ] Deduced a trap composed of 95 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:29:23] [INFO ] Deduced a trap composed of 116 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:29:23] [INFO ] Deduced a trap composed of 95 places in 167 ms of which 3 ms to minimize.
[2024-05-21 16:29:23] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:29:23] [INFO ] Deduced a trap composed of 129 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:29:23] [INFO ] Deduced a trap composed of 116 places in 153 ms of which 4 ms to minimize.
[2024-05-21 16:29:23] [INFO ] Deduced a trap composed of 133 places in 139 ms of which 4 ms to minimize.
[2024-05-21 16:29:24] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 4 ms to minimize.
[2024-05-21 16:29:24] [INFO ] Deduced a trap composed of 134 places in 162 ms of which 4 ms to minimize.
[2024-05-21 16:29:24] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:29:24] [INFO ] Deduced a trap composed of 90 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:29:24] [INFO ] Deduced a trap composed of 90 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:29:25] [INFO ] Deduced a trap composed of 102 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:29:25] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:29:25] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:29:25] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:29:25] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:29:25] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-05-21 16:29:30] [INFO ] Deduced a trap composed of 115 places in 169 ms of which 4 ms to minimize.
[2024-05-21 16:29:30] [INFO ] Deduced a trap composed of 118 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:29:30] [INFO ] Deduced a trap composed of 115 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:29:31] [INFO ] Deduced a trap composed of 111 places in 142 ms of which 4 ms to minimize.
[2024-05-21 16:29:31] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:29:31] [INFO ] Deduced a trap composed of 111 places in 132 ms of which 4 ms to minimize.
[2024-05-21 16:29:31] [INFO ] Deduced a trap composed of 109 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:29:31] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:29:31] [INFO ] Deduced a trap composed of 113 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:29:31] [INFO ] Deduced a trap composed of 111 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:29:32] [INFO ] Deduced a trap composed of 112 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:29:32] [INFO ] Deduced a trap composed of 112 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:29:32] [INFO ] Deduced a trap composed of 135 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:29:32] [INFO ] Deduced a trap composed of 116 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:29:32] [INFO ] Deduced a trap composed of 137 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:29:32] [INFO ] Deduced a trap composed of 134 places in 155 ms of which 4 ms to minimize.
[2024-05-21 16:29:33] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:29:33] [INFO ] Deduced a trap composed of 110 places in 173 ms of which 3 ms to minimize.
SMT process timed out in 30364ms, After SMT, problems are : Problem set: 0 solved, 518 unsolved
Search for dead transitions found 0 dead transitions in 30392ms
Starting structural reductions in LTL mode, iteration 1 : 598/757 places, 519/670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32067 ms. Remains : 598/757 places, 519/670 transitions.
Support contains 37 out of 598 places after structural reductions.
[2024-05-21 16:29:33] [INFO ] Flatten gal took : 81 ms
[2024-05-21 16:29:33] [INFO ] Flatten gal took : 37 ms
[2024-05-21 16:29:33] [INFO ] Input system was already deterministic with 519 transitions.
RANDOM walk for 40000 steps (219 resets) in 2701 ms. (14 steps per ms) remains 18/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
[2024-05-21 16:29:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 177/199 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 249/448 variables, 61/71 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 137/585 variables, 46/117 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-21 16:29:35] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:29:35] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 4 ms to minimize.
[2024-05-21 16:29:35] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:29:35] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:29:35] [INFO ] Deduced a trap composed of 108 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:29:36] [INFO ] Deduced a trap composed of 108 places in 181 ms of which 3 ms to minimize.
[2024-05-21 16:29:36] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:29:36] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:29:36] [INFO ] Deduced a trap composed of 100 places in 185 ms of which 4 ms to minimize.
[2024-05-21 16:29:36] [INFO ] Deduced a trap composed of 98 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:29:36] [INFO ] Deduced a trap composed of 106 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:29:36] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 2 ms to minimize.
[2024-05-21 16:29:37] [INFO ] Deduced a trap composed of 105 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:29:37] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:29:37] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:29:37] [INFO ] Deduced a trap composed of 112 places in 172 ms of which 4 ms to minimize.
[2024-05-21 16:29:37] [INFO ] Deduced a trap composed of 103 places in 180 ms of which 3 ms to minimize.
[2024-05-21 16:29:38] [INFO ] Deduced a trap composed of 105 places in 181 ms of which 3 ms to minimize.
[2024-05-21 16:29:38] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 4 ms to minimize.
[2024-05-21 16:29:38] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/585 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-21 16:29:38] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:29:38] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-21 16:29:38] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:29:38] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 2 ms to minimize.
[2024-05-21 16:29:38] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:29:39] [INFO ] Deduced a trap composed of 101 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:29:39] [INFO ] Deduced a trap composed of 101 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:29:39] [INFO ] Deduced a trap composed of 118 places in 186 ms of which 4 ms to minimize.
[2024-05-21 16:29:39] [INFO ] Deduced a trap composed of 102 places in 162 ms of which 4 ms to minimize.
SMT process timed out in 5047ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 598/598 places, 519/519 transitions.
Graph (complete) has 1316 edges and 598 vertex of which 597 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 597 transition count 453
Reduce places removed 65 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 68 rules applied. Total rules applied 134 place count 532 transition count 450
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 137 place count 529 transition count 450
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 137 place count 529 transition count 335
Deduced a syphon composed of 115 places in 2 ms
Ensure Unique test removed 21 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 388 place count 393 transition count 335
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 395 place count 386 transition count 328
Iterating global reduction 3 with 7 rules applied. Total rules applied 402 place count 386 transition count 328
Performed 153 Post agglomeration using F-continuation condition.Transition count delta: 153
Deduced a syphon composed of 153 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 311 rules applied. Total rules applied 713 place count 228 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 714 place count 228 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 716 place count 227 transition count 177
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 724 place count 227 transition count 177
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 725 place count 226 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 726 place count 225 transition count 176
Applied a total of 726 rules in 156 ms. Remains 225 /598 variables (removed 373) and now considering 176/519 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 225/598 places, 176/519 transitions.
RANDOM walk for 40000 steps (4258 resets) in 683 ms. (58 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4002 steps (112 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (124 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (119 resets) in 38 ms. (102 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (127 resets) in 21 ms. (181 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (129 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (111 resets) in 20 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (125 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (125 resets) in 21 ms. (181 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (117 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (121 resets) in 20 ms. (190 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (130 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (112 resets) in 27 ms. (142 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (125 resets) in 32 ms. (121 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (102 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (104 resets) in 23 ms. (166 steps per ms) remains 14/14 properties
// Phase 1: matrix 176 rows 225 cols
[2024-05-21 16:29:40] [INFO ] Computed 90 invariants in 4 ms
[2024-05-21 16:29:40] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 67/85 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 31/116 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 43/159 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 16:29:40] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 2 ms to minimize.
[2024-05-21 16:29:40] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:29:40] [INFO ] Deduced a trap composed of 59 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:29:40] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:29:40] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:29:40] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:29:40] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:29:40] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:29:40] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 59 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 2 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 2 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:29:41] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 7/166 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 3/169 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 176/345 variables, 169/253 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/345 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 56/401 variables, 56/313 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/401 variables, 26/339 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/401 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 0/401 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 339 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2128 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 225/225 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 67/85 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 31/116 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 43/159 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 16:29:42] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:29:42] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 2 ms to minimize.
[2024-05-21 16:29:42] [INFO ] Deduced a trap composed of 61 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 7/166 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 3/169 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 176/345 variables, 169/256 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/345 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 10/270 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 16:29:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:29:43] [INFO ] Deduced a trap composed of 57 places in 51 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/345 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 56/401 variables, 56/328 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/401 variables, 26/354 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/401 variables, 4/358 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 16:29:43] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:29:43] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:29:43] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:29:43] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:29:43] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:29:44] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:29:44] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:29:44] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/401 variables, 8/366 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 16:29:44] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/401 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 16:29:44] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:29:44] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/401 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-21 16:29:45] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:29:45] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:29:45] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/401 variables, 3/372 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/401 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (OVERLAPS) 0/401 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 372 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3556 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 225/225 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 39/39 constraints]
After SMT, in 5721ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 1 properties in 1291 ms.
Support contains 16 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 176/176 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 225 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 224 transition count 175
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 224 transition count 171
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 11 place count 219 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 217 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 217 transition count 169
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 17 place count 216 transition count 168
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 216 transition count 168
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 215 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 215 transition count 167
Applied a total of 20 rules in 32 ms. Remains 215 /225 variables (removed 10) and now considering 167/176 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 215/225 places, 167/176 transitions.
RANDOM walk for 40000 steps (5462 resets) in 580 ms. (68 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (1729 resets) in 282 ms. (141 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1760 resets) in 231 ms. (172 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1712 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1750 resets) in 137 ms. (289 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1795 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1802 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1764 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1744 resets) in 133 ms. (298 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1777 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1802 resets) in 137 ms. (289 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1772 resets) in 153 ms. (259 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1725 resets) in 156 ms. (254 steps per ms) remains 12/12 properties
Finished probabilistic random walk after 211323 steps, run visited all 12 properties in 877 ms. (steps per millisecond=240 )
Probabilistic random walk after 211323 steps, saw 79198 distinct states, run finished after 881 ms. (steps per millisecond=239 ) properties seen :12
FORMULA BusinessProcesses-PT-19-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 540 stabilizing places and 471 stable transitions
Graph (complete) has 1316 edges and 598 vertex of which 597 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 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(X(G(p0))))'
Support contains 1 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 583 transition count 504
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 583 transition count 504
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 579 transition count 500
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 579 transition count 500
Applied a total of 38 rules in 27 ms. Remains 579 /598 variables (removed 19) and now considering 500/519 (removed 19) transitions.
// Phase 1: matrix 500 rows 579 cols
[2024-05-21 16:29:49] [INFO ] Computed 117 invariants in 10 ms
[2024-05-21 16:29:50] [INFO ] Implicit Places using invariants in 633 ms returned []
[2024-05-21 16:29:50] [INFO ] Invariant cache hit.
[2024-05-21 16:29:50] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2024-05-21 16:29:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-21 16:30:01] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:30:01] [INFO ] Deduced a trap composed of 117 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:30:02] [INFO ] Deduced a trap composed of 108 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:30:02] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:30:02] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:30:02] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:30:02] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:30:02] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:30:02] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:30:03] [INFO ] Deduced a trap composed of 125 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:30:03] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:30:03] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:30:03] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:30:03] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 2 ms to minimize.
[2024-05-21 16:30:03] [INFO ] Deduced a trap composed of 105 places in 147 ms of which 4 ms to minimize.
[2024-05-21 16:30:04] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:30:04] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:30:04] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:30:04] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:30:04] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-21 16:30:04] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:30:05] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:30:05] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:30:05] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:30:05] [INFO ] Deduced a trap composed of 97 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:30:05] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:30:05] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:30:05] [INFO ] Deduced a trap composed of 124 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:30:06] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:30:06] [INFO ] Deduced a trap composed of 105 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:30:06] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:30:06] [INFO ] Deduced a trap composed of 120 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:30:06] [INFO ] Deduced a trap composed of 108 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:30:06] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:30:07] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:30:07] [INFO ] Deduced a trap composed of 109 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:30:07] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:30:07] [INFO ] Deduced a trap composed of 111 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:30:07] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:30:07] [INFO ] Deduced a trap composed of 107 places in 155 ms of which 4 ms to minimize.
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/157 constraints. Problems are: Problem set: 4 solved, 495 unsolved
[2024-05-21 16:30:08] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:30:08] [INFO ] Deduced a trap composed of 126 places in 169 ms of which 4 ms to minimize.
[2024-05-21 16:30:08] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:30:08] [INFO ] Deduced a trap composed of 105 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:30:08] [INFO ] Deduced a trap composed of 126 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:30:08] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:30:09] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:30:09] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:30:09] [INFO ] Deduced a trap composed of 121 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:30:09] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:30:09] [INFO ] Deduced a trap composed of 102 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:30:09] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 4 ms to minimize.
[2024-05-21 16:30:09] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:30:10] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 2 ms to minimize.
[2024-05-21 16:30:10] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:30:10] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:30:10] [INFO ] Deduced a trap composed of 109 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:30:10] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:30:10] [INFO ] Deduced a trap composed of 98 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:30:10] [INFO ] Deduced a trap composed of 129 places in 136 ms of which 3 ms to minimize.
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/177 constraints. Problems are: Problem set: 18 solved, 481 unsolved
[2024-05-21 16:30:14] [INFO ] Deduced a trap composed of 111 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:30:15] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:30:15] [INFO ] Deduced a trap composed of 117 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:30:15] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:30:15] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:30:15] [INFO ] Deduced a trap composed of 100 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:30:15] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 4 ms to minimize.
[2024-05-21 16:30:15] [INFO ] Deduced a trap composed of 117 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:30:16] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:30:16] [INFO ] Deduced a trap composed of 121 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:30:16] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:30:16] [INFO ] Deduced a trap composed of 100 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:30:16] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:30:16] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:30:16] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:30:17] [INFO ] Deduced a trap composed of 118 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:30:17] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:30:17] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:30:17] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:30:17] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 20/197 constraints. Problems are: Problem set: 18 solved, 481 unsolved
[2024-05-21 16:30:18] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-21 16:30:18] [INFO ] Deduced a trap composed of 123 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:30:18] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:30:18] [INFO ] Deduced a trap composed of 109 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:30:18] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:30:18] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:30:19] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:30:19] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:30:19] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:30:19] [INFO ] Deduced a trap composed of 104 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:30:19] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:30:19] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:30:19] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:30:19] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-21 16:30:20] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:30:20] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:30:20] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:30:20] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:30:20] [INFO ] Deduced a trap composed of 123 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:30:21] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 3 ms to minimize.
SMT process timed out in 30223ms, After SMT, problems are : Problem set: 18 solved, 481 unsolved
Search for dead transitions found 18 dead transitions in 30229ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 579/598 places, 482/519 transitions.
Applied a total of 0 rules in 10 ms. Remains 579 /579 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31480 ms. Remains : 579/598 places, 482/519 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-01
Entered a terminal (fully accepting) state of product in 107 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-01 finished in 31773 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) U G(p1))))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 582 transition count 503
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 582 transition count 503
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 578 transition count 499
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 578 transition count 499
Applied a total of 40 rules in 42 ms. Remains 578 /598 variables (removed 20) and now considering 499/519 (removed 20) transitions.
// Phase 1: matrix 499 rows 578 cols
[2024-05-21 16:30:21] [INFO ] Computed 117 invariants in 19 ms
[2024-05-21 16:30:21] [INFO ] Implicit Places using invariants in 321 ms returned []
[2024-05-21 16:30:21] [INFO ] Invariant cache hit.
[2024-05-21 16:30:22] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
Running 498 sub problems to find dead transitions.
[2024-05-21 16:30:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 498 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 498 unsolved
[2024-05-21 16:30:33] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:30:34] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:30:34] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 4 ms to minimize.
[2024-05-21 16:30:34] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:30:34] [INFO ] Deduced a trap composed of 114 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:30:34] [INFO ] Deduced a trap composed of 106 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:30:34] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 3 ms to minimize.
[2024-05-21 16:30:35] [INFO ] Deduced a trap composed of 102 places in 242 ms of which 6 ms to minimize.
[2024-05-21 16:30:35] [INFO ] Deduced a trap composed of 103 places in 276 ms of which 32 ms to minimize.
[2024-05-21 16:30:35] [INFO ] Deduced a trap composed of 83 places in 258 ms of which 8 ms to minimize.
[2024-05-21 16:30:35] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:30:35] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:30:36] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:30:36] [INFO ] Deduced a trap composed of 111 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:30:36] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:30:36] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:30:36] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:30:36] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:30:36] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:30:37] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 20/137 constraints. Problems are: Problem set: 13 solved, 485 unsolved
[2024-05-21 16:30:37] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:30:37] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:30:37] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 2 ms to minimize.
[2024-05-21 16:30:37] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:30:37] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:30:38] [INFO ] Deduced a trap composed of 105 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:30:38] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:30:38] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:30:38] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:30:38] [INFO ] Deduced a trap composed of 120 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:30:38] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:30:38] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:30:38] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:30:39] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:30:39] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:30:39] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:30:39] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:30:39] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:30:39] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:30:39] [INFO ] Deduced a trap composed of 118 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/157 constraints. Problems are: Problem set: 13 solved, 485 unsolved
[2024-05-21 16:30:40] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:30:40] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:30:40] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:30:40] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:30:40] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:30:40] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:30:40] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:30:41] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:30:41] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:30:41] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:30:41] [INFO ] Deduced a trap composed of 123 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:30:41] [INFO ] Deduced a trap composed of 127 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:30:41] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:30:41] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:30:42] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:30:42] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:30:42] [INFO ] Deduced a trap composed of 97 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:30:42] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:30:42] [INFO ] Deduced a trap composed of 115 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:30:42] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 2 ms to minimize.
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/177 constraints. Problems are: Problem set: 15 solved, 483 unsolved
[2024-05-21 16:30:47] [INFO ] Deduced a trap composed of 102 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:30:47] [INFO ] Deduced a trap composed of 115 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:30:47] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:30:47] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:30:47] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:30:47] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:30:47] [INFO ] Deduced a trap composed of 84 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:30:48] [INFO ] Deduced a trap composed of 116 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:30:48] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:30:48] [INFO ] Deduced a trap composed of 114 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:30:48] [INFO ] Deduced a trap composed of 116 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:30:48] [INFO ] Deduced a trap composed of 129 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:30:48] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:30:48] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:30:49] [INFO ] Deduced a trap composed of 103 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:30:49] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:30:49] [INFO ] Deduced a trap composed of 105 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:30:49] [INFO ] Deduced a trap composed of 105 places in 167 ms of which 3 ms to minimize.
[2024-05-21 16:30:49] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:30:49] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/197 constraints. Problems are: Problem set: 15 solved, 483 unsolved
[2024-05-21 16:30:50] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:30:50] [INFO ] Deduced a trap composed of 118 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:30:50] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:30:50] [INFO ] Deduced a trap composed of 101 places in 146 ms of which 4 ms to minimize.
[2024-05-21 16:30:50] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:30:50] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:30:51] [INFO ] Deduced a trap composed of 104 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:30:51] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:30:51] [INFO ] Deduced a trap composed of 107 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:30:51] [INFO ] Deduced a trap composed of 121 places in 122 ms of which 6 ms to minimize.
[2024-05-21 16:30:51] [INFO ] Deduced a trap composed of 103 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:30:51] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:30:51] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 0 ms to minimize.
[2024-05-21 16:30:52] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:30:52] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:30:52] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:30:52] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 3 ms to minimize.
SMT process timed out in 30242ms, After SMT, problems are : Problem set: 15 solved, 483 unsolved
Search for dead transitions found 15 dead transitions in 30251ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 578/598 places, 484/519 transitions.
Applied a total of 0 rules in 10 ms. Remains 578 /578 variables (removed 0) and now considering 484/484 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31284 ms. Remains : 578/598 places, 484/519 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-04 finished in 31506 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(p1)&&(p2 U p3)))))'
Support contains 4 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 585 transition count 506
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 585 transition count 506
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 582 transition count 503
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 582 transition count 503
Applied a total of 32 rules in 45 ms. Remains 582 /598 variables (removed 16) and now considering 503/519 (removed 16) transitions.
// Phase 1: matrix 503 rows 582 cols
[2024-05-21 16:30:52] [INFO ] Computed 117 invariants in 20 ms
[2024-05-21 16:30:53] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-21 16:30:53] [INFO ] Invariant cache hit.
[2024-05-21 16:30:53] [INFO ] Implicit Places using invariants and state equation in 765 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2024-05-21 16:30:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (OVERLAPS) 1/582 variables, 71/112 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 16:31:04] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:31:04] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:31:04] [INFO ] Deduced a trap composed of 109 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:31:05] [INFO ] Deduced a trap composed of 82 places in 167 ms of which 3 ms to minimize.
[2024-05-21 16:31:05] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:31:05] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:31:05] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 4 ms to minimize.
[2024-05-21 16:31:05] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:31:05] [INFO ] Deduced a trap composed of 113 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:31:05] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:31:06] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:31:06] [INFO ] Deduced a trap composed of 118 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:31:06] [INFO ] Deduced a trap composed of 113 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:31:06] [INFO ] Deduced a trap composed of 83 places in 158 ms of which 4 ms to minimize.
[2024-05-21 16:31:06] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:31:06] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 124 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:31:07] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 126 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:31:08] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 123 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 106 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:31:09] [INFO ] Deduced a trap composed of 108 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 111 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 2 ms to minimize.
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 20/157 constraints. Problems are: Problem set: 8 solved, 494 unsolved
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 106 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 125 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:31:10] [INFO ] Deduced a trap composed of 110 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 108 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 108 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 111 places in 139 ms of which 2 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 118 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:31:11] [INFO ] Deduced a trap composed of 129 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 129 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 104 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 107 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:31:12] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:31:13] [INFO ] Deduced a trap composed of 121 places in 126 ms of which 3 ms to minimize.
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 20/177 constraints. Problems are: Problem set: 19 solved, 483 unsolved
[2024-05-21 16:31:17] [INFO ] Deduced a trap composed of 119 places in 163 ms of which 4 ms to minimize.
[2024-05-21 16:31:17] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:31:17] [INFO ] Deduced a trap composed of 119 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:31:18] [INFO ] Deduced a trap composed of 124 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:31:18] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:31:18] [INFO ] Deduced a trap composed of 105 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:31:18] [INFO ] Deduced a trap composed of 105 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:31:18] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:31:18] [INFO ] Deduced a trap composed of 79 places in 172 ms of which 3 ms to minimize.
[2024-05-21 16:31:19] [INFO ] Deduced a trap composed of 112 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:31:19] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:31:19] [INFO ] Deduced a trap composed of 124 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:31:19] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:31:19] [INFO ] Deduced a trap composed of 90 places in 165 ms of which 4 ms to minimize.
[2024-05-21 16:31:19] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:31:19] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:31:20] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:31:20] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:31:20] [INFO ] Deduced a trap composed of 89 places in 164 ms of which 4 ms to minimize.
[2024-05-21 16:31:20] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 20/197 constraints. Problems are: Problem set: 19 solved, 483 unsolved
[2024-05-21 16:31:20] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:31:20] [INFO ] Deduced a trap composed of 101 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 116 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 108 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 3 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 106 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:31:21] [INFO ] Deduced a trap composed of 109 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 101 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 120 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:31:22] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:31:23] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:31:23] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:31:23] [INFO ] Deduced a trap composed of 122 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:31:23] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:31:23] [INFO ] Deduced a trap composed of 131 places in 112 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 20/217 constraints. Problems are: Problem set: 19 solved, 483 unsolved
[2024-05-21 16:31:23] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:31:23] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:31:23] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 582/1085 variables, and 220 constraints, problems are : Problem set: 19 solved, 483 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/582 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 103/103 constraints]
Escalating to Integer solving :Problem set: 19 solved, 483 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 41/41 constraints. Problems are: Problem set: 19 solved, 483 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 0/41 constraints. Problems are: Problem set: 19 solved, 483 unsolved
At refinement iteration 2 (OVERLAPS) 1/582 variables, 71/112 constraints. Problems are: Problem set: 19 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 5/117 constraints. Problems are: Problem set: 19 solved, 483 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/582 variables, 103/220 constraints. Problems are: Problem set: 19 solved, 483 unsolved
[2024-05-21 16:31:28] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:31:28] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:31:28] [INFO ] Deduced a trap composed of 130 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:31:28] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:31:29] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:31:29] [INFO ] Deduced a trap composed of 110 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:31:29] [INFO ] Deduced a trap composed of 130 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:31:29] [INFO ] Deduced a trap composed of 109 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:31:29] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:31:29] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:31:29] [INFO ] Deduced a trap composed of 100 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:31:30] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:31:30] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:31:30] [INFO ] Deduced a trap composed of 113 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:31:30] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:31:30] [INFO ] Deduced a trap composed of 122 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:31:30] [INFO ] Deduced a trap composed of 108 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:31:30] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:31:31] [INFO ] Deduced a trap composed of 109 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:31:31] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 2 ms to minimize.
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD453 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 20/240 constraints. Problems are: Problem set: 29 solved, 473 unsolved
[2024-05-21 16:31:32] [INFO ] Deduced a trap composed of 103 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:31:32] [INFO ] Deduced a trap composed of 46 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:31:32] [INFO ] Deduced a trap composed of 114 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:31:32] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:31:32] [INFO ] Deduced a trap composed of 107 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:31:32] [INFO ] Deduced a trap composed of 109 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:31:32] [INFO ] Deduced a trap composed of 117 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 113 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 2 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:31:33] [INFO ] Deduced a trap composed of 123 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 99 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 109 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 110 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:31:34] [INFO ] Deduced a trap composed of 107 places in 133 ms of which 3 ms to minimize.
Problem TDEAD455 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 20/260 constraints. Problems are: Problem set: 30 solved, 472 unsolved
[2024-05-21 16:31:35] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:31:35] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:31:35] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:31:35] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:31:35] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:31:36] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:31:36] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:31:36] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:31:36] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:31:36] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:31:36] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:31:37] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:31:37] [INFO ] Deduced a trap composed of 109 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:31:37] [INFO ] Deduced a trap composed of 132 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:31:37] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 3 ms to minimize.
[2024-05-21 16:31:37] [INFO ] Deduced a trap composed of 118 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:31:38] [INFO ] Deduced a trap composed of 122 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:31:38] [INFO ] Deduced a trap composed of 98 places in 142 ms of which 4 ms to minimize.
[2024-05-21 16:31:38] [INFO ] Deduced a trap composed of 106 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:31:38] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 4 ms to minimize.
Problem TDEAD447 is UNSAT
Problem TDEAD452 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 20/280 constraints. Problems are: Problem set: 32 solved, 470 unsolved
[2024-05-21 16:31:39] [INFO ] Deduced a trap composed of 101 places in 178 ms of which 3 ms to minimize.
[2024-05-21 16:31:39] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:31:39] [INFO ] Deduced a trap composed of 97 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:31:39] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:31:39] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:31:40] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 5 ms to minimize.
[2024-05-21 16:31:40] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:31:40] [INFO ] Deduced a trap composed of 110 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:31:40] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:31:40] [INFO ] Deduced a trap composed of 101 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:31:40] [INFO ] Deduced a trap composed of 97 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:31:40] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:31:41] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:31:41] [INFO ] Deduced a trap composed of 112 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:31:41] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 4 ms to minimize.
[2024-05-21 16:31:41] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:31:41] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:31:41] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:31:41] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:31:42] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 20/300 constraints. Problems are: Problem set: 32 solved, 470 unsolved
[2024-05-21 16:31:42] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:31:42] [INFO ] Deduced a trap composed of 110 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:31:43] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:31:43] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:31:43] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:31:43] [INFO ] Deduced a trap composed of 126 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:31:43] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:31:43] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:31:43] [INFO ] Deduced a trap composed of 117 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:31:44] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:31:44] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:31:44] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:31:44] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:31:44] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:31:44] [INFO ] Deduced a trap composed of 98 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:31:44] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:31:45] [INFO ] Deduced a trap composed of 108 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:31:45] [INFO ] Deduced a trap composed of 108 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:31:45] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:31:45] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 20/320 constraints. Problems are: Problem set: 32 solved, 470 unsolved
[2024-05-21 16:31:45] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:31:46] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:31:46] [INFO ] Deduced a trap composed of 111 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:31:46] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:31:46] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:31:46] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:31:47] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:31:47] [INFO ] Deduced a trap composed of 108 places in 160 ms of which 4 ms to minimize.
[2024-05-21 16:31:47] [INFO ] Deduced a trap composed of 144 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:31:47] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:31:47] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:31:47] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:31:47] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:31:48] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:31:48] [INFO ] Deduced a trap composed of 111 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:31:48] [INFO ] Deduced a trap composed of 101 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:31:48] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:31:48] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:31:48] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:31:49] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 20/340 constraints. Problems are: Problem set: 32 solved, 470 unsolved
[2024-05-21 16:31:50] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:31:50] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:31:50] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:31:50] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:31:51] [INFO ] Deduced a trap composed of 100 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:31:51] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:31:51] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:31:51] [INFO ] Deduced a trap composed of 33 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:31:51] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:31:51] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:31:51] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:31:52] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:31:52] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:31:52] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:31:52] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:31:52] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:31:52] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-05-21 16:31:52] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-05-21 16:31:53] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:31:54] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/582 variables, 20/360 constraints. Problems are: Problem set: 32 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 582/1085 variables, and 360 constraints, problems are : Problem set: 32 solved, 470 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/582 constraints, PredecessorRefiner: 0/502 constraints, Known Traps: 243/243 constraints]
After SMT, in 60181ms problems are : Problem set: 32 solved, 470 unsolved
Search for dead transitions found 32 dead transitions in 60188ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in LTL mode, iteration 1 : 582/598 places, 471/519 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 581 transition count 471
Applied a total of 1 rules in 11 ms. Remains 581 /582 variables (removed 1) and now considering 471/471 (removed 0) transitions.
// Phase 1: matrix 471 rows 581 cols
[2024-05-21 16:31:54] [INFO ] Computed 121 invariants in 4 ms
[2024-05-21 16:31:54] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-21 16:31:54] [INFO ] Invariant cache hit.
[2024-05-21 16:31:54] [INFO ] Implicit Places using invariants and state equation in 502 ms returned [158, 159]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 714 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 579/598 places, 471/519 transitions.
Applied a total of 0 rules in 10 ms. Remains 579 /579 variables (removed 0) and now considering 471/471 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62025 ms. Remains : 579/598 places, 471/519 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p3) (NOT p1)), true, (NOT p1), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-05 finished in 62266 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)))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Graph (trivial) has 288 edges and 598 vertex of which 6 / 598 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1310 edges and 593 vertex of which 592 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 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 591 transition count 437
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 150 place count 517 transition count 437
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 150 place count 517 transition count 313
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 2 with 272 rules applied. Total rules applied 422 place count 369 transition count 313
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 436 place count 355 transition count 299
Iterating global reduction 2 with 14 rules applied. Total rules applied 450 place count 355 transition count 299
Performed 151 Post agglomeration using F-continuation condition.Transition count delta: 151
Deduced a syphon composed of 151 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 307 rules applied. Total rules applied 757 place count 199 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 759 place count 198 transition count 151
Applied a total of 759 rules in 54 ms. Remains 198 /598 variables (removed 400) and now considering 151/519 (removed 368) transitions.
// Phase 1: matrix 151 rows 198 cols
[2024-05-21 16:31:55] [INFO ] Computed 88 invariants in 1 ms
[2024-05-21 16:31:55] [INFO ] Implicit Places using invariants in 117 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 118 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/598 places, 151/519 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 191 ms. Remains : 170/598 places, 151/519 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-06
Product exploration explored 100000 steps with 21430 reset in 279 ms.
Product exploration explored 100000 steps with 21502 reset in 295 ms.
Computed a total of 147 stabilizing places and 133 stable transitions
Computed a total of 147 stabilizing places and 133 stable transitions
Detected a total of 147/170 stabilizing places and 133/151 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9766 resets) in 812 ms. (49 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (2990 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 161 steps, run visited all 1 properties in 6 ms. (steps per millisecond=26 )
Probabilistic random walk after 161 steps, saw 100 distinct states, run finished after 7 ms. (steps per millisecond=23 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 151/151 transitions.
Applied a total of 0 rules in 10 ms. Remains 170 /170 variables (removed 0) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 170 cols
[2024-05-21 16:31:56] [INFO ] Computed 60 invariants in 3 ms
[2024-05-21 16:31:56] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 16:31:56] [INFO ] Invariant cache hit.
[2024-05-21 16:31:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 16:31:56] [INFO ] Implicit Places using invariants and state equation in 189 ms returned [1, 3, 5, 10, 35, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 61, 76, 78, 82, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 299 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/170 places, 151/151 transitions.
Graph (complete) has 429 edges and 136 vertex of which 125 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 125 transition count 133
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 112 transition count 133
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 40 place count 99 transition count 92
Iterating global reduction 2 with 13 rules applied. Total rules applied 53 place count 99 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 56 place count 99 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 59 place count 96 transition count 89
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 62 place count 93 transition count 86
Iterating global reduction 4 with 3 rules applied. Total rules applied 65 place count 93 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 68 place count 93 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 69 place count 92 transition count 83
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 84 place count 84 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 86 place count 83 transition count 75
Applied a total of 86 rules in 17 ms. Remains 83 /136 variables (removed 53) and now considering 75/151 (removed 76) transitions.
// Phase 1: matrix 75 rows 83 cols
[2024-05-21 16:31:56] [INFO ] Computed 21 invariants in 1 ms
[2024-05-21 16:31:56] [INFO ] Implicit Places using invariants in 84 ms returned [5, 6, 7]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 86 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/170 places, 75/151 transitions.
Applied a total of 0 rules in 16 ms. Remains 80 /80 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 429 ms. Remains : 80/170 places, 75/151 transitions.
Computed a total of 57 stabilizing places and 57 stable transitions
Computed a total of 57 stabilizing places and 57 stable transitions
Detected a total of 57/80 stabilizing places and 57/75 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 40000 steps (10027 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3042 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 120 steps, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Probabilistic random walk after 120 steps, saw 73 distinct states, run finished after 5 ms. (steps per millisecond=24 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21909 reset in 132 ms.
Product exploration explored 100000 steps with 21866 reset in 175 ms.
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 75/75 (removed 0) transitions.
// Phase 1: matrix 75 rows 80 cols
[2024-05-21 16:31:57] [INFO ] Computed 18 invariants in 1 ms
[2024-05-21 16:31:57] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 16:31:57] [INFO ] Invariant cache hit.
[2024-05-21 16:31:57] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:31:57] [INFO ] Implicit Places using invariants and state equation in 132 ms returned [33, 36, 38]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 220 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/80 places, 75/75 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 77 transition count 72
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 74 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 73 transition count 71
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 73 transition count 71
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 31 place count 59 transition count 62
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 34 place count 56 transition count 59
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 56 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 39 place count 55 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 55 transition count 56
Applied a total of 41 rules in 14 ms. Remains 55 /77 variables (removed 22) and now considering 56/75 (removed 19) transitions.
// Phase 1: matrix 56 rows 55 cols
[2024-05-21 16:31:57] [INFO ] Computed 10 invariants in 0 ms
[2024-05-21 16:31:58] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 16:31:58] [INFO ] Invariant cache hit.
[2024-05-21 16:31:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 16:31:58] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/80 places, 56/75 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 388 ms. Remains : 55/80 places, 56/75 transitions.
Treatment of property BusinessProcesses-PT-19-LTLFireability-06 finished in 3162 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)||(p1 U X(p2)))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 585 transition count 506
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 585 transition count 506
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 581 transition count 502
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 581 transition count 502
Applied a total of 34 rules in 44 ms. Remains 581 /598 variables (removed 17) and now considering 502/519 (removed 17) transitions.
// Phase 1: matrix 502 rows 581 cols
[2024-05-21 16:31:58] [INFO ] Computed 117 invariants in 4 ms
[2024-05-21 16:31:58] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-21 16:31:58] [INFO ] Invariant cache hit.
[2024-05-21 16:31:59] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 961 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2024-05-21 16:31:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-21 16:32:09] [INFO ] Deduced a trap composed of 103 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:32:09] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:32:09] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:32:10] [INFO ] Deduced a trap composed of 101 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:32:10] [INFO ] Deduced a trap composed of 107 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:32:10] [INFO ] Deduced a trap composed of 125 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:32:10] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:32:10] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:32:10] [INFO ] Deduced a trap composed of 116 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:32:10] [INFO ] Deduced a trap composed of 107 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:32:11] [INFO ] Deduced a trap composed of 109 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:32:11] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 5 ms to minimize.
[2024-05-21 16:32:11] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:32:11] [INFO ] Deduced a trap composed of 81 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:32:11] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:32:11] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:32:11] [INFO ] Deduced a trap composed of 110 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:32:12] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:32:12] [INFO ] Deduced a trap composed of 118 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:32:12] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 3 ms to minimize.
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 14 solved, 487 unsolved
[2024-05-21 16:32:12] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:32:12] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 4 ms to minimize.
[2024-05-21 16:32:13] [INFO ] Deduced a trap composed of 80 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:32:13] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:32:13] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:32:13] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:32:13] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:32:13] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:32:13] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:32:14] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:32:14] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:32:14] [INFO ] Deduced a trap composed of 106 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:32:14] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:32:14] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:32:14] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:32:14] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:32:14] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:32:15] [INFO ] Deduced a trap composed of 125 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:32:15] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:32:15] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/157 constraints. Problems are: Problem set: 14 solved, 487 unsolved
[2024-05-21 16:32:15] [INFO ] Deduced a trap composed of 104 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:32:15] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:32:16] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:32:16] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:32:16] [INFO ] Deduced a trap composed of 91 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:32:16] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:32:16] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:32:16] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:32:16] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:32:17] [INFO ] Deduced a trap composed of 123 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:32:17] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:32:17] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:32:17] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:32:17] [INFO ] Deduced a trap composed of 123 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:32:17] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:32:17] [INFO ] Deduced a trap composed of 128 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:32:17] [INFO ] Deduced a trap composed of 116 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:32:18] [INFO ] Deduced a trap composed of 121 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:32:18] [INFO ] Deduced a trap composed of 80 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:32:18] [INFO ] Deduced a trap composed of 125 places in 104 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/177 constraints. Problems are: Problem set: 14 solved, 487 unsolved
[2024-05-21 16:32:22] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:32:22] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:32:23] [INFO ] Deduced a trap composed of 105 places in 183 ms of which 3 ms to minimize.
[2024-05-21 16:32:23] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:32:23] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:32:23] [INFO ] Deduced a trap composed of 104 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:32:23] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:32:23] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:32:24] [INFO ] Deduced a trap composed of 107 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:32:24] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:32:24] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:32:24] [INFO ] Deduced a trap composed of 115 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:32:24] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:32:24] [INFO ] Deduced a trap composed of 109 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:32:24] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:32:25] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:32:25] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:32:25] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:32:25] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:32:25] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 3 ms to minimize.
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/197 constraints. Problems are: Problem set: 25 solved, 476 unsolved
[2024-05-21 16:32:26] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:32:26] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:32:26] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:32:26] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:32:26] [INFO ] Deduced a trap composed of 110 places in 174 ms of which 3 ms to minimize.
[2024-05-21 16:32:26] [INFO ] Deduced a trap composed of 100 places in 153 ms of which 4 ms to minimize.
[2024-05-21 16:32:27] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:32:27] [INFO ] Deduced a trap composed of 107 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:32:27] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:32:27] [INFO ] Deduced a trap composed of 48 places in 32 ms of which 1 ms to minimize.
[2024-05-21 16:32:27] [INFO ] Deduced a trap composed of 45 places in 27 ms of which 0 ms to minimize.
[2024-05-21 16:32:27] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:32:27] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:32:28] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:32:28] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:32:28] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:32:28] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:32:28] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:32:28] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:32:28] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 20/217 constraints. Problems are: Problem set: 25 solved, 476 unsolved
[2024-05-21 16:32:29] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:32:29] [INFO ] Deduced a trap composed of 38 places in 110 ms of which 2 ms to minimize.
SMT process timed out in 30170ms, After SMT, problems are : Problem set: 25 solved, 476 unsolved
Search for dead transitions found 25 dead transitions in 30177ms
Found 25 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 25 transitions
Dead transitions reduction (with SMT) removed 25 transitions
Starting structural reductions in LTL mode, iteration 1 : 581/598 places, 477/519 transitions.
Applied a total of 0 rules in 11 ms. Remains 581 /581 variables (removed 0) and now considering 477/477 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31196 ms. Remains : 581/598 places, 477/519 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 253 ms.
Product exploration explored 100000 steps with 33333 reset in 259 ms.
Computed a total of 524 stabilizing places and 430 stable transitions
Graph (complete) has 1246 edges and 581 vertex of which 580 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 524 stabilizing places and 430 stable transitions
Detected a total of 524/581 stabilizing places and 430/477 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 30 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-19-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-19-LTLFireability-07 finished in 31942 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)&&F(G(p1)))))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Graph (trivial) has 288 edges and 598 vertex of which 6 / 598 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 1310 edges and 593 vertex of which 592 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 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 75 place count 591 transition count 438
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 148 place count 518 transition count 438
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 148 place count 518 transition count 312
Deduced a syphon composed of 126 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 277 rules applied. Total rules applied 425 place count 367 transition count 312
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 438 place count 354 transition count 299
Iterating global reduction 2 with 13 rules applied. Total rules applied 451 place count 354 transition count 299
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 305 rules applied. Total rules applied 756 place count 199 transition count 149
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 758 place count 198 transition count 152
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 764 place count 198 transition count 152
Applied a total of 764 rules in 68 ms. Remains 198 /598 variables (removed 400) and now considering 152/519 (removed 367) transitions.
// Phase 1: matrix 152 rows 198 cols
[2024-05-21 16:32:30] [INFO ] Computed 87 invariants in 1 ms
[2024-05-21 16:32:30] [INFO ] Implicit Places using invariants in 171 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 182 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/598 places, 152/519 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 255 ms. Remains : 170/598 places, 152/519 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-08 finished in 443 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(X(p0)) U (!p0||F((p1||X(p2)))))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 583 transition count 504
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 583 transition count 504
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 579 transition count 500
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 579 transition count 500
Applied a total of 38 rules in 28 ms. Remains 579 /598 variables (removed 19) and now considering 500/519 (removed 19) transitions.
// Phase 1: matrix 500 rows 579 cols
[2024-05-21 16:32:30] [INFO ] Computed 117 invariants in 4 ms
[2024-05-21 16:32:30] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-21 16:32:30] [INFO ] Invariant cache hit.
[2024-05-21 16:32:31] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2024-05-21 16:32:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-21 16:32:42] [INFO ] Deduced a trap composed of 85 places in 153 ms of which 2 ms to minimize.
[2024-05-21 16:32:42] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:32:42] [INFO ] Deduced a trap composed of 111 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:32:42] [INFO ] Deduced a trap composed of 121 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:32:43] [INFO ] Deduced a trap composed of 122 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:32:43] [INFO ] Deduced a trap composed of 103 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:32:43] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:32:43] [INFO ] Deduced a trap composed of 109 places in 163 ms of which 4 ms to minimize.
[2024-05-21 16:32:43] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:32:43] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:32:43] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:32:44] [INFO ] Deduced a trap composed of 120 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:32:44] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:32:44] [INFO ] Deduced a trap composed of 109 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:32:44] [INFO ] Deduced a trap composed of 109 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:32:44] [INFO ] Deduced a trap composed of 109 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:32:44] [INFO ] Deduced a trap composed of 109 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:32:44] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:32:45] [INFO ] Deduced a trap composed of 115 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:32:45] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 11 solved, 488 unsolved
[2024-05-21 16:32:45] [INFO ] Deduced a trap composed of 118 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:32:45] [INFO ] Deduced a trap composed of 82 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:32:45] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:32:45] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 3 ms to minimize.
[2024-05-21 16:32:46] [INFO ] Deduced a trap composed of 122 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:32:46] [INFO ] Deduced a trap composed of 106 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:32:46] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:32:46] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:32:46] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:32:47] [INFO ] Deduced a trap composed of 102 places in 164 ms of which 4 ms to minimize.
[2024-05-21 16:32:47] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:32:47] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:32:47] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 4 ms to minimize.
[2024-05-21 16:32:47] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:32:48] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:32:48] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:32:48] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:32:48] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:32:48] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:32:48] [INFO ] Deduced a trap composed of 105 places in 172 ms of which 4 ms to minimize.
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/157 constraints. Problems are: Problem set: 20 solved, 479 unsolved
[2024-05-21 16:32:49] [INFO ] Deduced a trap composed of 99 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:32:49] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:32:49] [INFO ] Deduced a trap composed of 132 places in 167 ms of which 3 ms to minimize.
[2024-05-21 16:32:49] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:32:50] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:32:50] [INFO ] Deduced a trap composed of 108 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:32:50] [INFO ] Deduced a trap composed of 104 places in 172 ms of which 3 ms to minimize.
[2024-05-21 16:32:50] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:32:50] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:32:51] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:32:51] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:32:51] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:32:51] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:32:51] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:32:51] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:32:51] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:32:51] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:32:52] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:32:52] [INFO ] Deduced a trap composed of 97 places in 184 ms of which 22 ms to minimize.
[2024-05-21 16:32:52] [INFO ] Deduced a trap composed of 100 places in 163 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/177 constraints. Problems are: Problem set: 20 solved, 479 unsolved
[2024-05-21 16:32:57] [INFO ] Deduced a trap composed of 100 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:32:57] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 4 ms to minimize.
[2024-05-21 16:32:57] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:32:57] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:32:57] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:32:58] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:32:58] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:32:58] [INFO ] Deduced a trap composed of 99 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:32:58] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 5 ms to minimize.
[2024-05-21 16:32:58] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:32:58] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:32:58] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 104 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:32:59] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:33:00] [INFO ] Deduced a trap composed of 102 places in 154 ms of which 3 ms to minimize.
Problem TDEAD407 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD452 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 20/197 constraints. Problems are: Problem set: 24 solved, 475 unsolved
[2024-05-21 16:33:00] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:33:00] [INFO ] Deduced a trap composed of 118 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:33:00] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:33:01] [INFO ] Deduced a trap composed of 122 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:33:01] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:33:01] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:33:01] [INFO ] Deduced a trap composed of 111 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:33:01] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 3 ms to minimize.
SMT process timed out in 30154ms, After SMT, problems are : Problem set: 24 solved, 475 unsolved
Search for dead transitions found 24 dead transitions in 30162ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in LTL mode, iteration 1 : 579/598 places, 476/519 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 578 transition count 476
Applied a total of 1 rules in 11 ms. Remains 578 /579 variables (removed 1) and now considering 476/476 (removed 0) transitions.
// Phase 1: matrix 476 rows 578 cols
[2024-05-21 16:33:01] [INFO ] Computed 118 invariants in 4 ms
[2024-05-21 16:33:01] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-21 16:33:01] [INFO ] Invariant cache hit.
[2024-05-21 16:33:02] [INFO ] Implicit Places using invariants and state equation in 688 ms returned [158]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 939 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 577/598 places, 476/519 transitions.
Applied a total of 0 rules in 16 ms. Remains 577 /577 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 32035 ms. Remains : 577/598 places, 476/519 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-09
Product exploration explored 100000 steps with 879 reset in 338 ms.
Product exploration explored 100000 steps with 870 reset in 272 ms.
Computed a total of 520 stabilizing places and 429 stable transitions
Graph (complete) has 1236 edges and 577 vertex of which 576 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 520 stabilizing places and 429 stable transitions
Detected a total of 520/577 stabilizing places and 429/476 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 704 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 537 steps (0 resets) in 6 ms. (76 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F p0), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 15 factoid took 1585 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 577/577 places, 476/476 transitions.
Graph (trivial) has 268 edges and 577 vertex of which 6 / 577 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1230 edges and 572 vertex of which 571 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 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 64 place count 570 transition count 406
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 126 place count 508 transition count 406
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 126 place count 508 transition count 282
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 2 with 273 rules applied. Total rules applied 399 place count 359 transition count 282
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 155
Deduced a syphon composed of 155 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 316 rules applied. Total rules applied 715 place count 198 transition count 127
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 717 place count 197 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 718 place count 196 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 719 place count 195 transition count 129
Applied a total of 719 rules in 49 ms. Remains 195 /577 variables (removed 382) and now considering 129/476 (removed 347) transitions.
// Phase 1: matrix 129 rows 195 cols
[2024-05-21 16:33:06] [INFO ] Computed 85 invariants in 2 ms
[2024-05-21 16:33:06] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 16:33:06] [INFO ] Invariant cache hit.
[2024-05-21 16:33:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 16:33:06] [INFO ] Implicit Places using invariants and state equation in 253 ms returned [43, 60, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 85, 87, 88, 103, 105, 109, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 181, 185, 187, 189]
Discarding 34 places :
Implicit Place search using SMT with State Equation took 446 ms to find 34 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/577 places, 129/476 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 161 transition count 116
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 148 transition count 116
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 144 transition count 111
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 144 transition count 111
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 37 place count 144 transition count 108
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 40 place count 141 transition count 108
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 54 place count 134 transition count 101
Applied a total of 54 rules in 11 ms. Remains 134 /161 variables (removed 27) and now considering 101/129 (removed 28) transitions.
// Phase 1: matrix 101 rows 134 cols
[2024-05-21 16:33:06] [INFO ] Computed 53 invariants in 1 ms
[2024-05-21 16:33:06] [INFO ] Implicit Places using invariants in 84 ms returned [14, 117]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 85 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 132/577 places, 101/476 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 130 transition count 99
Applied a total of 4 rules in 5 ms. Remains 130 /132 variables (removed 2) and now considering 99/101 (removed 2) transitions.
// Phase 1: matrix 99 rows 130 cols
[2024-05-21 16:33:06] [INFO ] Computed 51 invariants in 1 ms
[2024-05-21 16:33:06] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 16:33:06] [INFO ] Invariant cache hit.
[2024-05-21 16:33:06] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 16:33:06] [INFO ] Implicit Places using invariants and state equation in 170 ms returned [5, 6, 7, 8, 9, 11, 13, 19, 22, 23, 24, 25, 26, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 255 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 106/577 places, 99/476 transitions.
Graph (complete) has 345 edges and 106 vertex of which 97 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 92 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 92 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 13 place count 92 transition count 85
Applied a total of 13 rules in 5 ms. Remains 92 /106 variables (removed 14) and now considering 85/99 (removed 14) transitions.
// Phase 1: matrix 85 rows 92 cols
[2024-05-21 16:33:06] [INFO ] Computed 22 invariants in 9 ms
[2024-05-21 16:33:07] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 16:33:07] [INFO ] Invariant cache hit.
[2024-05-21 16:33:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-21 16:33:07] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 153 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 91/577 places, 85/476 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 5 iterations and 1012 ms. Remains : 91/577 places, 85/476 transitions.
Computed a total of 71 stabilizing places and 71 stable transitions
Computed a total of 71 stabilizing places and 71 stable transitions
Detected a total of 71/91 stabilizing places and 71/85 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 671 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40 steps (1 resets) in 6 ms. (5 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 4 factoid took 979 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-09 finished in 38560 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(F((p1||G(p2)))))))'
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Graph (trivial) has 289 edges and 598 vertex of which 6 / 598 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 1310 edges and 593 vertex of which 592 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 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 591 transition count 437
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 150 place count 517 transition count 437
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 150 place count 517 transition count 311
Deduced a syphon composed of 126 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 277 rules applied. Total rules applied 427 place count 366 transition count 311
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 441 place count 352 transition count 297
Iterating global reduction 2 with 14 rules applied. Total rules applied 455 place count 352 transition count 297
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Deduced a syphon composed of 148 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 301 rules applied. Total rules applied 756 place count 199 transition count 149
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 758 place count 198 transition count 152
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 764 place count 198 transition count 152
Applied a total of 764 rules in 63 ms. Remains 198 /598 variables (removed 400) and now considering 152/519 (removed 367) transitions.
// Phase 1: matrix 152 rows 198 cols
[2024-05-21 16:33:09] [INFO ] Computed 87 invariants in 4 ms
[2024-05-21 16:33:09] [INFO ] Implicit Places using invariants in 195 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 197 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/598 places, 152/519 transitions.
Applied a total of 0 rules in 4 ms. Remains 170 /170 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 265 ms. Remains : 170/598 places, 152/519 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-10
Product exploration explored 100000 steps with 21133 reset in 216 ms.
Product exploration explored 100000 steps with 21098 reset in 233 ms.
Computed a total of 147 stabilizing places and 134 stable transitions
Computed a total of 147 stabilizing places and 134 stable transitions
Detected a total of 147/170 stabilizing places and 134/152 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 16 factoid took 1490 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (6795 resets) in 344 ms. (115 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (2412 resets) in 282 ms. (141 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (2805 resets) in 308 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (2792 resets) in 353 ms. (112 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (2456 resets) in 298 ms. (133 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (2810 resets) in 237 ms. (168 steps per ms) remains 5/5 properties
// Phase 1: matrix 152 rows 170 cols
[2024-05-21 16:33:12] [INFO ] Computed 59 invariants in 2 ms
[2024-05-21 16:33:12] [INFO ] State equation strengthened by 4 read => feed constraints.
Problem apf4 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 78/137 variables, 39/42 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 16:33:12] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-21 16:33:12] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-21 16:33:12] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 2 ms to minimize.
[2024-05-21 16:33:12] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 4/46 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 29/166 variables, 17/63 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-21 16:33:12] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 1/64 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 151/317 variables, 166/230 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 4/234 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 4/321 variables, 4/238 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/321 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/321 variables, 0/238 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/322 variables, and 238 constraints, problems are : Problem set: 1 solved, 4 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 170/170 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 57/59 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 78/137 variables, 39/42 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 4/46 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 29/166 variables, 17/63 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 1/64 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 151/317 variables, 166/230 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 4/234 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/317 variables, 2/236 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-21 16:33:13] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 1/237 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 0/237 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 4/321 variables, 4/241 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 1/242 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-21 16:33:13] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 1/243 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/321 variables, 0/243 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/321 variables, 0/243 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/322 variables, and 243 constraints, problems are : Problem set: 2 solved, 3 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 170/170 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 7/7 constraints]
After SMT, in 974ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 88 ms.
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 152/152 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 170 transition count 151
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 170 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 168 transition count 149
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 168 transition count 149
Applied a total of 6 rules in 18 ms. Remains 168 /170 variables (removed 2) and now considering 149/152 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 168/170 places, 149/152 transitions.
RANDOM walk for 1643 steps (71 resets) in 37 ms. (43 steps per ms) remains 0/3 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) (NOT p2) p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p2 p1))), (F p0), (F (NOT p2)), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (F p1)]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 780 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-19-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-19-LTLFireability-10 finished in 5005 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 4 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Graph (trivial) has 288 edges and 598 vertex of which 6 / 598 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 1310 edges and 593 vertex of which 592 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 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 591 transition count 437
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 150 place count 517 transition count 437
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 125 Pre rules applied. Total rules applied 150 place count 517 transition count 312
Deduced a syphon composed of 125 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 2 with 275 rules applied. Total rules applied 425 place count 367 transition count 312
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 439 place count 353 transition count 298
Iterating global reduction 2 with 14 rules applied. Total rules applied 453 place count 353 transition count 298
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Deduced a syphon composed of 148 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 301 rules applied. Total rules applied 754 place count 200 transition count 150
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 756 place count 199 transition count 153
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 762 place count 199 transition count 153
Applied a total of 762 rules in 67 ms. Remains 199 /598 variables (removed 399) and now considering 153/519 (removed 366) transitions.
// Phase 1: matrix 153 rows 199 cols
[2024-05-21 16:33:14] [INFO ] Computed 87 invariants in 2 ms
[2024-05-21 16:33:14] [INFO ] Implicit Places using invariants in 166 ms returned [1, 2, 3, 4, 5, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60]
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 : 171/598 places, 153/519 transitions.
Applied a total of 0 rules in 4 ms. Remains 171 /171 variables (removed 0) and now considering 153/153 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 238 ms. Remains : 171/598 places, 153/519 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-11 finished in 292 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)||G(p1))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 584 transition count 505
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 584 transition count 505
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 581 transition count 502
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 581 transition count 502
Applied a total of 34 rules in 37 ms. Remains 581 /598 variables (removed 17) and now considering 502/519 (removed 17) transitions.
// Phase 1: matrix 502 rows 581 cols
[2024-05-21 16:33:14] [INFO ] Computed 117 invariants in 5 ms
[2024-05-21 16:33:14] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-21 16:33:14] [INFO ] Invariant cache hit.
[2024-05-21 16:33:15] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
Running 501 sub problems to find dead transitions.
[2024-05-21 16:33:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 501 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-21 16:33:26] [INFO ] Deduced a trap composed of 80 places in 200 ms of which 4 ms to minimize.
[2024-05-21 16:33:26] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:33:26] [INFO ] Deduced a trap composed of 124 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:33:26] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:33:26] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:33:26] [INFO ] Deduced a trap composed of 126 places in 177 ms of which 2 ms to minimize.
[2024-05-21 16:33:27] [INFO ] Deduced a trap composed of 83 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:33:27] [INFO ] Deduced a trap composed of 127 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:33:27] [INFO ] Deduced a trap composed of 107 places in 197 ms of which 2 ms to minimize.
[2024-05-21 16:33:27] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:33:27] [INFO ] Deduced a trap composed of 109 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:33:27] [INFO ] Deduced a trap composed of 109 places in 204 ms of which 3 ms to minimize.
[2024-05-21 16:33:28] [INFO ] Deduced a trap composed of 108 places in 197 ms of which 7 ms to minimize.
[2024-05-21 16:33:28] [INFO ] Deduced a trap composed of 89 places in 190 ms of which 6 ms to minimize.
[2024-05-21 16:33:28] [INFO ] Deduced a trap composed of 107 places in 201 ms of which 8 ms to minimize.
[2024-05-21 16:33:28] [INFO ] Deduced a trap composed of 116 places in 200 ms of which 5 ms to minimize.
[2024-05-21 16:33:28] [INFO ] Deduced a trap composed of 111 places in 175 ms of which 2 ms to minimize.
[2024-05-21 16:33:29] [INFO ] Deduced a trap composed of 109 places in 227 ms of which 2 ms to minimize.
[2024-05-21 16:33:29] [INFO ] Deduced a trap composed of 108 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:33:29] [INFO ] Deduced a trap composed of 110 places in 185 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 501 unsolved
[2024-05-21 16:33:30] [INFO ] Deduced a trap composed of 109 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:33:30] [INFO ] Deduced a trap composed of 103 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:33:30] [INFO ] Deduced a trap composed of 114 places in 208 ms of which 6 ms to minimize.
[2024-05-21 16:33:30] [INFO ] Deduced a trap composed of 132 places in 208 ms of which 3 ms to minimize.
[2024-05-21 16:33:30] [INFO ] Deduced a trap composed of 107 places in 231 ms of which 5 ms to minimize.
[2024-05-21 16:33:31] [INFO ] Deduced a trap composed of 112 places in 201 ms of which 5 ms to minimize.
[2024-05-21 16:33:31] [INFO ] Deduced a trap composed of 126 places in 194 ms of which 5 ms to minimize.
[2024-05-21 16:33:31] [INFO ] Deduced a trap composed of 106 places in 218 ms of which 3 ms to minimize.
[2024-05-21 16:33:32] [INFO ] Deduced a trap composed of 127 places in 141 ms of which 4 ms to minimize.
[2024-05-21 16:33:32] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:33:32] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 4 ms to minimize.
[2024-05-21 16:33:32] [INFO ] Deduced a trap composed of 122 places in 147 ms of which 4 ms to minimize.
[2024-05-21 16:33:32] [INFO ] Deduced a trap composed of 85 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:33:32] [INFO ] Deduced a trap composed of 107 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:33:32] [INFO ] Deduced a trap composed of 113 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:33:33] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 4 ms to minimize.
[2024-05-21 16:33:33] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:33:33] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:33:33] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:33:33] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 3 ms to minimize.
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/157 constraints. Problems are: Problem set: 10 solved, 491 unsolved
[2024-05-21 16:33:34] [INFO ] Deduced a trap composed of 107 places in 180 ms of which 3 ms to minimize.
[2024-05-21 16:33:34] [INFO ] Deduced a trap composed of 27 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:33:34] [INFO ] Deduced a trap composed of 29 places in 185 ms of which 4 ms to minimize.
[2024-05-21 16:33:34] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:33:34] [INFO ] Deduced a trap composed of 112 places in 139 ms of which 2 ms to minimize.
[2024-05-21 16:33:35] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:33:35] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 2 ms to minimize.
[2024-05-21 16:33:35] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:33:35] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:33:35] [INFO ] Deduced a trap composed of 111 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:33:35] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:33:36] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:33:36] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:33:36] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:33:36] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:33:36] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:33:36] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:33:36] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 1 ms to minimize.
[2024-05-21 16:33:36] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 3 ms to minimize.
[2024-05-21 16:33:36] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/177 constraints. Problems are: Problem set: 10 solved, 491 unsolved
[2024-05-21 16:33:41] [INFO ] Deduced a trap composed of 113 places in 181 ms of which 3 ms to minimize.
[2024-05-21 16:33:41] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:33:41] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:33:41] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:33:42] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:33:42] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:33:42] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:33:42] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:33:42] [INFO ] Deduced a trap composed of 125 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:33:42] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:33:42] [INFO ] Deduced a trap composed of 112 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:33:43] [INFO ] Deduced a trap composed of 128 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:33:43] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:33:43] [INFO ] Deduced a trap composed of 102 places in 133 ms of which 4 ms to minimize.
[2024-05-21 16:33:43] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:33:43] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:33:43] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:33:43] [INFO ] Deduced a trap composed of 101 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:33:44] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:33:44] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/197 constraints. Problems are: Problem set: 10 solved, 491 unsolved
[2024-05-21 16:33:44] [INFO ] Deduced a trap composed of 39 places in 21 ms of which 1 ms to minimize.
[2024-05-21 16:33:44] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:33:44] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:33:44] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:33:44] [INFO ] Deduced a trap composed of 103 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:33:45] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:33:45] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:33:45] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:33:45] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:33:45] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 2 ms to minimize.
SMT process timed out in 30181ms, After SMT, problems are : Problem set: 10 solved, 491 unsolved
Search for dead transitions found 10 dead transitions in 30185ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 581/598 places, 492/519 transitions.
Applied a total of 0 rules in 11 ms. Remains 581 /581 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31165 ms. Remains : 581/598 places, 492/519 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-12
Stuttering criterion allowed to conclude after 7442 steps with 41 reset in 18 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-12 finished in 31304 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))&&F(p1))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 583 transition count 504
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 583 transition count 504
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 579 transition count 500
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 579 transition count 500
Applied a total of 38 rules in 34 ms. Remains 579 /598 variables (removed 19) and now considering 500/519 (removed 19) transitions.
// Phase 1: matrix 500 rows 579 cols
[2024-05-21 16:33:45] [INFO ] Computed 117 invariants in 5 ms
[2024-05-21 16:33:46] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-21 16:33:46] [INFO ] Invariant cache hit.
[2024-05-21 16:33:46] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Running 499 sub problems to find dead transitions.
[2024-05-21 16:33:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 499 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-21 16:33:58] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:33:58] [INFO ] Deduced a trap composed of 83 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:33:58] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 4 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:33:59] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:34:00] [INFO ] Deduced a trap composed of 108 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:34:00] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 2 ms to minimize.
[2024-05-21 16:34:00] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:34:00] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:34:00] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 14 ms to minimize.
[2024-05-21 16:34:00] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:34:00] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:34:01] [INFO ] Deduced a trap composed of 110 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:34:01] [INFO ] Deduced a trap composed of 107 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:34:01] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-21 16:34:01] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:34:01] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:34:01] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:34:02] [INFO ] Deduced a trap composed of 81 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:34:02] [INFO ] Deduced a trap composed of 120 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:34:02] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:34:02] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:34:02] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:34:02] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:34:02] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:34:02] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:34:03] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:34:03] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:34:03] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:34:03] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:34:03] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:34:03] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:34:03] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:34:04] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:34:04] [INFO ] Deduced a trap composed of 114 places in 123 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 499 unsolved
[2024-05-21 16:34:04] [INFO ] Deduced a trap composed of 110 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:34:04] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:34:04] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:34:04] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:34:05] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:34:05] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:34:05] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:34:05] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:34:05] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:34:05] [INFO ] Deduced a trap composed of 117 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:34:05] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 118 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 102 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 120 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 123 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:34:06] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:34:07] [INFO ] Deduced a trap composed of 108 places in 112 ms of which 2 ms to minimize.
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/177 constraints. Problems are: Problem set: 21 solved, 478 unsolved
[2024-05-21 16:34:11] [INFO ] Deduced a trap composed of 106 places in 208 ms of which 5 ms to minimize.
[2024-05-21 16:34:11] [INFO ] Deduced a trap composed of 104 places in 215 ms of which 4 ms to minimize.
[2024-05-21 16:34:11] [INFO ] Deduced a trap composed of 108 places in 215 ms of which 5 ms to minimize.
[2024-05-21 16:34:12] [INFO ] Deduced a trap composed of 104 places in 195 ms of which 5 ms to minimize.
[2024-05-21 16:34:12] [INFO ] Deduced a trap composed of 109 places in 194 ms of which 5 ms to minimize.
[2024-05-21 16:34:12] [INFO ] Deduced a trap composed of 118 places in 216 ms of which 3 ms to minimize.
[2024-05-21 16:34:12] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:34:13] [INFO ] Deduced a trap composed of 96 places in 174 ms of which 3 ms to minimize.
[2024-05-21 16:34:13] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:34:13] [INFO ] Deduced a trap composed of 93 places in 215 ms of which 3 ms to minimize.
[2024-05-21 16:34:13] [INFO ] Deduced a trap composed of 104 places in 180 ms of which 3 ms to minimize.
[2024-05-21 16:34:13] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:34:14] [INFO ] Deduced a trap composed of 106 places in 169 ms of which 3 ms to minimize.
[2024-05-21 16:34:14] [INFO ] Deduced a trap composed of 101 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:34:14] [INFO ] Deduced a trap composed of 93 places in 166 ms of which 2 ms to minimize.
[2024-05-21 16:34:14] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:34:14] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:34:14] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:34:15] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:34:15] [INFO ] Deduced a trap composed of 102 places in 146 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 20/197 constraints. Problems are: Problem set: 21 solved, 478 unsolved
[2024-05-21 16:34:15] [INFO ] Deduced a trap composed of 100 places in 233 ms of which 3 ms to minimize.
[2024-05-21 16:34:15] [INFO ] Deduced a trap composed of 114 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:34:16] [INFO ] Deduced a trap composed of 106 places in 204 ms of which 6 ms to minimize.
[2024-05-21 16:34:16] [INFO ] Deduced a trap composed of 104 places in 172 ms of which 3 ms to minimize.
[2024-05-21 16:34:16] [INFO ] Deduced a trap composed of 109 places in 219 ms of which 5 ms to minimize.
[2024-05-21 16:34:16] [INFO ] Deduced a trap composed of 106 places in 177 ms of which 4 ms to minimize.
[2024-05-21 16:34:16] [INFO ] Deduced a trap composed of 105 places in 213 ms of which 6 ms to minimize.
SMT process timed out in 30240ms, After SMT, problems are : Problem set: 21 solved, 478 unsolved
Search for dead transitions found 21 dead transitions in 30245ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in LTL mode, iteration 1 : 579/598 places, 479/519 transitions.
Applied a total of 0 rules in 12 ms. Remains 579 /579 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31166 ms. Remains : 579/598 places, 479/519 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-13
Stuttering criterion allowed to conclude after 183 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-13 finished in 31370 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||G((p1||X(G(p2)))))))))'
Support contains 3 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 583 transition count 504
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 583 transition count 504
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 580 transition count 501
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 580 transition count 501
Applied a total of 36 rules in 60 ms. Remains 580 /598 variables (removed 18) and now considering 501/519 (removed 18) transitions.
// Phase 1: matrix 501 rows 580 cols
[2024-05-21 16:34:17] [INFO ] Computed 117 invariants in 5 ms
[2024-05-21 16:34:17] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-21 16:34:17] [INFO ] Invariant cache hit.
[2024-05-21 16:34:18] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 1017 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-21 16:34:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 71/115 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 16:34:29] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:34:29] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:34:30] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:34:30] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:34:30] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:34:30] [INFO ] Deduced a trap composed of 107 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:34:30] [INFO ] Deduced a trap composed of 109 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:34:30] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:34:31] [INFO ] Deduced a trap composed of 125 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:34:31] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:34:31] [INFO ] Deduced a trap composed of 125 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:34:31] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:34:31] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:34:31] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:34:31] [INFO ] Deduced a trap composed of 125 places in 165 ms of which 3 ms to minimize.
[2024-05-21 16:34:32] [INFO ] Deduced a trap composed of 102 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:34:32] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:34:32] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:34:32] [INFO ] Deduced a trap composed of 124 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:34:32] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 2 ms to minimize.
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 4 solved, 496 unsolved
[2024-05-21 16:34:32] [INFO ] Deduced a trap composed of 101 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:34:33] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:34:33] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-05-21 16:34:33] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:34:33] [INFO ] Deduced a trap composed of 81 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:34:33] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:34:33] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:34:33] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:34:33] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:34:34] [INFO ] Deduced a trap composed of 86 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:34:34] [INFO ] Deduced a trap composed of 117 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:34:34] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:34:34] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:34:34] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:34:35] [INFO ] Deduced a trap composed of 126 places in 166 ms of which 3 ms to minimize.
[2024-05-21 16:34:35] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:34:35] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:34:35] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:34:35] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:34:35] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/157 constraints. Problems are: Problem set: 4 solved, 496 unsolved
[2024-05-21 16:34:36] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:34:36] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:34:36] [INFO ] Deduced a trap composed of 110 places in 138 ms of which 4 ms to minimize.
[2024-05-21 16:34:36] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:34:36] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:34:37] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:34:37] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:34:37] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:34:37] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:34:37] [INFO ] Deduced a trap composed of 103 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:34:37] [INFO ] Deduced a trap composed of 104 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:34:37] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:34:38] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:34:38] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:34:38] [INFO ] Deduced a trap composed of 105 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:34:38] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:34:38] [INFO ] Deduced a trap composed of 110 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:34:38] [INFO ] Deduced a trap composed of 111 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:34:39] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:34:39] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 2 ms to minimize.
Problem TDEAD428 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/177 constraints. Problems are: Problem set: 5 solved, 495 unsolved
[2024-05-21 16:34:44] [INFO ] Deduced a trap composed of 112 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:34:44] [INFO ] Deduced a trap composed of 109 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:34:44] [INFO ] Deduced a trap composed of 113 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:34:44] [INFO ] Deduced a trap composed of 114 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:34:44] [INFO ] Deduced a trap composed of 108 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:34:45] [INFO ] Deduced a trap composed of 94 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:34:45] [INFO ] Deduced a trap composed of 81 places in 143 ms of which 4 ms to minimize.
[2024-05-21 16:34:45] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:34:45] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:34:45] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2024-05-21 16:34:45] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:34:46] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:34:46] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:34:46] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:34:46] [INFO ] Deduced a trap composed of 110 places in 136 ms of which 4 ms to minimize.
[2024-05-21 16:34:46] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:34:46] [INFO ] Deduced a trap composed of 107 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:34:46] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:34:47] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:34:47] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 2 ms to minimize.
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/197 constraints. Problems are: Problem set: 16 solved, 484 unsolved
[2024-05-21 16:34:47] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:34:47] [INFO ] Deduced a trap composed of 124 places in 164 ms of which 3 ms to minimize.
[2024-05-21 16:34:47] [INFO ] Deduced a trap composed of 99 places in 155 ms of which 4 ms to minimize.
[2024-05-21 16:34:48] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:34:48] [INFO ] Deduced a trap composed of 102 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:34:48] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 3 ms to minimize.
SMT process timed out in 30190ms, After SMT, problems are : Problem set: 16 solved, 484 unsolved
Search for dead transitions found 16 dead transitions in 30196ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in LTL mode, iteration 1 : 580/598 places, 485/519 transitions.
Applied a total of 0 rules in 12 ms. Remains 580 /580 variables (removed 0) and now considering 485/485 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31287 ms. Remains : 580/598 places, 485/519 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-14
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-14 finished in 31515 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 X((X(X(G(!p1)))||(p2 U p1)))))'
Support contains 5 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 519/519 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 584 transition count 505
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 584 transition count 505
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 580 transition count 501
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 580 transition count 501
Applied a total of 36 rules in 57 ms. Remains 580 /598 variables (removed 18) and now considering 501/519 (removed 18) transitions.
// Phase 1: matrix 501 rows 580 cols
[2024-05-21 16:34:48] [INFO ] Computed 117 invariants in 7 ms
[2024-05-21 16:34:49] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-21 16:34:49] [INFO ] Invariant cache hit.
[2024-05-21 16:34:49] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
Running 500 sub problems to find dead transitions.
[2024-05-21 16:34:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 500 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 500 unsolved
[2024-05-21 16:35:01] [INFO ] Deduced a trap composed of 104 places in 157 ms of which 4 ms to minimize.
[2024-05-21 16:35:01] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:35:01] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:35:01] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:35:02] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:35:02] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:35:02] [INFO ] Deduced a trap composed of 121 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:35:02] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:35:02] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:35:02] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:35:02] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:35:02] [INFO ] Deduced a trap composed of 129 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:35:03] [INFO ] Deduced a trap composed of 115 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:35:03] [INFO ] Deduced a trap composed of 112 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:35:03] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:35:03] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:35:03] [INFO ] Deduced a trap composed of 108 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:35:03] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:35:03] [INFO ] Deduced a trap composed of 117 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:35:04] [INFO ] Deduced a trap composed of 107 places in 163 ms of which 3 ms to minimize.
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 6 solved, 494 unsolved
[2024-05-21 16:35:04] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:35:04] [INFO ] Deduced a trap composed of 110 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:35:04] [INFO ] Deduced a trap composed of 108 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:35:04] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:35:05] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:35:05] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:35:05] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:35:05] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:35:05] [INFO ] Deduced a trap composed of 104 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:35:05] [INFO ] Deduced a trap composed of 126 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:35:05] [INFO ] Deduced a trap composed of 101 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:35:06] [INFO ] Deduced a trap composed of 101 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:35:06] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:35:06] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:35:06] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:35:06] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 4 ms to minimize.
[2024-05-21 16:35:06] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:35:06] [INFO ] Deduced a trap composed of 116 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:35:07] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:35:07] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 2 ms to minimize.
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/157 constraints. Problems are: Problem set: 13 solved, 487 unsolved
[2024-05-21 16:35:07] [INFO ] Deduced a trap composed of 103 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:35:07] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:35:07] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:35:08] [INFO ] Deduced a trap composed of 105 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:35:08] [INFO ] Deduced a trap composed of 103 places in 141 ms of which 4 ms to minimize.
[2024-05-21 16:35:08] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:35:08] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:35:08] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:35:08] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:35:08] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:35:09] [INFO ] Deduced a trap composed of 103 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:35:09] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:35:09] [INFO ] Deduced a trap composed of 102 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:35:09] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:35:09] [INFO ] Deduced a trap composed of 123 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:35:09] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:35:09] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:35:09] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:35:10] [INFO ] Deduced a trap composed of 105 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:35:10] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 3 ms to minimize.
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD433 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/177 constraints. Problems are: Problem set: 22 solved, 478 unsolved
[2024-05-21 16:35:14] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:35:14] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 3 ms to minimize.
[2024-05-21 16:35:14] [INFO ] Deduced a trap composed of 109 places in 179 ms of which 3 ms to minimize.
[2024-05-21 16:35:14] [INFO ] Deduced a trap composed of 103 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:35:15] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:35:15] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:35:15] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:35:15] [INFO ] Deduced a trap composed of 116 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:35:15] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:35:15] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:35:15] [INFO ] Deduced a trap composed of 123 places in 112 ms of which 3 ms to minimize.
[2024-05-21 16:35:16] [INFO ] Deduced a trap composed of 121 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:35:16] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:35:16] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:35:16] [INFO ] Deduced a trap composed of 109 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:35:16] [INFO ] Deduced a trap composed of 107 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:35:16] [INFO ] Deduced a trap composed of 108 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:35:16] [INFO ] Deduced a trap composed of 106 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:35:16] [INFO ] Deduced a trap composed of 111 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:35:16] [INFO ] Deduced a trap composed of 119 places in 101 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/197 constraints. Problems are: Problem set: 22 solved, 478 unsolved
[2024-05-21 16:35:17] [INFO ] Deduced a trap composed of 85 places in 161 ms of which 3 ms to minimize.
[2024-05-21 16:35:17] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:35:17] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:35:18] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:35:18] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:35:18] [INFO ] Deduced a trap composed of 104 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:35:18] [INFO ] Deduced a trap composed of 102 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:35:18] [INFO ] Deduced a trap composed of 110 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:35:18] [INFO ] Deduced a trap composed of 104 places in 168 ms of which 3 ms to minimize.
[2024-05-21 16:35:19] [INFO ] Deduced a trap composed of 106 places in 170 ms of which 3 ms to minimize.
[2024-05-21 16:35:19] [INFO ] Deduced a trap composed of 101 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:35:19] [INFO ] Deduced a trap composed of 102 places in 172 ms of which 3 ms to minimize.
[2024-05-21 16:35:19] [INFO ] Deduced a trap composed of 103 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:35:19] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 3 ms to minimize.
[2024-05-21 16:35:19] [INFO ] Deduced a trap composed of 109 places in 148 ms of which 3 ms to minimize.
SMT process timed out in 30144ms, After SMT, problems are : Problem set: 22 solved, 478 unsolved
Search for dead transitions found 22 dead transitions in 30150ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 580/598 places, 479/519 transitions.
Applied a total of 0 rules in 9 ms. Remains 580 /580 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31340 ms. Remains : 580/598 places, 479/519 transitions.
Stuttering acceptance computed with spot in 308 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-15
Product exploration explored 100000 steps with 551 reset in 217 ms.
Product exploration explored 100000 steps with 551 reset in 213 ms.
Computed a total of 523 stabilizing places and 432 stable transitions
Graph (complete) has 1252 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 523 stabilizing places and 432 stable transitions
Detected a total of 523/580 stabilizing places and 432/479 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 265 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (218 resets) in 732 ms. (54 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (37 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (28 resets) in 386 ms. (103 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (35 resets) in 397 ms. (100 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (28 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
// Phase 1: matrix 479 rows 580 cols
[2024-05-21 16:35:21] [INFO ] Computed 117 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 150/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 270/425 variables, 65/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:35:22] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:35:22] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:35:22] [INFO ] Deduced a trap composed of 33 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:35:22] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:35:22] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:35:22] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:35:22] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:35:22] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 3 ms to minimize.
[2024-05-21 16:35:23] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 3 ms to minimize.
[2024-05-21 16:35:23] [INFO ] Deduced a trap composed of 96 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:35:23] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:35:23] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:35:23] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:35:23] [INFO ] Deduced a trap composed of 125 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:35:23] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:35:23] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:35:23] [INFO ] Deduced a trap composed of 93 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:35:24] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 18/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 140/565 variables, 44/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:35:24] [INFO ] Deduced a trap composed of 99 places in 170 ms of which 3 ms to minimize.
[2024-05-21 16:35:24] [INFO ] Deduced a trap composed of 48 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:35:24] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 4 ms to minimize.
[2024-05-21 16:35:24] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:35:24] [INFO ] Deduced a trap composed of 113 places in 162 ms of which 3 ms to minimize.
[2024-05-21 16:35:25] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 4 ms to minimize.
[2024-05-21 16:35:25] [INFO ] Deduced a trap composed of 113 places in 142 ms of which 3 ms to minimize.
[2024-05-21 16:35:25] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:35:25] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:35:25] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:35:25] [INFO ] Deduced a trap composed of 116 places in 149 ms of which 4 ms to minimize.
[2024-05-21 16:35:26] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:35:26] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 4 ms to minimize.
[2024-05-21 16:35:26] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:35:26] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:35:26] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:35:26] [INFO ] Deduced a trap composed of 99 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:35:26] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 4 ms to minimize.
[2024-05-21 16:35:27] [INFO ] Deduced a trap composed of 100 places in 152 ms of which 3 ms to minimize.
SMT process timed out in 5128ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 479/479 transitions.
Graph (complete) has 1252 edges and 580 vertex of which 579 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 579 transition count 415
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 516 transition count 413
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 131 place count 514 transition count 413
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 131 place count 514 transition count 289
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 273 rules applied. Total rules applied 404 place count 365 transition count 289
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 3 with 323 rules applied. Total rules applied 727 place count 201 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 728 place count 201 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 730 place count 200 transition count 132
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 736 place count 200 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 737 place count 199 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 738 place count 198 transition count 131
Applied a total of 738 rules in 36 ms. Remains 198 /580 variables (removed 382) and now considering 131/479 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 198/580 places, 131/479 transitions.
RANDOM walk for 40000 steps (4248 resets) in 688 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1066 resets) in 237 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1101 resets) in 209 ms. (190 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1061 resets) in 193 ms. (206 steps per ms) remains 2/4 properties
// Phase 1: matrix 131 rows 198 cols
[2024-05-21 16:35:27] [INFO ] Computed 86 invariants in 1 ms
[2024-05-21 16:35:27] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 42/97 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/133 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/140 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 131/271 variables, 140/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 58/329 variables, 58/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 27/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/329 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 288 constraints, problems are : Problem set: 0 solved, 2 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 198/198 constraints, ReadFeed: 4/4 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 42/97 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/133 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/140 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 131/271 variables, 140/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 4/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 58/329 variables, 58/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 27/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/329 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/329 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 290 constraints, problems are : Problem set: 0 solved, 2 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 198/198 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 438ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 71 ms.
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 131/131 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 198/198 places, 131/131 transitions.
RANDOM walk for 40000 steps (4289 resets) in 564 ms. (70 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1065 resets) in 162 ms. (245 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1055 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1437 steps, run visited all 2 properties in 20 ms. (steps per millisecond=71 )
Probabilistic random walk after 1437 steps, saw 779 distinct states, run finished after 20 ms. (steps per millisecond=71 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F p0), (F p2), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 691 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 350 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 339 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Support contains 5 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 479/479 transitions.
Applied a total of 0 rules in 16 ms. Remains 580 /580 variables (removed 0) and now considering 479/479 (removed 0) transitions.
// Phase 1: matrix 479 rows 580 cols
[2024-05-21 16:35:29] [INFO ] Computed 117 invariants in 7 ms
[2024-05-21 16:35:30] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-21 16:35:30] [INFO ] Invariant cache hit.
[2024-05-21 16:35:30] [INFO ] Implicit Places using invariants and state equation in 752 ms returned [158, 159, 160]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 984 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 577/580 places, 479/479 transitions.
Applied a total of 0 rules in 14 ms. Remains 577 /577 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1016 ms. Remains : 577/580 places, 479/479 transitions.
Computed a total of 520 stabilizing places and 432 stable transitions
Graph (complete) has 1237 edges and 577 vertex of which 576 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 520 stabilizing places and 432 stable transitions
Detected a total of 520/577 stabilizing places and 432/479 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 295 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (219 resets) in 676 ms. (59 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (39 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (28 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (38 resets) in 214 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (39 resets) in 165 ms. (240 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (33 resets) in 201 ms. (198 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (34 resets) in 199 ms. (200 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (29 resets) in 114 ms. (347 steps per ms) remains 4/7 properties
// Phase 1: matrix 479 rows 577 cols
[2024-05-21 16:35:32] [INFO ] Computed 114 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 150/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 273/428 variables, 66/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:35:32] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:35:32] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-21 16:35:32] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-21 16:35:32] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-21 16:35:32] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 127/555 variables, 39/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 10/565 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 471/1036 variables, 565/684 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:35:33] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:35:33] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:35:33] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:35:33] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:35:33] [INFO ] Deduced a trap composed of 107 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:35:33] [INFO ] Deduced a trap composed of 105 places in 119 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1036 variables, 6/690 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1036 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 17/1053 variables, 9/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:35:34] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:35:34] [INFO ] Deduced a trap composed of 108 places in 174 ms of which 4 ms to minimize.
[2024-05-21 16:35:34] [INFO ] Deduced a trap composed of 109 places in 129 ms of which 3 ms to minimize.
[2024-05-21 16:35:34] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:35:34] [INFO ] Deduced a trap composed of 108 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:35:35] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:35:35] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:35:35] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:35:35] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:35:35] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:35:35] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1053 variables, 11/710 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1053 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 3/1056 variables, 3/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1056 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1056 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1056/1056 variables, and 713 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3836 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 577/577 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 150/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 273/428 variables, 66/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:35:36] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 2 ms to minimize.
[2024-05-21 16:35:36] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:35:36] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:35:36] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-21 16:35:36] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:35:36] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-21 16:35:36] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:35:36] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:35:36] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:35:37] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:35:37] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:35:37] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:35:37] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:35:37] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:35:37] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:35:37] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
[2024-05-21 16:35:37] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:35:37] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:35:38] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:35:38] [INFO ] Deduced a trap composed of 101 places in 150 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:35:38] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:35:38] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:35:38] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 127/555 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 10/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:35:38] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:35:38] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 10/565 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 471/1036 variables, 565/724 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1036 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:35:39] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-21 16:35:39] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:35:39] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:35:39] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1036 variables, 4/729 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1036 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 17/1053 variables, 9/738 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1053 variables, 3/741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1053 variables, 2/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:35:40] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:35:40] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1053 variables, 2/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1053 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 3/1056 variables, 3/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1056 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/1056 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1056/1056 variables, and 748 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4875 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 577/577 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 53/53 constraints]
After SMT, in 8726ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 654 ms.
Support contains 5 out of 577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 577/577 places, 479/479 transitions.
Graph (complete) has 1237 edges and 577 vertex of which 576 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 576 transition count 415
Reduce places removed 63 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 65 rules applied. Total rules applied 129 place count 513 transition count 413
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 131 place count 511 transition count 413
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 124 Pre rules applied. Total rules applied 131 place count 511 transition count 289
Deduced a syphon composed of 124 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 273 rules applied. Total rules applied 404 place count 362 transition count 289
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 3 with 323 rules applied. Total rules applied 727 place count 198 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 728 place count 198 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 730 place count 197 transition count 132
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 736 place count 197 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 737 place count 196 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 738 place count 195 transition count 131
Applied a total of 738 rules in 34 ms. Remains 195 /577 variables (removed 382) and now considering 131/479 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 195/577 places, 131/479 transitions.
RANDOM walk for 40000 steps (4358 resets) in 458 ms. (87 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1054 resets) in 227 ms. (175 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1080 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1437 steps, run visited all 2 properties in 19 ms. (steps per millisecond=75 )
Probabilistic random walk after 1437 steps, saw 779 distinct states, run finished after 19 ms. (steps per millisecond=75 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p1), (F p0), (F p2), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 630 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 239 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 234 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 552 reset in 247 ms.
Product exploration explored 100000 steps with 551 reset in 277 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 361 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Support contains 5 out of 577 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 577/577 places, 479/479 transitions.
Graph (complete) has 1237 edges and 577 vertex of which 576 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 576 transition count 478
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 88 Pre rules applied. Total rules applied 65 place count 576 transition count 544
Deduced a syphon composed of 152 places in 1 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 153 place count 576 transition count 544
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 175 place count 554 transition count 503
Deduced a syphon composed of 130 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 197 place count 554 transition count 503
Performed 193 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 323 places in 0 ms
Iterating global reduction 1 with 193 rules applied. Total rules applied 390 place count 554 transition count 503
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 436 place count 508 transition count 457
Deduced a syphon composed of 277 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 482 place count 508 transition count 457
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 280 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 485 place count 508 transition count 469
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 486 place count 508 transition count 468
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 489 place count 505 transition count 462
Deduced a syphon composed of 277 places in 1 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 492 place count 505 transition count 462
Deduced a syphon composed of 277 places in 0 ms
Applied a total of 492 rules in 166 ms. Remains 505 /577 variables (removed 72) and now considering 462/479 (removed 17) transitions.
[2024-05-21 16:35:44] [INFO ] Redundant transitions in 26 ms returned []
Running 461 sub problems to find dead transitions.
// Phase 1: matrix 462 rows 505 cols
[2024-05-21 16:35:44] [INFO ] Computed 114 invariants in 7 ms
[2024-05-21 16:35:44] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (OVERLAPS) 1/505 variables, 71/113 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-05-21 16:35:53] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 3 ms to minimize.
[2024-05-21 16:35:53] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:35:53] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 3 ms to minimize.
[2024-05-21 16:35:53] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:35:54] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:35:54] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 3 ms to minimize.
[2024-05-21 16:35:54] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:35:54] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:35:54] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:35:54] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:35:54] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:35:54] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2024-05-21 16:35:54] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:35:54] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:35:54] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:35:54] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:35:55] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:35:55] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 2 ms to minimize.
[2024-05-21 16:35:55] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:35:55] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 2 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 20/134 constraints. Problems are: Problem set: 93 solved, 368 unsolved
[2024-05-21 16:35:55] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:35:55] [INFO ] Deduced a trap composed of 47 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:35:56] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:35:56] [INFO ] Deduced a trap composed of 48 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:35:56] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-21 16:35:56] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:35:56] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:35:56] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
[2024-05-21 16:35:56] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 3 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 3 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD45 is UNSAT
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-05-21 16:35:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 20/154 constraints. Problems are: Problem set: 213 solved, 248 unsolved
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
[2024-05-21 16:35:58] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 20/174 constraints. Problems are: Problem set: 253 solved, 208 unsolved
[2024-05-21 16:35:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-05-21 16:35:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD80 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD89 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD91 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD403 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 20/194 constraints. Problems are: Problem set: 281 solved, 180 unsolved
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
Problem TDEAD109 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
Problem TDEAD114 is UNSAT
[2024-05-21 16:36:00] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-05-21 16:36:01] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-05-21 16:36:01] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
[2024-05-21 16:36:01] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD145 is UNSAT
[2024-05-21 16:36:01] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
[2024-05-21 16:36:01] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:36:01] [INFO ] Deduced a trap composed of 46 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:36:01] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:36:01] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:36:02] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:36:02] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:36:02] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 2 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 20/214 constraints. Problems are: Problem set: 298 solved, 163 unsolved
[2024-05-21 16:36:02] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:36:02] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:36:03] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 2 ms to minimize.
Problem TDEAD174 is UNSAT
[2024-05-21 16:36:03] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:36:03] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 2 ms to minimize.
[2024-05-21 16:36:03] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
Problem TDEAD217 is UNSAT
[2024-05-21 16:36:03] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Problem TDEAD241 is UNSAT
[2024-05-21 16:36:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD244 is UNSAT
[2024-05-21 16:36:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD246 is UNSAT
[2024-05-21 16:36:04] [INFO ] Deduced a trap composed of 48 places in 215 ms of which 3 ms to minimize.
[2024-05-21 16:36:04] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD306 is UNSAT
[2024-05-21 16:36:04] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 2 ms to minimize.
[2024-05-21 16:36:04] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 2 ms to minimize.
Problem TDEAD332 is UNSAT
[2024-05-21 16:36:04] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 2 ms to minimize.
Problem TDEAD352 is UNSAT
[2024-05-21 16:36:05] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:36:05] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:36:05] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:36:05] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:36:05] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:36:05] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
Problem TDEAD174 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD352 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 20/234 constraints. Problems are: Problem set: 306 solved, 155 unsolved
[2024-05-21 16:36:07] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:36:07] [INFO ] Deduced a trap composed of 46 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:36:07] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:36:08] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:36:08] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 5/239 constraints. Problems are: Problem set: 306 solved, 155 unsolved
[2024-05-21 16:36:09] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 1/240 constraints. Problems are: Problem set: 306 solved, 155 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/505 variables, 0/240 constraints. Problems are: Problem set: 306 solved, 155 unsolved
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD274 is UNSAT
At refinement iteration 13 (OVERLAPS) 462/967 variables, 505/745 constraints. Problems are: Problem set: 343 solved, 118 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/967 variables, 6/751 constraints. Problems are: Problem set: 343 solved, 118 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/967 variables, 0/751 constraints. Problems are: Problem set: 343 solved, 118 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 967/967 variables, and 751 constraints, problems are : Problem set: 343 solved, 118 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 505/505 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 126/126 constraints]
Escalating to Integer solving :Problem set: 343 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 343 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 219/446 variables, 71/71 constraints. Problems are: Problem set: 343 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 1/72 constraints. Problems are: Problem set: 343 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 126/198 constraints. Problems are: Problem set: 343 solved, 118 unsolved
[2024-05-21 16:36:15] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:36:16] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:36:16] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:36:16] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:36:16] [INFO ] Deduced a trap composed of 46 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:36:16] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:36:16] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 2 ms to minimize.
[2024-05-21 16:36:17] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:36:17] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:36:17] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 1 ms to minimize.
[2024-05-21 16:36:17] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:36:17] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:36:17] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:36:17] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:36:18] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:36:18] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:36:18] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:36:18] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:36:18] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:36:18] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/218 constraints. Problems are: Problem set: 343 solved, 118 unsolved
[2024-05-21 16:36:19] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 2 ms to minimize.
[2024-05-21 16:36:19] [INFO ] Deduced a trap composed of 47 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:36:19] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:36:20] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:36:20] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 5/223 constraints. Problems are: Problem set: 343 solved, 118 unsolved
[2024-05-21 16:36:20] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:36:20] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:36:20] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:36:21] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 4/227 constraints. Problems are: Problem set: 343 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/227 constraints. Problems are: Problem set: 343 solved, 118 unsolved
At refinement iteration 8 (OVERLAPS) 55/501 variables, 42/269 constraints. Problems are: Problem set: 343 solved, 118 unsolved
[2024-05-21 16:36:22] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:36:22] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 3 ms to minimize.
[2024-05-21 16:36:23] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:36:23] [INFO ] Deduced a trap composed of 49 places in 164 ms of which 2 ms to minimize.
[2024-05-21 16:36:23] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:36:24] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 6/275 constraints. Problems are: Problem set: 343 solved, 118 unsolved
[2024-05-21 16:36:24] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:36:25] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:36:25] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:36:25] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 3 ms to minimize.
[2024-05-21 16:36:25] [INFO ] Deduced a trap composed of 48 places in 136 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 5/280 constraints. Problems are: Problem set: 343 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/501 variables, 0/280 constraints. Problems are: Problem set: 343 solved, 118 unsolved
At refinement iteration 12 (OVERLAPS) 462/963 variables, 501/781 constraints. Problems are: Problem set: 343 solved, 118 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/963 variables, 6/787 constraints. Problems are: Problem set: 343 solved, 118 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/963 variables, 118/905 constraints. Problems are: Problem set: 343 solved, 118 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/963 variables, 0/905 constraints. Problems are: Problem set: 343 solved, 118 unsolved
At refinement iteration 16 (OVERLAPS) 4/967 variables, 4/909 constraints. Problems are: Problem set: 343 solved, 118 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 967/967 variables, and 909 constraints, problems are : Problem set: 343 solved, 118 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 505/505 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 118/461 constraints, Known Traps: 166/166 constraints]
After SMT, in 60219ms problems are : Problem set: 343 solved, 118 unsolved
Search for dead transitions found 343 dead transitions in 60225ms
Found 343 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 343 transitions
Dead transitions reduction (with SMT) removed 343 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 505/577 places, 119/479 transitions.
Graph (complete) has 877 edges and 505 vertex of which 228 are kept as prefixes of interest. Removing 277 places using SCC suffix rule.1 ms
Discarding 277 places :
Also discarding 0 output transitions
Ensure Unique test removed 39 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 189 transition count 125
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 9 ms. Remains 189 /505 variables (removed 316) and now considering 125/119 (removed -6) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 189/577 places, 125/479 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60435 ms. Remains : 189/577 places, 125/479 transitions.
Support contains 5 out of 577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 577/577 places, 479/479 transitions.
Applied a total of 0 rules in 10 ms. Remains 577 /577 variables (removed 0) and now considering 479/479 (removed 0) transitions.
// Phase 1: matrix 479 rows 577 cols
[2024-05-21 16:36:44] [INFO ] Computed 114 invariants in 8 ms
[2024-05-21 16:36:45] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-21 16:36:45] [INFO ] Invariant cache hit.
[2024-05-21 16:36:45] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
Running 478 sub problems to find dead transitions.
[2024-05-21 16:36:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (OVERLAPS) 1/577 variables, 71/112 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/577 variables, 2/114 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 101 places in 141 ms of which 3 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 101 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:36:57] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 3 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 86 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 4 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 101 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:36:58] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:36:59] [INFO ] Deduced a trap composed of 135 places in 143 ms of which 3 ms to minimize.
[2024-05-21 16:36:59] [INFO ] Deduced a trap composed of 117 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:36:59] [INFO ] Deduced a trap composed of 135 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:36:59] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:36:59] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:36:59] [INFO ] Deduced a trap composed of 108 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:36:59] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 3 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 109 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 3 ms to minimize.
[2024-05-21 16:37:00] [INFO ] Deduced a trap composed of 104 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 3 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 104 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 103 places in 92 ms of which 3 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 101 places in 139 ms of which 3 ms to minimize.
[2024-05-21 16:37:01] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 98 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 3 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 98 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 81 places in 93 ms of which 3 ms to minimize.
[2024-05-21 16:37:02] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-21 16:37:03] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 3 ms to minimize.
[2024-05-21 16:37:03] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:37:03] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:37:03] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:37:03] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:37:03] [INFO ] Deduced a trap composed of 105 places in 208 ms of which 3 ms to minimize.
[2024-05-21 16:37:04] [INFO ] Deduced a trap composed of 100 places in 191 ms of which 3 ms to minimize.
[2024-05-21 16:37:04] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:37:04] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 2 ms to minimize.
[2024-05-21 16:37:04] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:37:04] [INFO ] Deduced a trap composed of 88 places in 152 ms of which 3 ms to minimize.
[2024-05-21 16:37:04] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:37:05] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:37:05] [INFO ] Deduced a trap composed of 104 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:37:05] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 4 ms to minimize.
[2024-05-21 16:37:05] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 3 ms to minimize.
[2024-05-21 16:37:05] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:37:05] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-05-21 16:37:06] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:37:06] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-21 16:37:11] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 3 ms to minimize.
[2024-05-21 16:37:12] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:37:12] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 3 ms to minimize.
[2024-05-21 16:37:12] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:37:12] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:37:12] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 3 ms to minimize.
[2024-05-21 16:37:12] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:37:13] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 3 ms to minimize.
[2024-05-21 16:37:13] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 3 ms to minimize.
[2024-05-21 16:37:13] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:37:13] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:37:13] [INFO ] Deduced a trap composed of 86 places in 171 ms of which 3 ms to minimize.
[2024-05-21 16:37:13] [INFO ] Deduced a trap composed of 86 places in 153 ms of which 3 ms to minimize.
[2024-05-21 16:37:13] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:37:14] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 3 ms to minimize.
[2024-05-21 16:37:14] [INFO ] Deduced a trap composed of 99 places in 174 ms of which 3 ms to minimize.
[2024-05-21 16:37:14] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:37:14] [INFO ] Deduced a trap composed of 99 places in 160 ms of which 3 ms to minimize.
[2024-05-21 16:37:14] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 3 ms to minimize.
[2024-05-21 16:37:14] [INFO ] Deduced a trap composed of 99 places in 135 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 103 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 116 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:37:15] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:37:16] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
SMT process timed out in 30121ms, After SMT, problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 30125ms
Finished structural reductions in LTL mode , in 1 iterations and 31049 ms. Remains : 577/577 places, 479/479 transitions.
Treatment of property BusinessProcesses-PT-19-LTLFireability-15 finished in 147425 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)))'
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 X((X(X(G(!p1)))||(p2 U p1)))))'
[2024-05-21 16:37:16] [INFO ] Flatten gal took : 50 ms
[2024-05-21 16:37:16] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-21 16:37:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 598 places, 519 transitions and 1638 arcs took 11 ms.
Total runtime 495752 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BusinessProcesses-PT-19

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 598
TRANSITIONS: 519
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.006s]


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 6073
MODEL NAME: /home/mcc/execution/418/model
598 places, 519 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-19"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BusinessProcesses-PT-19, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398500596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-19.tgz
mv BusinessProcesses-PT-19 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.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 ;