Execution Chart

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

Trace from the execution

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

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

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:15:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:15:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:15:20] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-06-01 07:15:20] [INFO ] Transformed 772 places.
[2024-06-01 07:15:20] [INFO ] Transformed 685 transitions.
[2024-06-01 07:15:20] [INFO ] Found NUPN structural information;
[2024-06-01 07:15:20] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 15 places in 13 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 419 ms. Remains 598 /757 variables (removed 159) and now considering 519/670 (removed 151) transitions.
// Phase 1: matrix 519 rows 598 cols
[2024-06-01 07:15:21] [INFO ] Computed 117 invariants in 34 ms
[2024-06-01 07:15:22] [INFO ] Implicit Places using invariants in 1199 ms returned []
[2024-06-01 07:15:22] [INFO ] Invariant cache hit.
[2024-06-01 07:15:23] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 2176 ms to find 0 implicit places.
Running 518 sub problems to find dead transitions.
[2024-06-01 07:15:23] [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-06-01 07:15:37] [INFO ] Deduced a trap composed of 89 places in 243 ms of which 54 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 128 places in 246 ms of which 3 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 132 places in 617 ms of which 51 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 115 places in 147 ms of which 6 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 113 places in 163 ms of which 4 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 134 places in 200 ms of which 5 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 132 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 116 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 115 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 92 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:15:39] [INFO ] Deduced a trap composed of 92 places in 190 ms of which 7 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 113 places in 179 ms of which 6 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 133 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 133 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 113 places in 213 ms of which 5 ms to minimize.
[2024-06-01 07:15:40] [INFO ] Deduced a trap composed of 90 places in 302 ms of which 30 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 97 places in 152 ms of which 9 ms to minimize.
[2024-06-01 07:15:41] [INFO ] Deduced a trap composed of 136 places in 180 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-06-01 07:15:42] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 135 places in 157 ms of which 15 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 118 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 113 places in 224 ms of which 5 ms to minimize.
[2024-06-01 07:15:42] [INFO ] Deduced a trap composed of 133 places in 218 ms of which 5 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 117 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 122 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 111 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 129 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:15:43] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 96 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 119 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:15:44] [INFO ] Deduced a trap composed of 114 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 117 places in 219 ms of which 6 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 116 places in 245 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:15:45] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 116 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 129 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 116 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 133 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 134 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 102 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:15:47] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 11 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:15:48] [INFO ] Deduced a trap composed of 94 places in 97 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 115 places in 204 ms of which 3 ms to minimize.
[2024-06-01 07:15:53] [INFO ] Deduced a trap composed of 118 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 115 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:15:54] [INFO ] Deduced a trap composed of 111 places in 121 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/1117 variables, and 181 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/598 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
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
At refinement iteration 4 (INCLUDED_ONLY) 0/598 variables, 64/181 constraints. Problems are: Problem set: 0 solved, 518 unsolved
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 116 places in 167 ms of which 4 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 134 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:15:59] [INFO ] Deduced a trap composed of 116 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 137 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:16:00] [INFO ] Deduced a trap composed of 130 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 120 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 116 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 120 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 116 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 120 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 116 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:01] [INFO ] Deduced a trap composed of 120 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 119 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 123 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 114 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:02] [INFO ] Deduced a trap composed of 116 places in 120 ms of which 3 ms to minimize.
Problem TDEAD431 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD467 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/598 variables, 20/201 constraints. Problems are: Problem set: 3 solved, 515 unsolved
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 131 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 114 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 115 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 112 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 113 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 120 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 116 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:16:03] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:16:04] [INFO ] Deduced a trap composed of 112 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 119 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 110 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 112 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 108 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:16:05] [INFO ] Deduced a trap composed of 106 places in 123 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/598 variables, 20/221 constraints. Problems are: Problem set: 3 solved, 515 unsolved
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 114 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 125 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 112 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 112 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 130 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 116 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:16:06] [INFO ] Deduced a trap composed of 115 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 113 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 112 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 116 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 127 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 134 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 109 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 112 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:07] [INFO ] Deduced a trap composed of 128 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 133 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 110 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 111 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:08] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 2 ms to minimize.
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD472 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/598 variables, 20/241 constraints. Problems are: Problem set: 8 solved, 510 unsolved
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 113 places in 165 ms of which 4 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 108 places in 173 ms of which 4 ms to minimize.
[2024-06-01 07:16:09] [INFO ] Deduced a trap composed of 103 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 105 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 107 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 110 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:10] [INFO ] Deduced a trap composed of 111 places in 130 ms of which 4 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 108 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 111 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:11] [INFO ] Deduced a trap composed of 111 places in 146 ms of which 4 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 4 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 109 places in 130 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/598 variables, 20/261 constraints. Problems are: Problem set: 8 solved, 510 unsolved
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 112 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:16:12] [INFO ] Deduced a trap composed of 110 places in 141 ms of which 4 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 112 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 134 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 117 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 117 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 119 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:16:13] [INFO ] Deduced a trap composed of 110 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 112 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 111 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 102 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 135 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 118 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 130 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 111 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 119 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 132 places in 135 ms of which 7 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 114 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 126 places in 142 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/598 variables, 20/281 constraints. Problems are: Problem set: 8 solved, 510 unsolved
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 114 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 112 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 134 places in 150 ms of which 4 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 109 places in 147 ms of which 4 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 114 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 114 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 108 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 111 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:16:17] [INFO ] Deduced a trap composed of 107 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 109 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 104 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:18] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 114 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 115 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 101 places in 191 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 20/301 constraints. Problems are: Problem set: 8 solved, 510 unsolved
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 103 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:16:20] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 106 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 109 places in 117 ms of which 4 ms to minimize.
[2024-06-01 07:16:21] [INFO ] Deduced a trap composed of 113 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:16:22] [INFO ] Deduced a trap composed of 99 places in 140 ms of which 4 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 105 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 110 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:23] [INFO ] Deduced a trap composed of 107 places in 118 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 20/321 constraints. Problems are: Problem set: 8 solved, 510 unsolved
[2024-06-01 07:16:24] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
SMT process timed out in 60480ms, After SMT, problems are : Problem set: 8 solved, 510 unsolved
Search for dead transitions found 8 dead transitions in 60500ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 598/757 places, 511/670 transitions.
Applied a total of 0 rules in 13 ms. Remains 598 /598 variables (removed 0) and now considering 511/511 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63139 ms. Remains : 598/757 places, 511/670 transitions.
Support contains 37 out of 598 places after structural reductions.
[2024-06-01 07:16:24] [INFO ] Flatten gal took : 92 ms
[2024-06-01 07:16:24] [INFO ] Flatten gal took : 38 ms
[2024-06-01 07:16:24] [INFO ] Input system was already deterministic with 511 transitions.
RANDOM walk for 40000 steps (219 resets) in 1903 ms. (21 steps per ms) remains 18/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 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 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 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 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
// Phase 1: matrix 511 rows 598 cols
[2024-06-01 07:16:25] [INFO ] Computed 117 invariants in 11 ms
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) 87/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 303/412 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 2 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 164/576 variables, 40/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/576 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 9/585 variables, 8/127 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 91 places in 167 ms of which 39 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 50 places in 232 ms of which 5 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 102 places in 209 ms of which 4 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 91 places in 168 ms of which 4 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 104 places in 185 ms of which 4 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 122 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 89 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 110 places in 150 ms of which 4 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 90 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 88 places in 152 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 585/1109 variables, and 141 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 0/598 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
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) 87/109 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 303/412 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 164/576 variables, 40/126 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/576 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 110 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 109 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:16:31] [INFO ] Deduced a trap composed of 112 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 113 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 113 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 117 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 109 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:16:32] [INFO ] Deduced a trap composed of 110 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 116 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 46 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 106 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 113 places in 187 ms of which 4 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 115 places in 157 ms of which 4 ms to minimize.
[2024-06-01 07:16:33] [INFO ] Deduced a trap composed of 115 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 112 places in 147 ms of which 4 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 5 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 4 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 113 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 114 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 103 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 114 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:16:35] [INFO ] Deduced a trap composed of 112 places in 126 ms of which 3 ms to minimize.
SMT process timed out in 10096ms, 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, 511/511 transitions.
Graph (complete) has 1300 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 445
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 442
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 442
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 327
Deduced a syphon composed of 115 places in 1 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 327
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 395 place count 386 transition count 320
Iterating global reduction 3 with 7 rules applied. Total rules applied 402 place count 386 transition count 320
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 167
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 166
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 716 place count 227 transition count 169
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 169
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 168
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 168
Applied a total of 726 rules in 114 ms. Remains 225 /598 variables (removed 373) and now considering 168/511 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 225/598 places, 168/511 transitions.
RANDOM walk for 40000 steps (4271 resets) in 929 ms. (43 steps per ms) remains 13/18 properties
BEST_FIRST walk for 40002 steps (1209 resets) in 204 ms. (195 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1192 resets) in 289 ms. (137 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1200 resets) in 199 ms. (200 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1263 resets) in 379 ms. (105 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1195 resets) in 191 ms. (208 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1169 resets) in 212 ms. (187 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1235 resets) in 163 ms. (243 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (1209 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1213 resets) in 121 ms. (327 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1227 resets) in 108 ms. (367 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1235 resets) in 124 ms. (320 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (1066 resets) in 106 ms. (373 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (1074 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
// Phase 1: matrix 168 rows 225 cols
[2024-06-01 07:16:37] [INFO ] Computed 90 invariants in 2 ms
[2024-06-01 07:16:37] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 60/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 38/112 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 43/155 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 1 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 1 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:16:37] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:16:38] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 7/162 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 3/165 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 166/331 variables, 165/244 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/331 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 59/390 variables, 58/306 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/390 variables, 26/332 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/390 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 2/392 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/392 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 1/393 variables, 2/335 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/393 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (OVERLAPS) 0/393 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 335 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2148 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: 12/12 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 60/74 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 38/112 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 43/155 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 16/69 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:16:39] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 7/162 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 3/165 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/165 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 166/331 variables, 165/249 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/331 variables, 4/253 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/331 variables, 8/261 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/331 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 59/390 variables, 58/319 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/390 variables, 26/345 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/390 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 59 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:16:40] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/390 variables, 9/358 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:16:41] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/390 variables, 2/360 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:16:42] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/390 variables, 3/363 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/390 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 25 (OVERLAPS) 2/392 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/392 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (OVERLAPS) 1/393 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/393 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (OVERLAPS) 0/393 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 366 constraints, problems are : Problem set: 0 solved, 12 unsolved in 4173 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: 12/12 constraints, Known Traps: 35/35 constraints]
After SMT, in 6356ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 1355 ms.
Support contains 14 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 168/168 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 167
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 167
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2 place count 224 transition count 160
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 2 with 15 rules applied. Total rules applied 17 place count 216 transition count 160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 214 transition count 158
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 214 transition count 158
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 2 with 2 rules applied. Total rules applied 23 place count 213 transition count 157
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 24 place count 213 transition count 157
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 212 transition count 156
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 212 transition count 156
Applied a total of 26 rules in 31 ms. Remains 212 /225 variables (removed 13) and now considering 156/168 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 212/225 places, 156/168 transitions.
RANDOM walk for 40000 steps (5403 resets) in 437 ms. (91 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1730 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1765 resets) in 215 ms. (185 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1724 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1761 resets) in 154 ms. (258 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1768 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1748 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1795 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1729 resets) in 160 ms. (248 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1782 resets) in 113 ms. (350 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1750 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1750 resets) in 173 ms. (229 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1759 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
Finished probabilistic random walk after 186523 steps, run visited all 12 properties in 593 ms. (steps per millisecond=314 )
Probabilistic random walk after 186523 steps, saw 71763 distinct states, run finished after 597 ms. (steps per millisecond=312 ) properties seen :12
FORMULA BusinessProcesses-PT-19-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 540 stabilizing places and 463 stable transitions
Graph (complete) has 1300 edges and 598 vertex of which 597 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.21 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, 511/511 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 583 transition count 496
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 583 transition count 496
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 579 transition count 492
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 579 transition count 492
Applied a total of 38 rules in 38 ms. Remains 579 /598 variables (removed 19) and now considering 492/511 (removed 19) transitions.
// Phase 1: matrix 492 rows 579 cols
[2024-06-01 07:16:46] [INFO ] Computed 117 invariants in 6 ms
[2024-06-01 07:16:47] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-06-01 07:16:47] [INFO ] Invariant cache hit.
[2024-06-01 07:16:47] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
Running 491 sub problems to find dead transitions.
[2024-06-01 07:16:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/112 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:16:58] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 101 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:16:59] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 107 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 83 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 112 places in 152 ms of which 3 ms to minimize.
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 15 solved, 476 unsolved
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 82 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 78 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:17:01] [INFO ] Deduced a trap composed of 122 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 125 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:17:02] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 80 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 121 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 111 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 122 places in 113 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/157 constraints. Problems are: Problem set: 15 solved, 476 unsolved
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 117 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:17:04] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 102 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 81 places in 162 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 124 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 129 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:17:05] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 124 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 94 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 120 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 121 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:17:06] [INFO ] Deduced a trap composed of 125 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:17:07] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/177 constraints. Problems are: Problem set: 15 solved, 476 unsolved
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 105 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:17:11] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 120 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 116 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:17:12] [INFO ] Deduced a trap composed of 103 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 95 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 4 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:17:13] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 119 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 99 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:17:14] [INFO ] Deduced a trap composed of 103 places in 126 ms of which 2 ms to minimize.
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 20/197 constraints. Problems are: Problem set: 20 solved, 471 unsolved
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 104 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 119 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 108 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 127 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 119 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 115 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:17:18] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 2 ms to minimize.
SMT process timed out in 30172ms, After SMT, problems are : Problem set: 20 solved, 471 unsolved
Search for dead transitions found 20 dead transitions in 30177ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 579/598 places, 472/511 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 578 transition count 472
Applied a total of 1 rules in 15 ms. Remains 578 /579 variables (removed 1) and now considering 472/472 (removed 0) transitions.
// Phase 1: matrix 472 rows 578 cols
[2024-06-01 07:17:18] [INFO ] Computed 118 invariants in 6 ms
[2024-06-01 07:17:18] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-06-01 07:17:18] [INFO ] Invariant cache hit.
[2024-06-01 07:17:19] [INFO ] Implicit Places using invariants and state equation in 655 ms returned [158, 159]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 926 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 576/598 places, 472/511 transitions.
Applied a total of 0 rules in 11 ms. Remains 576 /576 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 32169 ms. Remains : 576/598 places, 472/511 transitions.
Stuttering acceptance computed with spot in 246 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 32488 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, 511/511 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 582 transition count 495
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 582 transition count 495
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 578 transition count 491
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 578 transition count 491
Applied a total of 40 rules in 29 ms. Remains 578 /598 variables (removed 20) and now considering 491/511 (removed 20) transitions.
// Phase 1: matrix 491 rows 578 cols
[2024-06-01 07:17:19] [INFO ] Computed 117 invariants in 4 ms
[2024-06-01 07:17:19] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-06-01 07:17:19] [INFO ] Invariant cache hit.
[2024-06-01 07:17:20] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
Running 490 sub problems to find dead transitions.
[2024-06-01 07:17:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/577 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (OVERLAPS) 1/578 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/578 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:17:31] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 102 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:17:32] [INFO ] Deduced a trap composed of 98 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 107 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 123 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 104 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 109 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:17:33] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 125 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 126 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 106 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 129 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 103 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:17:36] [INFO ] Deduced a trap composed of 106 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 3 ms to minimize.
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD427 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 20/157 constraints. Problems are: Problem set: 3 solved, 487 unsolved
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 102 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:17:37] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 102 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 104 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 84 places in 193 ms of which 3 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 85 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 109 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:39] [INFO ] Deduced a trap composed of 108 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:17:40] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/578 variables, 20/177 constraints. Problems are: Problem set: 3 solved, 487 unsolved
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 104 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 120 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 6 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 109 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:17:44] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:17:45] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 103 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 116 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 119 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:17:46] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
Problem TDEAD407 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/578 variables, 20/197 constraints. Problems are: Problem set: 9 solved, 481 unsolved
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 111 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 112 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:17:47] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 99 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:17:48] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 119 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 103 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 121 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:17:49] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 20/217 constraints. Problems are: Problem set: 9 solved, 481 unsolved
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 138 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:17:50] [INFO ] Deduced a trap composed of 104 places in 125 ms of which 2 ms to minimize.
SMT process timed out in 30180ms, After SMT, problems are : Problem set: 9 solved, 481 unsolved
Search for dead transitions found 9 dead transitions in 30188ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 578/598 places, 482/511 transitions.
Applied a total of 0 rules in 10 ms. Remains 578 /578 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31292 ms. Remains : 578/598 places, 482/511 transitions.
Stuttering acceptance computed with spot in 145 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 0 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-04 finished in 31458 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, 511/511 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 585 transition count 498
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 585 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 582 transition count 495
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 582 transition count 495
Applied a total of 32 rules in 30 ms. Remains 582 /598 variables (removed 16) and now considering 495/511 (removed 16) transitions.
// Phase 1: matrix 495 rows 582 cols
[2024-06-01 07:17:50] [INFO ] Computed 117 invariants in 6 ms
[2024-06-01 07:17:51] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 07:17:51] [INFO ] Invariant cache hit.
[2024-06-01 07:17:51] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 494 sub problems to find dead transitions.
[2024-06-01 07:17:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/581 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/581 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (OVERLAPS) 1/582 variables, 71/112 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/582 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 494 unsolved
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 100 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:18:01] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:18:02] [INFO ] Deduced a trap composed of 102 places in 135 ms of which 16 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 107 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 105 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 122 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:18:03] [INFO ] Deduced a trap composed of 103 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 104 places in 151 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, 494 unsolved
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 3 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 113 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:18:04] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 105 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 108 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 107 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 106 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:18:05] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 111 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 108 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 109 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:18:06] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 111 places in 107 ms of which 2 ms to minimize.
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/582 variables, 20/157 constraints. Problems are: Problem set: 17 solved, 477 unsolved
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 105 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 108 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:18:07] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 127 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 105 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:18:08] [INFO ] Deduced a trap composed of 121 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 104 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:18:09] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:18:10] [INFO ] Deduced a trap composed of 114 places in 132 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 20/177 constraints. Problems are: Problem set: 17 solved, 477 unsolved
[2024-06-01 07:18:14] [INFO ] Deduced a trap composed of 127 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 135 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 114 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 109 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 112 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 118 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:18:15] [INFO ] Deduced a trap composed of 112 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 112 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 104 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 117 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 124 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 124 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 107 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:18:16] [INFO ] Deduced a trap composed of 111 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 20/197 constraints. Problems are: Problem set: 17 solved, 477 unsolved
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 101 places in 231 ms of which 3 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 110 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 115 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 113 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 112 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 4 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 105 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 112 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 109 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 103 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:18:20] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/582 variables, 20/217 constraints. Problems are: Problem set: 17 solved, 477 unsolved
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:18:21] [INFO ] Deduced a trap composed of 104 places in 108 ms of which 2 ms to minimize.
SMT process timed out in 30209ms, After SMT, problems are : Problem set: 17 solved, 477 unsolved
Search for dead transitions found 17 dead transitions in 30220ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 582/598 places, 478/511 transitions.
Applied a total of 0 rules in 9 ms. Remains 582 /582 variables (removed 0) and now considering 478/478 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31020 ms. Remains : 582/598 places, 478/511 transitions.
Stuttering acceptance computed with spot in 177 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 31226 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, 511/511 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 1294 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 429
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 429
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 305
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 305
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 436 place count 355 transition count 291
Iterating global reduction 2 with 14 rules applied. Total rules applied 450 place count 355 transition count 291
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 140
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 143
Applied a total of 759 rules in 60 ms. Remains 198 /598 variables (removed 400) and now considering 143/511 (removed 368) transitions.
// Phase 1: matrix 143 rows 198 cols
[2024-06-01 07:18:22] [INFO ] Computed 88 invariants in 1 ms
[2024-06-01 07:18:22] [INFO ] Implicit Places using invariants in 122 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 124 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/598 places, 143/511 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 190 ms. Remains : 170/598 places, 143/511 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-19-LTLFireability-06
Product exploration explored 100000 steps with 21599 reset in 363 ms.
Product exploration explored 100000 steps with 21328 reset in 262 ms.
Computed a total of 147 stabilizing places and 125 stable transitions
Computed a total of 147 stabilizing places and 125 stable transitions
Detected a total of 147/170 stabilizing places and 125/143 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 113 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 25 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9711 resets) in 435 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3024 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 161 steps, run visited all 1 properties in 7 ms. (steps per millisecond=23 )
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 105 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 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, 143/143 transitions.
Applied a total of 0 rules in 7 ms. Remains 170 /170 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 170 cols
[2024-06-01 07:18:23] [INFO ] Computed 60 invariants in 3 ms
[2024-06-01 07:18:23] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 07:18:23] [INFO ] Invariant cache hit.
[2024-06-01 07:18:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:18:23] [INFO ] Implicit Places using invariants and state equation in 218 ms returned [1, 3, 5, 10, 22, 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 35 places :
Implicit Place search using SMT with State Equation took 341 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/170 places, 143/143 transitions.
Graph (complete) has 410 edges and 135 vertex of which 124 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 124 transition count 125
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 111 transition count 125
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 37 place count 101 transition count 98
Iterating global reduction 2 with 10 rules applied. Total rules applied 47 place count 101 transition count 98
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 50 place count 101 transition count 95
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 53 place count 98 transition count 95
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 56 place count 95 transition count 92
Iterating global reduction 4 with 3 rules applied. Total rules applied 59 place count 95 transition count 92
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 62 place count 95 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 63 place count 94 transition count 89
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 78 place count 86 transition count 82
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 6 with 2 rules applied. Total rules applied 80 place count 85 transition count 81
Applied a total of 80 rules in 19 ms. Remains 85 /135 variables (removed 50) and now considering 81/143 (removed 62) transitions.
// Phase 1: matrix 81 rows 85 cols
[2024-06-01 07:18:23] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 07:18:23] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 07:18:23] [INFO ] Invariant cache hit.
[2024-06-01 07:18:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:18:23] [INFO ] Implicit Places using invariants and state equation in 87 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 154 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/170 places, 81/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 528 ms. Remains : 84/170 places, 81/143 transitions.
Computed a total of 61 stabilizing places and 63 stable transitions
Computed a total of 61 stabilizing places and 63 stable transitions
Detected a total of 61/84 stabilizing places and 63/81 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 70 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 (9941 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2965 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 120 steps, run visited all 1 properties in 4 ms. (steps per millisecond=30 )
Probabilistic random walk after 120 steps, saw 73 distinct states, run finished after 4 ms. (steps per millisecond=30 ) 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 92 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21918 reset in 110 ms.
Product exploration explored 100000 steps with 21943 reset in 118 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 84 cols
[2024-06-01 07:18:24] [INFO ] Computed 19 invariants in 0 ms
[2024-06-01 07:18:24] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 07:18:24] [INFO ] Invariant cache hit.
[2024-06-01 07:18:24] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 07:18:24] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-06-01 07:18:24] [INFO ] Redundant transitions in 12 ms returned []
Running 76 sub problems to find dead transitions.
[2024-06-01 07:18:24] [INFO ] Invariant cache hit.
[2024-06-01 07:18:24] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 1/84 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 20/39 constraints. Problems are: Problem set: 2 solved, 74 unsolved
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:18:25] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 17/56 constraints. Problems are: Problem set: 3 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/56 constraints. Problems are: Problem set: 3 solved, 73 unsolved
Problem TDEAD28 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD49 is UNSAT
At refinement iteration 7 (OVERLAPS) 80/164 variables, 84/140 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 3/143 constraints. Problems are: Problem set: 6 solved, 70 unsolved
[2024-06-01 07:18:26] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 4/147 constraints. Problems are: Problem set: 6 solved, 70 unsolved
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:18:27] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 2/149 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/149 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 0/164 variables, 0/149 constraints. Problems are: Problem set: 6 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/165 variables, and 149 constraints, problems are : Problem set: 6 solved, 70 unsolved in 3341 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 6 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 7/9 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 23/32 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/32 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 1/84 variables, 10/42 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 20/62 constraints. Problems are: Problem set: 6 solved, 70 unsolved
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:18:28] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 3/65 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/65 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 80/164 variables, 84/149 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 3/152 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 70/222 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/222 constraints. Problems are: Problem set: 6 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 0/164 variables, 0/222 constraints. Problems are: Problem set: 6 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/165 variables, and 222 constraints, problems are : Problem set: 6 solved, 70 unsolved in 2163 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 70/76 constraints, Known Traps: 46/46 constraints]
After SMT, in 5534ms problems are : Problem set: 6 solved, 70 unsolved
Search for dead transitions found 6 dead transitions in 5535ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 84/84 places, 75/81 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 8 ms. Remains 83 /84 variables (removed 1) and now considering 75/75 (removed 0) transitions.
[2024-06-01 07:18:30] [INFO ] Redundant transitions in 14 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 5723 ms. Remains : 83/84 places, 75/81 transitions.
Treatment of property BusinessProcesses-PT-19-LTLFireability-06 finished in 8337 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, 511/511 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 585 transition count 498
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 585 transition count 498
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 581 transition count 494
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 581 transition count 494
Applied a total of 34 rules in 49 ms. Remains 581 /598 variables (removed 17) and now considering 494/511 (removed 17) transitions.
// Phase 1: matrix 494 rows 581 cols
[2024-06-01 07:18:30] [INFO ] Computed 117 invariants in 7 ms
[2024-06-01 07:18:30] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-06-01 07:18:30] [INFO ] Invariant cache hit.
[2024-06-01 07:18:31] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
Running 493 sub problems to find dead transitions.
[2024-06-01 07:18:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 493 unsolved
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 82 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 105 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 118 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:42] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 123 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 123 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:43] [INFO ] Deduced a trap composed of 115 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 119 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:18:44] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 493 unsolved
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 82 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 122 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:18:45] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 104 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 106 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 105 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 121 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:46] [INFO ] Deduced a trap composed of 103 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 105 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 106 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 109 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:18:47] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 99 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
Problem TDEAD403 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/157 constraints. Problems are: Problem set: 21 solved, 472 unsolved
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:18:48] [INFO ] Deduced a trap composed of 116 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 121 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 103 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:18:49] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 128 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 5 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 121 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:18:50] [INFO ] Deduced a trap composed of 123 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 107 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 102 places in 147 ms of which 4 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 105 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 125 places in 180 ms of which 3 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 108 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:18:51] [INFO ] Deduced a trap composed of 104 places in 169 ms of which 3 ms to minimize.
Problem TDEAD421 is UNSAT
Problem TDEAD424 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/177 constraints. Problems are: Problem set: 23 solved, 470 unsolved
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 100 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 81 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 4 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 105 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 103 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:18:57] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 103 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:58] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/197 constraints. Problems are: Problem set: 23 solved, 470 unsolved
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 100 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 123 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 99 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:18:59] [INFO ] Deduced a trap composed of 109 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 102 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 101 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:19:00] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 104 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 103 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:19:01] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
SMT process timed out in 30194ms, After SMT, problems are : Problem set: 23 solved, 470 unsolved
Search for dead transitions found 23 dead transitions in 30203ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in LTL mode, iteration 1 : 581/598 places, 471/511 transitions.
Applied a total of 0 rules in 11 ms. Remains 581 /581 variables (removed 0) and now considering 471/471 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31096 ms. Remains : 581/598 places, 471/511 transitions.
Stuttering acceptance computed with spot in 164 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 312 ms.
Product exploration explored 100000 steps with 33333 reset in 271 ms.
Computed a total of 524 stabilizing places and 424 stable transitions
Graph (complete) has 1234 edges and 581 vertex of which 580 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 524 stabilizing places and 424 stable transitions
Detected a total of 524/581 stabilizing places and 424/471 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 29 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 31910 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, 511/511 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 1294 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 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 430
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 430
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 304
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 304
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 438 place count 354 transition count 291
Iterating global reduction 2 with 13 rules applied. Total rules applied 451 place count 354 transition count 291
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 141
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 144
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 144
Applied a total of 764 rules in 80 ms. Remains 198 /598 variables (removed 400) and now considering 144/511 (removed 367) transitions.
// Phase 1: matrix 144 rows 198 cols
[2024-06-01 07:19:02] [INFO ] Computed 87 invariants in 1 ms
[2024-06-01 07:19:02] [INFO ] Implicit Places using invariants in 283 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 294 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/598 places, 144/511 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 380 ms. Remains : 170/598 places, 144/511 transitions.
Stuttering acceptance computed with spot in 125 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 1 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-08 finished in 528 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, 511/511 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 583 transition count 496
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 583 transition count 496
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 579 transition count 492
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 579 transition count 492
Applied a total of 38 rules in 38 ms. Remains 579 /598 variables (removed 19) and now considering 492/511 (removed 19) transitions.
// Phase 1: matrix 492 rows 579 cols
[2024-06-01 07:19:02] [INFO ] Computed 117 invariants in 5 ms
[2024-06-01 07:19:03] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-06-01 07:19:03] [INFO ] Invariant cache hit.
[2024-06-01 07:19:03] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
Running 491 sub problems to find dead transitions.
[2024-06-01 07:19:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 70/112 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 113 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:19:13] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 112 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 104 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 121 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:19:14] [INFO ] Deduced a trap composed of 122 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 124 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 108 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 128 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:19:15] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 107 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 101 places in 103 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, 491 unsolved
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 119 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 119 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 122 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:19:16] [INFO ] Deduced a trap composed of 105 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 101 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 122 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:19:17] [INFO ] Deduced a trap composed of 103 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 4 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 113 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 97 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:19:18] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 82 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 2 ms to minimize.
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/157 constraints. Problems are: Problem set: 7 solved, 484 unsolved
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 110 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 130 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 111 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 104 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 107 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 124 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 109 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 106 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 122 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 125 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 102 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 108 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:19:22] [INFO ] Deduced a trap composed of 107 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:19:22] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/177 constraints. Problems are: Problem set: 16 solved, 475 unsolved
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:19:25] [INFO ] Deduced a trap composed of 100 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 123 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 100 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:19:26] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 81 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 105 places in 155 ms of which 4 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:19:27] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 4 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 124 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 116 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 20/197 constraints. Problems are: Problem set: 16 solved, 475 unsolved
[2024-06-01 07:19:28] [INFO ] Deduced a trap composed of 39 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 100 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 118 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 101 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 108 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:19:29] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 83 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:19:30] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 108 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 20/217 constraints. Problems are: Problem set: 16 solved, 475 unsolved
[2024-06-01 07:19:31] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 102 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 101 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 115 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:19:33] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 3 ms to minimize.
SMT process timed out in 30126ms, After SMT, problems are : Problem set: 16 solved, 475 unsolved
Search for dead transitions found 16 dead transitions in 30133ms
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 : 579/598 places, 476/511 transitions.
Applied a total of 0 rules in 9 ms. Remains 579 /579 variables (removed 0) and now considering 476/476 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30998 ms. Remains : 579/598 places, 476/511 transitions.
Stuttering acceptance computed with spot in 143 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 863 reset in 309 ms.
Product exploration explored 100000 steps with 870 reset in 309 ms.
Computed a total of 522 stabilizing places and 429 stable transitions
Graph (complete) has 1246 edges and 579 vertex of which 578 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 522 stabilizing places and 429 stable transitions
Detected a total of 522/579 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 709 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 110 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 552 steps (0 resets) in 7 ms. (69 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 1482 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 102 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 579 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 579/579 places, 476/476 transitions.
Graph (trivial) has 268 edges and 579 vertex of which 6 / 579 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1240 edges and 574 vertex of which 573 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 572 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 510 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 510 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 361 transition count 282
Performed 155 Post agglomeration using F-continuation condition.Transition count delta: 155
Deduced a syphon composed of 155 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 2 with 317 rules applied. Total rules applied 716 place count 199 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 718 place count 198 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 719 place count 197 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 720 place count 196 transition count 129
Applied a total of 720 rules in 88 ms. Remains 196 /579 variables (removed 383) and now considering 129/476 (removed 347) transitions.
// Phase 1: matrix 129 rows 196 cols
[2024-06-01 07:19:37] [INFO ] Computed 86 invariants in 2 ms
[2024-06-01 07:19:37] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-01 07:19:37] [INFO ] Invariant cache hit.
[2024-06-01 07:19:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 07:19:37] [INFO ] Implicit Places using invariants and state equation in 270 ms returned [31, 36, 61, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 86, 88, 89, 104, 106, 110, 116, 118, 120, 122, 124, 126, 128, 130, 132, 134, 136, 138, 180, 188, 190, 192]
Discarding 35 places :
Implicit Place search using SMT with State Equation took 551 ms to find 35 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/579 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 14 ms. Remains 134 /161 variables (removed 27) and now considering 101/129 (removed 28) transitions.
// Phase 1: matrix 101 rows 134 cols
[2024-06-01 07:19:37] [INFO ] Computed 53 invariants in 1 ms
[2024-06-01 07:19:38] [INFO ] Implicit Places using invariants in 393 ms returned [14, 117]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 394 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 132/579 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 9 ms. Remains 130 /132 variables (removed 2) and now considering 99/101 (removed 2) transitions.
// Phase 1: matrix 99 rows 130 cols
[2024-06-01 07:19:38] [INFO ] Computed 51 invariants in 1 ms
[2024-06-01 07:19:38] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 07:19:38] [INFO ] Invariant cache hit.
[2024-06-01 07:19:38] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-01 07:19:38] [INFO ] Implicit Places using invariants and state equation in 133 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 250 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 106/579 places, 99/476 transitions.
Graph (complete) has 343 edges and 106 vertex of which 97 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 92 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 92 transition count 88
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 86
Applied a total of 13 rules in 4 ms. Remains 92 /106 variables (removed 14) and now considering 86/99 (removed 13) transitions.
// Phase 1: matrix 86 rows 92 cols
[2024-06-01 07:19:38] [INFO ] Computed 23 invariants in 1 ms
[2024-06-01 07:19:38] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 07:19:38] [INFO ] Invariant cache hit.
[2024-06-01 07:19:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 07:19:38] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [14, 15]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 201 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 90/579 places, 86/476 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 5 iterations and 1515 ms. Remains : 90/579 places, 86/476 transitions.
Computed a total of 70 stabilizing places and 72 stable transitions
Computed a total of 70 stabilizing places and 72 stable transitions
Detected a total of 70/90 stabilizing places and 72/86 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 1100 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 101 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 33 steps (1 resets) in 4 ms. (6 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 1403 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 102 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering criterion allowed to conclude after 24 steps with 2 reset in 1 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-09 finished in 38830 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, 511/511 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 1294 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 429
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 429
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 303
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 303
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 441 place count 352 transition count 289
Iterating global reduction 2 with 14 rules applied. Total rules applied 455 place count 352 transition count 289
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 756 place count 199 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 758 place count 198 transition count 144
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 144
Applied a total of 764 rules in 87 ms. Remains 198 /598 variables (removed 400) and now considering 144/511 (removed 367) transitions.
// Phase 1: matrix 144 rows 198 cols
[2024-06-01 07:19:41] [INFO ] Computed 87 invariants in 3 ms
[2024-06-01 07:19:41] [INFO ] Implicit Places using invariants in 210 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 224 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/598 places, 144/511 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 330 ms. Remains : 170/598 places, 144/511 transitions.
Stuttering acceptance computed with spot in 78 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 21125 reset in 251 ms.
Product exploration explored 100000 steps with 21122 reset in 278 ms.
Computed a total of 147 stabilizing places and 126 stable transitions
Computed a total of 147 stabilizing places and 126 stable transitions
Detected a total of 147/170 stabilizing places and 126/144 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 1382 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 87 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (6831 resets) in 318 ms. (125 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40002 steps (2452 resets) in 250 ms. (159 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (2796 resets) in 189 ms. (210 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (2838 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (2450 resets) in 294 ms. (135 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (2736 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
// Phase 1: matrix 144 rows 170 cols
[2024-06-01 07:19:44] [INFO ] Computed 59 invariants in 3 ms
[2024-06-01 07:19:44] [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) 83/142 variables, 40/43 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 07:19:44] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:19:44] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 2/45 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 24/166 variables, 16/61 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 143/309 variables, 166/227 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 4/231 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 4/313 variables, 4/235 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/235 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/235 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/314 variables, and 235 constraints, problems are : Problem set: 1 solved, 4 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 170/170 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 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) 83/142 variables, 40/43 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 2/45 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 0 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:19:45] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 8/53 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 24/166 variables, 16/69 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 143/309 variables, 166/235 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/309 variables, 4/239 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 2/241 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/309 variables, 0/241 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/313 variables, 4/245 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/313 variables, 1/246 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/313 variables, 0/246 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/313 variables, 0/246 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/314 variables, and 246 constraints, problems are : Problem set: 2 solved, 3 unsolved in 730 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 170/170 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 10/10 constraints]
After SMT, in 1112ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 94 ms.
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 144/144 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 143
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 170 transition count 141
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 141
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 141
Applied a total of 6 rules in 28 ms. Remains 168 /170 variables (removed 2) and now considering 141/144 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 168/170 places, 141/144 transitions.
RANDOM walk for 1889 steps (88 resets) in 76 ms. (24 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 688 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 5016 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, 511/511 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 1294 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 429
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 429
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 304
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 304
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 439 place count 353 transition count 290
Iterating global reduction 2 with 14 rules applied. Total rules applied 453 place count 353 transition count 290
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 142
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 145
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 145
Applied a total of 762 rules in 73 ms. Remains 199 /598 variables (removed 399) and now considering 145/511 (removed 366) transitions.
// Phase 1: matrix 145 rows 199 cols
[2024-06-01 07:19:46] [INFO ] Computed 87 invariants in 1 ms
[2024-06-01 07:19:46] [INFO ] Implicit Places using invariants in 282 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 285 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 171/598 places, 145/511 transitions.
Applied a total of 0 rules in 5 ms. Remains 171 /171 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 364 ms. Remains : 171/598 places, 145/511 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 408 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, 511/511 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 584 transition count 497
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 584 transition count 497
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 581 transition count 494
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 581 transition count 494
Applied a total of 34 rules in 65 ms. Remains 581 /598 variables (removed 17) and now considering 494/511 (removed 17) transitions.
// Phase 1: matrix 494 rows 581 cols
[2024-06-01 07:19:47] [INFO ] Computed 117 invariants in 5 ms
[2024-06-01 07:19:47] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-06-01 07:19:47] [INFO ] Invariant cache hit.
[2024-06-01 07:19:47] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
Running 493 sub problems to find dead transitions.
[2024-06-01 07:19:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/580 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/580 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 2 (OVERLAPS) 1/581 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 493 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 493 unsolved
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 101 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 112 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 128 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 115 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 110 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 125 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 106 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 99 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:19:59] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 493 unsolved
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 84 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 111 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 108 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 107 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:20:00] [INFO ] Deduced a trap composed of 107 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 115 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 110 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:20:01] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 105 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/581 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 493 unsolved
[2024-06-01 07:20:02] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 129 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 129 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 106 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:20:03] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:20:04] [INFO ] Deduced a trap composed of 98 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:20:04] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:20:04] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:20:04] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:20:04] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:20:04] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:20:04] [INFO ] Deduced a trap composed of 108 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:20:04] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 102 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 109 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:20:05] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/581 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 493 unsolved
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 107 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 104 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 8 ms to minimize.
[2024-06-01 07:20:09] [INFO ] Deduced a trap composed of 83 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 105 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 111 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 105 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 110 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 100 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:20:11] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/581 variables, 20/197 constraints. Problems are: Problem set: 0 solved, 493 unsolved
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 82 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 110 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 99 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:20:12] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 108 places in 147 ms of which 13 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 112 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 99 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:20:13] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 109 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 123 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 107 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:20:14] [INFO ] Deduced a trap composed of 110 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 105 places in 125 ms of which 3 ms to minimize.
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/581 variables, 20/217 constraints. Problems are: Problem set: 2 solved, 491 unsolved
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:20:15] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 82 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 109 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:20:16] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 124 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 104 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:20:17] [INFO ] Deduced a trap composed of 83 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:20:18] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 3 ms to minimize.
SMT process timed out in 30133ms, After SMT, problems are : Problem set: 2 solved, 491 unsolved
Search for dead transitions found 2 dead transitions in 30140ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 581/598 places, 492/511 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 31062 ms. Remains : 581/598 places, 492/511 transitions.
Stuttering acceptance computed with spot in 109 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 563 steps with 2 reset in 2 ms.
FORMULA BusinessProcesses-PT-19-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-19-LTLFireability-12 finished in 31187 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, 511/511 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 583 transition count 496
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 583 transition count 496
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 579 transition count 492
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 579 transition count 492
Applied a total of 38 rules in 44 ms. Remains 579 /598 variables (removed 19) and now considering 492/511 (removed 19) transitions.
// Phase 1: matrix 492 rows 579 cols
[2024-06-01 07:20:18] [INFO ] Computed 117 invariants in 7 ms
[2024-06-01 07:20:18] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-06-01 07:20:18] [INFO ] Invariant cache hit.
[2024-06-01 07:20:19] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
Running 491 sub problems to find dead transitions.
[2024-06-01 07:20:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 71/113 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 491 unsolved
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 91 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 124 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 114 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 107 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 102 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 108 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 111 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:20:30] [INFO ] Deduced a trap composed of 122 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:20:30] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:20:30] [INFO ] Deduced a trap composed of 108 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:20:30] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:20:30] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:20:30] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:20:30] [INFO ] Deduced a trap composed of 101 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:20:30] [INFO ] Deduced a trap composed of 113 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 106 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 106 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
Problem TDEAD408 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 20/137 constraints. Problems are: Problem set: 13 solved, 478 unsolved
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 88 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:20:31] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 125 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 117 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 122 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 122 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 78 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 122 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 102 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 91 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:20:33] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 118 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/157 constraints. Problems are: Problem set: 13 solved, 478 unsolved
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 100 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:20:34] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 123 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 127 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:20:35] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 117 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 122 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 107 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 103 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:20:36] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 104 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 110 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:20:37] [INFO ] Deduced a trap composed of 107 places in 105 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/177 constraints. Problems are: Problem set: 13 solved, 478 unsolved
[2024-06-01 07:20:40] [INFO ] Deduced a trap composed of 103 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:20:40] [INFO ] Deduced a trap composed of 116 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 97 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 99 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 1 ms to minimize.
[2024-06-01 07:20:41] [INFO ] Deduced a trap composed of 101 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 110 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:20:42] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:20:43] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:20:43] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 2 ms to minimize.
Problem TDEAD419 is UNSAT
Problem TDEAD422 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 20/197 constraints. Problems are: Problem set: 15 solved, 476 unsolved
[2024-06-01 07:20:43] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:20:43] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:20:43] [INFO ] Deduced a trap composed of 118 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:20:43] [INFO ] Deduced a trap composed of 81 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:20:44] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:20:44] [INFO ] Deduced a trap composed of 106 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:20:44] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:20:44] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:20:44] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:20:44] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 113 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 80 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:20:45] [INFO ] Deduced a trap composed of 106 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 95 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 98 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 103 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:20:46] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 20/217 constraints. Problems are: Problem set: 15 solved, 476 unsolved
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 100 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 99 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:20:47] [INFO ] Deduced a trap composed of 101 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 99 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:20:48] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:20:49] [INFO ] Deduced a trap composed of 97 places in 124 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 579/1071 variables, and 233 constraints, problems are : Problem set: 15 solved, 476 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/579 constraints, PredecessorRefiner: 491/491 constraints, Known Traps: 116/116 constraints]
Escalating to Integer solving :Problem set: 15 solved, 476 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/578 variables, 42/42 constraints. Problems are: Problem set: 15 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/578 variables, 0/42 constraints. Problems are: Problem set: 15 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 1/579 variables, 71/113 constraints. Problems are: Problem set: 15 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/579 variables, 4/117 constraints. Problems are: Problem set: 15 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/579 variables, 116/233 constraints. Problems are: Problem set: 15 solved, 476 unsolved
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 114 places in 170 ms of which 2 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 104 places in 213 ms of which 4 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:20:54] [INFO ] Deduced a trap composed of 100 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 78 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 101 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:20:55] [INFO ] Deduced a trap composed of 103 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 106 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 104 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:20:56] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/579 variables, 20/253 constraints. Problems are: Problem set: 15 solved, 476 unsolved
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 1 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 82 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:20:57] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 104 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:20:58] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 79 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 82 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:20:59] [INFO ] Deduced a trap composed of 105 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/579 variables, 20/273 constraints. Problems are: Problem set: 15 solved, 476 unsolved
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:21:00] [INFO ] Deduced a trap composed of 126 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 121 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 121 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 108 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:21:01] [INFO ] Deduced a trap composed of 112 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 112 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 108 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 122 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 109 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:21:02] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 127 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/579 variables, 20/293 constraints. Problems are: Problem set: 15 solved, 476 unsolved
[2024-06-01 07:21:03] [INFO ] Deduced a trap composed of 101 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 99 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 103 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 103 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 109 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 107 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:21:04] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 105 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 131 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 110 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 109 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:21:05] [INFO ] Deduced a trap composed of 101 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:21:06] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:21:06] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:21:06] [INFO ] Deduced a trap composed of 104 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:21:06] [INFO ] Deduced a trap composed of 105 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:21:06] [INFO ] Deduced a trap composed of 102 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:21:06] [INFO ] Deduced a trap composed of 102 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/579 variables, 20/313 constraints. Problems are: Problem set: 15 solved, 476 unsolved
[2024-06-01 07:21:07] [INFO ] Deduced a trap composed of 104 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:21:07] [INFO ] Deduced a trap composed of 142 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:21:07] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 105 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 110 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 101 places in 159 ms of which 4 ms to minimize.
[2024-06-01 07:21:08] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 101 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 107 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:21:10] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:21:10] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:21:10] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:21:10] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:21:10] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:21:10] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/579 variables, 20/333 constraints. Problems are: Problem set: 15 solved, 476 unsolved
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 118 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 105 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:21:11] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 121 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 113 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 123 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 111 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:21:12] [INFO ] Deduced a trap composed of 39 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 108 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 124 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 101 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 101 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 124 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 121 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:21:14] [INFO ] Deduced a trap composed of 107 places in 157 ms of which 3 ms to minimize.
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/579 variables, 20/353 constraints. Problems are: Problem set: 19 solved, 472 unsolved
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 102 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 103 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:21:15] [INFO ] Deduced a trap composed of 120 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 100 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 100 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 105 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 108 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 130 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:21:16] [INFO ] Deduced a trap composed of 126 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 103 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 109 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 130 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 109 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 108 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:21:17] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 124 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 106 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:21:18] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/579 variables, 20/373 constraints. Problems are: Problem set: 19 solved, 472 unsolved
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:21:19] [INFO ] Deduced a trap composed of 99 places in 183 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 579/1071 variables, and 375 constraints, problems are : Problem set: 19 solved, 472 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/579 constraints, PredecessorRefiner: 0/491 constraints, Known Traps: 258/258 constraints]
After SMT, in 60153ms problems are : Problem set: 19 solved, 472 unsolved
Search for dead transitions found 19 dead transitions in 60161ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 579/598 places, 473/511 transitions.
Applied a total of 0 rules in 13 ms. Remains 579 /579 variables (removed 0) and now considering 473/473 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61163 ms. Remains : 579/598 places, 473/511 transitions.
Stuttering acceptance computed with spot in 183 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 174 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 61369 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, 511/511 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 583 transition count 496
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 583 transition count 496
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 580 transition count 493
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 580 transition count 493
Applied a total of 36 rules in 51 ms. Remains 580 /598 variables (removed 18) and now considering 493/511 (removed 18) transitions.
// Phase 1: matrix 493 rows 580 cols
[2024-06-01 07:21:19] [INFO ] Computed 117 invariants in 9 ms
[2024-06-01 07:21:19] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-06-01 07:21:19] [INFO ] Invariant cache hit.
[2024-06-01 07:21:20] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
Running 492 sub problems to find dead transitions.
[2024-06-01 07:21:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 71/113 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 104 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 108 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 100 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 104 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 122 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 100 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 100 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 119 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 111 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 85 places in 155 ms of which 4 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 114 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 109 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 107 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:21:33] [INFO ] Deduced a trap composed of 107 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 108 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 108 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 107 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 105 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 84 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:21:34] [INFO ] Deduced a trap composed of 112 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:21:35] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:21:35] [INFO ] Deduced a trap composed of 39 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:21:35] [INFO ] Deduced a trap composed of 108 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:21:35] [INFO ] Deduced a trap composed of 108 places in 119 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-06-01 07:21:35] [INFO ] Deduced a trap composed of 84 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:21:35] [INFO ] Deduced a trap composed of 108 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 106 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 124 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 103 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 121 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:21:36] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:21:37] [INFO ] Deduced a trap composed of 109 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:21:37] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:21:37] [INFO ] Deduced a trap composed of 121 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:21:37] [INFO ] Deduced a trap composed of 110 places in 165 ms of which 2 ms to minimize.
[2024-06-01 07:21:37] [INFO ] Deduced a trap composed of 111 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:21:37] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:21:38] [INFO ] Deduced a trap composed of 133 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:21:38] [INFO ] Deduced a trap composed of 130 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:21:38] [INFO ] Deduced a trap composed of 131 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:21:38] [INFO ] Deduced a trap composed of 129 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:21:38] [INFO ] Deduced a trap composed of 105 places in 134 ms of which 2 ms to minimize.
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/177 constraints. Problems are: Problem set: 12 solved, 480 unsolved
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 104 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 107 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:21:42] [INFO ] Deduced a trap composed of 112 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 106 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 111 places in 103 ms of which 1 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 113 places in 196 ms of which 3 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 105 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:21:43] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:21:44] [INFO ] Deduced a trap composed of 109 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:21:44] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:21:44] [INFO ] Deduced a trap composed of 113 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:21:44] [INFO ] Deduced a trap composed of 105 places in 143 ms of which 2 ms to minimize.
[2024-06-01 07:21:44] [INFO ] Deduced a trap composed of 124 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:21:44] [INFO ] Deduced a trap composed of 110 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/197 constraints. Problems are: Problem set: 15 solved, 477 unsolved
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:21:45] [INFO ] Deduced a trap composed of 103 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 102 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 101 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 98 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 103 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 109 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 109 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 105 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 106 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 104 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 108 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 105 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:21:48] [INFO ] Deduced a trap composed of 107 places in 131 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 20/217 constraints. Problems are: Problem set: 15 solved, 477 unsolved
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 115 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 110 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 103 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 2 ms to minimize.
[2024-06-01 07:21:49] [INFO ] Deduced a trap composed of 127 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 104 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 4 ms to minimize.
[2024-06-01 07:21:50] [INFO ] Deduced a trap composed of 111 places in 134 ms of which 3 ms to minimize.
SMT process timed out in 30101ms, After SMT, problems are : Problem set: 15 solved, 477 unsolved
Search for dead transitions found 15 dead transitions in 30108ms
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 : 580/598 places, 478/511 transitions.
Applied a total of 0 rules in 11 ms. Remains 580 /580 variables (removed 0) and now considering 478/478 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31173 ms. Remains : 580/598 places, 478/511 transitions.
Stuttering acceptance computed with spot in 223 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 171 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 31422 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, 511/511 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 584 transition count 497
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 584 transition count 497
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 580 transition count 493
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 580 transition count 493
Applied a total of 36 rules in 62 ms. Remains 580 /598 variables (removed 18) and now considering 493/511 (removed 18) transitions.
// Phase 1: matrix 493 rows 580 cols
[2024-06-01 07:21:51] [INFO ] Computed 117 invariants in 11 ms
[2024-06-01 07:21:51] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-06-01 07:21:51] [INFO ] Invariant cache hit.
[2024-06-01 07:21:52] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
Running 492 sub problems to find dead transitions.
[2024-06-01 07:21:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 2 (OVERLAPS) 1/580 variables, 70/114 constraints. Problems are: Problem set: 0 solved, 492 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 105 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:22:01] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 3 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:22:02] [INFO ] Deduced a trap composed of 123 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 103 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 126 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 115 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 107 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 119 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 105 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:22:03] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 105 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 100 places in 125 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/580 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 89 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:22:04] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:22:05] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:22:05] [INFO ] Deduced a trap composed of 107 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:22:05] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:22:05] [INFO ] Deduced a trap composed of 120 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:22:05] [INFO ] Deduced a trap composed of 104 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:22:05] [INFO ] Deduced a trap composed of 109 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 99 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:22:06] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 4 ms to minimize.
[2024-06-01 07:22:07] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/580 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 492 unsolved
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 105 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 111 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 111 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 106 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:22:08] [INFO ] Deduced a trap composed of 106 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 108 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 110 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 104 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 118 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:22:09] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 80 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:22:10] [INFO ] Deduced a trap composed of 106 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:22:11] [INFO ] Deduced a trap composed of 86 places in 169 ms of which 3 ms to minimize.
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 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 TDEAD446 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/580 variables, 20/177 constraints. Problems are: Problem set: 12 solved, 480 unsolved
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 108 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:22:14] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 114 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 124 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:22:15] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 122 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 123 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 102 places in 178 ms of which 4 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 105 places in 163 ms of which 2 ms to minimize.
[2024-06-01 07:22:17] [INFO ] Deduced a trap composed of 106 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:22:17] [INFO ] Deduced a trap composed of 106 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:22:17] [INFO ] Deduced a trap composed of 109 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:22:17] [INFO ] Deduced a trap composed of 104 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:22:17] [INFO ] Deduced a trap composed of 105 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:22:17] [INFO ] Deduced a trap composed of 102 places in 134 ms of which 3 ms to minimize.
[2024-06-01 07:22:18] [INFO ] Deduced a trap composed of 105 places in 161 ms of which 3 ms to minimize.
Problem TDEAD407 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD447 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/580 variables, 20/197 constraints. Problems are: Problem set: 19 solved, 473 unsolved
[2024-06-01 07:22:18] [INFO ] Deduced a trap composed of 106 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:22:18] [INFO ] Deduced a trap composed of 108 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:22:18] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 105 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 106 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 105 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 104 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:22:19] [INFO ] Deduced a trap composed of 103 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 108 places in 141 ms of which 5 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 108 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 102 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 107 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:22:20] [INFO ] Deduced a trap composed of 125 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 105 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 127 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 104 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 108 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:22:21] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 2 ms to minimize.
Problem TDEAD412 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD438 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/580 variables, 20/217 constraints. Problems are: Problem set: 26 solved, 466 unsolved
[2024-06-01 07:22:22] [INFO ] Deduced a trap composed of 85 places in 166 ms of which 3 ms to minimize.
SMT process timed out in 30219ms, After SMT, problems are : Problem set: 26 solved, 466 unsolved
Search for dead transitions found 26 dead transitions in 30226ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 580/598 places, 467/511 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 578 transition count 467
Applied a total of 2 rules in 13 ms. Remains 578 /580 variables (removed 2) and now considering 467/467 (removed 0) transitions.
// Phase 1: matrix 467 rows 578 cols
[2024-06-01 07:22:22] [INFO ] Computed 122 invariants in 2 ms
[2024-06-01 07:22:22] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 07:22:22] [INFO ] Invariant cache hit.
[2024-06-01 07:22:23] [INFO ] Implicit Places using invariants and state equation in 588 ms returned [158]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 827 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 577/598 places, 467/511 transitions.
Applied a total of 0 rules in 12 ms. Remains 577 /577 variables (removed 0) and now considering 467/467 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 32124 ms. Remains : 577/598 places, 467/511 transitions.
Stuttering acceptance computed with spot in 262 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 548 reset in 304 ms.
Product exploration explored 100000 steps with 552 reset in 312 ms.
Computed a total of 520 stabilizing places and 420 stable transitions
Graph (complete) has 1213 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 420 stable transitions
Detected a total of 520/577 stabilizing places and 420/467 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 257 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 365 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (217 resets) in 318 ms. (125 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (39 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (27 resets) in 381 ms. (104 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (38 resets) in 176 ms. (226 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (39 resets) in 432 ms. (92 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (35 resets) in 304 ms. (131 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (36 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (28 resets) in 101 ms. (392 steps per ms) remains 4/7 properties
// Phase 1: matrix 467 rows 577 cols
[2024-06-01 07:22:25] [INFO ] Computed 121 invariants in 3 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-06-01 07:22:25] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 41 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 137/565 variables, 50/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 459/1024 variables, 565/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 104 places in 106 ms of which 15 ms to minimize.
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 107 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 103 places in 148 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1024 variables, 4/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 17/1041 variables, 9/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1041 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1041 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/1044 variables, 3/712 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1044 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1044 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1044/1044 variables, and 712 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1810 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 577/577 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 14/14 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, 9/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:22:28] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:22:28] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:22:28] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:28] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:22:28] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:28] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:22:28] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 13/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 137/565 variables, 50/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:22:28] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 459/1024 variables, 565/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1024 variables, 1/714 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 1 ms to minimize.
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 32 places in 112 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1024 variables, 4/718 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1024 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 17/1041 variables, 9/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1041 variables, 3/730 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1041 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 15 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 3 ms to minimize.
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:22:30] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:22:31] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:22:31] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:22:31] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:22:31] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:22:31] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:22:31] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:31] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:22:31] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1041 variables, 15/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1041 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 3/1044 variables, 3/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1044 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1044 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1044/1044 variables, and 749 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 577/577 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 47/47 constraints]
After SMT, in 6836ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 540 ms.
Support contains 5 out of 577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 577/577 places, 467/467 transitions.
Graph (complete) has 1213 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 403
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 401
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 401
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 277
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 362 transition count 277
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 11 places
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 329 rules applied. Total rules applied 733 place count 192 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 734 place count 192 transition count 117
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 736 place count 191 transition count 120
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 742 place count 191 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 743 place count 190 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 744 place count 189 transition count 119
Applied a total of 744 rules in 55 ms. Remains 189 /577 variables (removed 388) and now considering 119/467 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 189/577 places, 119/467 transitions.
RANDOM walk for 40000 steps (4255 resets) in 407 ms. (98 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1055 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1091 resets) in 155 ms. (256 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 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 742 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 354 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
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 LTL mode, iteration 0 : 577/577 places, 467/467 transitions.
Applied a total of 0 rules in 22 ms. Remains 577 /577 variables (removed 0) and now considering 467/467 (removed 0) transitions.
[2024-06-01 07:22:34] [INFO ] Invariant cache hit.
[2024-06-01 07:22:34] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-01 07:22:34] [INFO ] Invariant cache hit.
[2024-06-01 07:22:35] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-06-01 07:22:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/577 variables, 71/119 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/577 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 89 places in 168 ms of which 4 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 101 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 103 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 101 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 106 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 81 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 105 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 104 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 110 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 108 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 105 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 113 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 103 places in 94 ms of which 3 ms to minimize.
[2024-06-01 07:22:47] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 100 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 108 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 101 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:22:48] [INFO ] Deduced a trap composed of 102 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 99 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 105 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:22:50] [INFO ] Deduced a trap composed of 105 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:22:51] [INFO ] Deduced a trap composed of 110 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:22:51] [INFO ] Deduced a trap composed of 103 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:22:51] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:22:51] [INFO ] Deduced a trap composed of 98 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:22:51] [INFO ] Deduced a trap composed of 105 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:22:51] [INFO ] Deduced a trap composed of 103 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:22:52] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:22:52] [INFO ] Deduced a trap composed of 102 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:22:52] [INFO ] Deduced a trap composed of 101 places in 163 ms of which 3 ms to minimize.
[2024-06-01 07:22:52] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:22:52] [INFO ] Deduced a trap composed of 103 places in 195 ms of which 3 ms to minimize.
[2024-06-01 07:22:52] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:22:53] [INFO ] Deduced a trap composed of 103 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:22:53] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:22:53] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:22:53] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:22:53] [INFO ] Deduced a trap composed of 104 places in 156 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:22:57] [INFO ] Deduced a trap composed of 101 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:22:57] [INFO ] Deduced a trap composed of 105 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:22:57] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:22:57] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:22:58] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:22:58] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:22:58] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:22:58] [INFO ] Deduced a trap composed of 103 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:22:58] [INFO ] Deduced a trap composed of 103 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:22:58] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 100 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 99 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:22:59] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:23:00] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:23:00] [INFO ] Deduced a trap composed of 81 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:23:00] [INFO ] Deduced a trap composed of 106 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 110 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 111 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 102 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 3 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 102 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 105 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 104 places in 140 ms of which 3 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 105 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 105 places in 143 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:23:04] [INFO ] Deduced a trap composed of 102 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:23:04] [INFO ] Deduced a trap composed of 104 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:23:04] [INFO ] Deduced a trap composed of 106 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:23:04] [INFO ] Deduced a trap composed of 106 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:23:04] [INFO ] Deduced a trap composed of 127 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 103 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 130 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 107 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:23:05] [INFO ] Deduced a trap composed of 104 places in 120 ms of which 3 ms to minimize.
SMT process timed out in 30142ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 30147ms
Finished structural reductions in LTL mode , in 1 iterations and 31047 ms. Remains : 577/577 places, 467/467 transitions.
Computed a total of 520 stabilizing places and 420 stable transitions
Graph (complete) has 1213 edges and 577 vertex of which 576 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 520 stabilizing places and 420 stable transitions
Detected a total of 520/577 stabilizing places and 420/467 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 208 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 349 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (218 resets) in 571 ms. (69 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (28 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 120 ms. (330 steps per ms) remains 2/4 properties
[2024-06-01 07:23:06] [INFO ] Invariant cache hit.
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) 150/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 273/428 variables, 66/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 137/565 variables, 50/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 459/1024 variables, 565/686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1024 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 17/1041 variables, 9/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1041 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/1044 variables, 3/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1044 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1044 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1044/1044 variables, and 698 constraints, problems are : Problem set: 0 solved, 2 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 577/577 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) 150/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 273/428 variables, 66/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 3 ms to minimize.
[2024-06-01 07:23:07] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 5 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:23:08] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:23:09] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:23:09] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:23:09] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 137/565 variables, 50/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 459/1024 variables, 565/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:23:09] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1024 variables, 1/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1024 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 17/1041 variables, 9/718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1041 variables, 2/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:23:09] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:23:09] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:23:09] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:23:09] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:23:10] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:23:10] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1041 variables, 6/726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1041 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/1044 variables, 3/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1044 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1044/1044 variables, and 729 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3336 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 577/577 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 29/29 constraints]
After SMT, in 3744ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 305 ms.
Support contains 5 out of 577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 577/577 places, 467/467 transitions.
Graph (complete) has 1213 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 403
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 401
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 401
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 277
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 277
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 11 places
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 329 rules applied. Total rules applied 733 place count 192 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 734 place count 192 transition count 117
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 736 place count 191 transition count 120
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 742 place count 191 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 743 place count 190 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 744 place count 189 transition count 119
Applied a total of 744 rules in 61 ms. Remains 189 /577 variables (removed 388) and now considering 119/467 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 189/577 places, 119/467 transitions.
RANDOM walk for 40000 steps (4288 resets) in 515 ms. (77 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1078 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1078 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1437 steps, run visited all 2 properties in 21 ms. (steps per millisecond=68 )
Probabilistic random walk after 1437 steps, saw 779 distinct states, run finished after 22 ms. (steps per millisecond=65 ) 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 835 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 337 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 335 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 332 ms :[false, false, false, (AND (NOT p0) p1), false, (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 547 reset in 282 ms.
Product exploration explored 100000 steps with 553 reset in 331 ms.
Applying partial POR strategy [false, false, false, false, true, true, true]
Stuttering acceptance computed with spot in 329 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, 467/467 transitions.
Graph (complete) has 1213 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 466
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 532
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 532
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 175 place count 554 transition count 491
Deduced a syphon composed of 130 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 197 place count 554 transition count 491
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 491
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 436 place count 508 transition count 445
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 445
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 457
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 456
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 489 place count 505 transition count 450
Deduced a syphon composed of 277 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 492 place count 505 transition count 450
Deduced a syphon composed of 277 places in 1 ms
Applied a total of 492 rules in 190 ms. Remains 505 /577 variables (removed 72) and now considering 450/467 (removed 17) transitions.
[2024-06-01 07:23:14] [INFO ] Redundant transitions in 36 ms returned []
Running 449 sub problems to find dead transitions.
// Phase 1: matrix 450 rows 505 cols
[2024-06-01 07:23:14] [INFO ] Computed 121 invariants in 9 ms
[2024-06-01 07:23:14] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (OVERLAPS) 1/505 variables, 71/120 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 449 unsolved
[2024-06-01 07:23:22] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:23:22] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:23:22] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:23:23] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:23:23] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:23:23] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
[2024-06-01 07:23:23] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:23:23] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:23:23] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:23:23] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:23:23] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:23:23] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 2 ms to minimize.
[2024-06-01 07:23:23] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:23:23] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:23:24] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:23:24] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:23:24] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:23:24] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:23:24] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 3 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-01 07:23:24] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 3 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 TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem 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 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 TDEAD218 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 TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 20/141 constraints. Problems are: Problem set: 143 solved, 306 unsolved
[2024-06-01 07:23:24] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
[2024-06-01 07:23:25] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:23:25] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
[2024-06-01 07:23:25] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:23:25] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 3 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-06-01 07:23:25] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 3 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
[2024-06-01 07:23:26] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
[2024-06-01 07:23:26] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:23:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
[2024-06-01 07:23:26] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:23:26] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:23:26] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:23:27] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:23:27] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:23:27] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:23:27] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:23:27] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:23:27] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:23:27] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 4 ms to minimize.
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 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 TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 20/161 constraints. Problems are: Problem set: 224 solved, 225 unsolved
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD46 is UNSAT
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
Problem TDEAD50 is UNSAT
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 07:23:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-01 07:23:29] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Problem TDEAD65 is UNSAT
[2024-06-01 07:23:29] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 07:23:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-01 07:23:29] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
[2024-06-01 07:23:29] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
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 TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD391 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 20/181 constraints. Problems are: Problem set: 262 solved, 187 unsolved
[2024-06-01 07:23:30] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:23:30] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
[2024-06-01 07:23:30] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 07:23:30] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-06-01 07:23:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD84 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD85 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
Problem TDEAD87 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD93 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
Problem TDEAD102 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Problem TDEAD104 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
Problem TDEAD105 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD106 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 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 TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 20/201 constraints. Problems are: Problem set: 298 solved, 151 unsolved
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
Problem TDEAD112 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
Problem TDEAD114 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
[2024-06-01 07:23:31] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
Problem TDEAD117 is UNSAT
[2024-06-01 07:23:32] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD119 is UNSAT
[2024-06-01 07:23:32] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
[2024-06-01 07:23:32] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
Problem TDEAD122 is UNSAT
[2024-06-01 07:23:32] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 3 ms to minimize.
[2024-06-01 07:23:32] [INFO ] Deduced a trap composed of 48 places in 200 ms of which 4 ms to minimize.
[2024-06-01 07:23:32] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 3 ms to minimize.
[2024-06-01 07:23:32] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
Problem TDEAD139 is UNSAT
[2024-06-01 07:23:32] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
[2024-06-01 07:23:33] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
Problem TDEAD147 is UNSAT
Problem TDEAD151 is UNSAT
[2024-06-01 07:23:33] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
[2024-06-01 07:23:33] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:23:33] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:23:33] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:23:33] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 3 ms to minimize.
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 20/221 constraints. Problems are: Problem set: 319 solved, 130 unsolved
[2024-06-01 07:23:34] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:23:34] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:23:34] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:23:34] [INFO ] Deduced a trap composed of 48 places in 135 ms of which 3 ms to minimize.
Problem TDEAD168 is UNSAT
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:23:35] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 3 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 49 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD211 is UNSAT
Problem TDEAD235 is UNSAT
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
Problem TDEAD238 is UNSAT
[2024-06-01 07:23:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Problem TDEAD240 is UNSAT
[2024-06-01 07:23:37] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
Problem TDEAD168 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 20/241 constraints. Problems are: Problem set: 324 solved, 125 unsolved
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 49 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
Problem TDEAD295 is UNSAT
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 3 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 3 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 48 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 46 places in 179 ms of which 3 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 47 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:23:41] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 17/258 constraints. Problems are: Problem set: 325 solved, 124 unsolved
[2024-06-01 07:23:42] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:23:42] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:23:42] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 3 ms to minimize.
[2024-06-01 07:23:42] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 2 ms to minimize.
[2024-06-01 07:23:43] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/505 variables, 5/263 constraints. Problems are: Problem set: 325 solved, 124 unsolved
[2024-06-01 07:23:44] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:23:44] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/955 variables, and 265 constraints, problems are : Problem set: 325 solved, 124 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 0/505 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 144/144 constraints]
Escalating to Integer solving :Problem set: 325 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 325 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 219/451 variables, 71/71 constraints. Problems are: Problem set: 325 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 1/72 constraints. Problems are: Problem set: 325 solved, 124 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/451 variables, 144/216 constraints. Problems are: Problem set: 325 solved, 124 unsolved
[2024-06-01 07:23:45] [INFO ] Deduced a trap composed of 37 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:23:45] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:23:45] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:23:46] [INFO ] Deduced a trap composed of 47 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 3 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:23:47] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 49 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:23:48] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/451 variables, 20/236 constraints. Problems are: Problem set: 325 solved, 124 unsolved
[2024-06-01 07:23:50] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 1/237 constraints. Problems are: Problem set: 325 solved, 124 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/237 constraints. Problems are: Problem set: 325 solved, 124 unsolved
At refinement iteration 7 (OVERLAPS) 54/505 variables, 49/286 constraints. Problems are: Problem set: 325 solved, 124 unsolved
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 46 places in 167 ms of which 3 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 2 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 47 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 3 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 3 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 3 ms to minimize.
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 5 ms to minimize.
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:23:54] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:23:54] [INFO ] Deduced a trap composed of 48 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:23:55] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:23:55] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 19/305 constraints. Problems are: Problem set: 325 solved, 124 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 0/305 constraints. Problems are: Problem set: 325 solved, 124 unsolved
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 10 (OVERLAPS) 450/955 variables, 505/810 constraints. Problems are: Problem set: 331 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/955 variables, 6/816 constraints. Problems are: Problem set: 331 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/955 variables, 118/934 constraints. Problems are: Problem set: 331 solved, 118 unsolved
[2024-06-01 07:24:01] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/955 variables, 1/935 constraints. Problems are: Problem set: 331 solved, 118 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 955/955 variables, and 935 constraints, problems are : Problem set: 331 solved, 118 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 505/505 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 118/449 constraints, Known Traps: 185/185 constraints]
After SMT, in 60257ms problems are : Problem set: 331 solved, 118 unsolved
Search for dead transitions found 331 dead transitions in 60265ms
Found 331 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 331 transitions
Dead transitions reduction (with SMT) removed 331 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 505/577 places, 119/467 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 28 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/467 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60533 ms. Remains : 189/577 places, 125/467 transitions.
Support contains 5 out of 577 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 577/577 places, 467/467 transitions.
Applied a total of 0 rules in 21 ms. Remains 577 /577 variables (removed 0) and now considering 467/467 (removed 0) transitions.
// Phase 1: matrix 467 rows 577 cols
[2024-06-01 07:24:14] [INFO ] Computed 121 invariants in 8 ms
[2024-06-01 07:24:14] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-06-01 07:24:14] [INFO ] Invariant cache hit.
[2024-06-01 07:24:15] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
Running 466 sub problems to find dead transitions.
[2024-06-01 07:24:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 2 (OVERLAPS) 1/577 variables, 71/119 constraints. Problems are: Problem set: 0 solved, 466 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/577 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:24:24] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:24:24] [INFO ] Deduced a trap composed of 101 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 83 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 105 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 104 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:24:26] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:24:26] [INFO ] Deduced a trap composed of 106 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:24:26] [INFO ] Deduced a trap composed of 110 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:24:26] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:24:26] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:24:26] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:24:27] [INFO ] Deduced a trap composed of 106 places in 165 ms of which 3 ms to minimize.
[2024-06-01 07:24:27] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 5 ms to minimize.
[2024-06-01 07:24:27] [INFO ] Deduced a trap composed of 113 places in 148 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:24:27] [INFO ] Deduced a trap composed of 104 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:24:27] [INFO ] Deduced a trap composed of 103 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:24:28] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:24:28] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:24:28] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:24:28] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:24:28] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:24:28] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:24:29] [INFO ] Deduced a trap composed of 96 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:24:29] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:24:29] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:24:29] [INFO ] Deduced a trap composed of 101 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:24:29] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:24:29] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:24:29] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
[2024-06-01 07:24:29] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 3 ms to minimize.
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 101 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 99 places in 135 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:24:30] [INFO ] Deduced a trap composed of 105 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:24:31] [INFO ] Deduced a trap composed of 102 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:24:31] [INFO ] Deduced a trap composed of 105 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:24:31] [INFO ] Deduced a trap composed of 110 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:24:31] [INFO ] Deduced a trap composed of 103 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:24:32] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 2 ms to minimize.
[2024-06-01 07:24:32] [INFO ] Deduced a trap composed of 98 places in 168 ms of which 3 ms to minimize.
[2024-06-01 07:24:32] [INFO ] Deduced a trap composed of 105 places in 171 ms of which 3 ms to minimize.
[2024-06-01 07:24:32] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:24:32] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:24:32] [INFO ] Deduced a trap composed of 102 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:24:32] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:24:33] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:24:33] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:24:33] [INFO ] Deduced a trap composed of 99 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:24:33] [INFO ] Deduced a trap composed of 103 places in 108 ms of which 2 ms to minimize.
[2024-06-01 07:24:33] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:24:33] [INFO ] Deduced a trap composed of 98 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:24:33] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:24:33] [INFO ] Deduced a trap composed of 104 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:24:37] [INFO ] Deduced a trap composed of 101 places in 170 ms of which 2 ms to minimize.
[2024-06-01 07:24:37] [INFO ] Deduced a trap composed of 105 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:24:37] [INFO ] Deduced a trap composed of 102 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 97 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 100 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 103 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:24:38] [INFO ] Deduced a trap composed of 101 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 101 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 107 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 100 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 99 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 102 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:24:39] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:24:40] [INFO ] Deduced a trap composed of 81 places in 164 ms of which 3 ms to minimize.
[2024-06-01 07:24:40] [INFO ] Deduced a trap composed of 106 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:24:40] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:24:40] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 100 places in 153 ms of which 3 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 103 places in 136 ms of which 3 ms to minimize.
[2024-06-01 07:24:41] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 104 places in 134 ms of which 2 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 101 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 105 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 106 places in 107 ms of which 3 ms to minimize.
[2024-06-01 07:24:42] [INFO ] Deduced a trap composed of 106 places in 146 ms of which 3 ms to minimize.
[2024-06-01 07:24:43] [INFO ] Deduced a trap composed of 105 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:24:43] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/577 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 466 unsolved
[2024-06-01 07:24:43] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:24:43] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:24:43] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:24:44] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 3 ms to minimize.
[2024-06-01 07:24:44] [INFO ] Deduced a trap composed of 106 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:24:44] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:24:44] [INFO ] Deduced a trap composed of 127 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:24:44] [INFO ] Deduced a trap composed of 103 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:24:44] [INFO ] Deduced a trap composed of 106 places in 147 ms of which 3 ms to minimize.
[2024-06-01 07:24:44] [INFO ] Deduced a trap composed of 130 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:24:45] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:24:45] [INFO ] Deduced a trap composed of 104 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:24:45] [INFO ] Deduced a trap composed of 103 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:24:45] [INFO ] Deduced a trap composed of 109 places in 139 ms of which 4 ms to minimize.
SMT process timed out in 30168ms, After SMT, problems are : Problem set: 0 solved, 466 unsolved
Search for dead transitions found 0 dead transitions in 30175ms
Finished structural reductions in LTL mode , in 1 iterations and 30987 ms. Remains : 577/577 places, 467/467 transitions.
Treatment of property BusinessProcesses-PT-19-LTLFireability-15 finished in 174684 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-06-01 07:24:46] [INFO ] Flatten gal took : 60 ms
[2024-06-01 07:24:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 07:24:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 598 places, 511 transitions and 1590 arcs took 14 ms.
Total runtime 565305 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA BusinessProcesses-PT-19-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BusinessProcesses-PT-19-LTLFireability-15

BK_STOP 1717227119782

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name BusinessProcesses-PT-19-LTLFireability-06
ltl formula formula --ltl=/tmp/7434/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 598 places, 511 transitions and 1590 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7434/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7434/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7434/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7434/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 599 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 599, there are 521 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~172 levels ~10000 states ~90668 transitions
pnml2lts-mc( 0/ 4): ~172 levels ~20000 states ~191900 transitions
pnml2lts-mc( 0/ 4): ~478 levels ~40000 states ~363292 transitions
pnml2lts-mc( 0/ 4): ~478 levels ~80000 states ~769364 transitions
pnml2lts-mc( 3/ 4): ~170 levels ~160000 states ~2016724 transitions
pnml2lts-mc( 3/ 4): ~170 levels ~320000 states ~4319276 transitions
pnml2lts-mc( 3/ 4): ~170 levels ~640000 states ~9023756 transitions
pnml2lts-mc( 3/ 4): ~170 levels ~1280000 states ~19328388 transitions
pnml2lts-mc( 3/ 4): ~170 levels ~2560000 states ~40834884 transitions
pnml2lts-mc( 3/ 4): ~170 levels ~5120000 states ~86098340 transitions
pnml2lts-mc( 3/ 4): ~170 levels ~10240000 states ~181653156 transitions
pnml2lts-mc( 3/ 4): ~170 levels ~20480000 states ~376249676 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 30939340
pnml2lts-mc( 0/ 4): unique states count: 33550198
pnml2lts-mc( 0/ 4): unique transitions count: 569417064
pnml2lts-mc( 0/ 4): - self-loop count: 264
pnml2lts-mc( 0/ 4): - claim dead count: 531159416
pnml2lts-mc( 0/ 4): - claim found count: 4697524
pnml2lts-mc( 0/ 4): - claim success count: 33550206
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1241
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33550206 states 569417096 transitions, fanout: 16.972
pnml2lts-mc( 0/ 4): Total exploration time 350.000 sec (349.950 sec minimum, 349.973 sec on average)
pnml2lts-mc( 0/ 4): States per second: 95858, Transitions per second: 1626906
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 283.0MB, 8.8 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/42.0%
pnml2lts-mc( 0/ 4): Stored 523 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 283.0MB (~256.0MB paged-in)
ltl formula name BusinessProcesses-PT-19-LTLFireability-15
ltl formula formula --ltl=/tmp/7434/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 598 places, 511 transitions and 1590 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.030 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7434/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7434/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7434/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7434/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 600 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 599, there are 706 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~172 levels ~10000 states ~202428 transitions
pnml2lts-mc( 2/ 4): ~171 levels ~20000 states ~358780 transitions
pnml2lts-mc( 2/ 4): ~171 levels ~40000 states ~782388 transitions
pnml2lts-mc( 2/ 4): ~171 levels ~80000 states ~1643252 transitions
pnml2lts-mc( 2/ 4): ~171 levels ~160000 states ~3602820 transitions
pnml2lts-mc( 0/ 4): ~172 levels ~320000 states ~8701164 transitions
pnml2lts-mc( 0/ 4): ~172 levels ~640000 states ~18548444 transitions
pnml2lts-mc( 0/ 4): ~172 levels ~1280000 states ~38746764 transitions
pnml2lts-mc( 0/ 4): ~172 levels ~2560000 states ~82380108 transitions
pnml2lts-mc( 0/ 4): ~172 levels ~5120000 states ~173378476 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6601820
pnml2lts-mc( 0/ 4): unique states count: 6602433
pnml2lts-mc( 0/ 4): unique transitions count: 214204424
pnml2lts-mc( 0/ 4): - self-loop count: 16
pnml2lts-mc( 0/ 4): - claim dead count: 207585388
pnml2lts-mc( 0/ 4): - claim found count: 42
pnml2lts-mc( 0/ 4): - claim success count: 6602443
pnml2lts-mc( 0/ 4): - cum. max stack depth: 714
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6602443 states 214204494 transitions, fanout: 32.443
pnml2lts-mc( 0/ 4): Total exploration time 82.280 sec (82.150 sec minimum, 82.185 sec on average)
pnml2lts-mc( 0/ 4): States per second: 80244, Transitions per second: 2603360
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 114.4MB, 18.2 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 19.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 523 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 114.4MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-19"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BusinessProcesses-PT-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 r472-tajo-171620399800596"
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 ;