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-171620399700540.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-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399700540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.8K 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.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 16:38 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 146K 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-12-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717225696334

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-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:08:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:08:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:08:18] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-06-01 07:08:18] [INFO ] Transformed 586 places.
[2024-06-01 07:08:18] [INFO ] Transformed 525 transitions.
[2024-06-01 07:08:18] [INFO ] Found NUPN structural information;
[2024-06-01 07:08:18] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 78 place count 504 transition count 446
Iterating global reduction 1 with 75 rules applied. Total rules applied 153 place count 504 transition count 446
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 187 place count 470 transition count 412
Iterating global reduction 1 with 34 rules applied. Total rules applied 221 place count 470 transition count 412
Applied a total of 221 rules in 116 ms. Remains 470 /582 variables (removed 112) and now considering 412/521 (removed 109) transitions.
// Phase 1: matrix 412 rows 470 cols
[2024-06-01 07:08:18] [INFO ] Computed 95 invariants in 39 ms
[2024-06-01 07:08:18] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-06-01 07:08:18] [INFO ] Invariant cache hit.
[2024-06-01 07:08:19] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 945 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2024-06-01 07:08:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 61 places in 203 ms of which 37 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:08:29] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 3 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 3 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:08:30] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 3 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 3 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-01 07:08:31] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 3 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 97 places in 196 ms of which 2 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 92 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 83 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 85 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:08:32] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 27 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 90 places in 207 ms of which 4 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 85 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 83 places in 182 ms of which 2 ms to minimize.
[2024-06-01 07:08:33] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 3 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 5 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:08:34] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 93 places in 192 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 93 places in 184 ms of which 3 ms to minimize.
[2024-06-01 07:08:35] [INFO ] Deduced a trap composed of 87 places in 185 ms of which 2 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-06-01 07:08:36] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 3 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 65 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 3 ms to minimize.
[2024-06-01 07:08:37] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 118 places in 160 ms of which 5 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:08:38] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 2 ms to minimize.
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/155 constraints. Problems are: Problem set: 6 solved, 405 unsolved
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 87 places in 189 ms of which 6 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 89 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 90 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 91 places in 169 ms of which 8 ms to minimize.
[2024-06-01 07:08:42] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 94 places in 172 ms of which 6 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 98 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 86 places in 215 ms of which 4 ms to minimize.
[2024-06-01 07:08:43] [INFO ] Deduced a trap composed of 90 places in 244 ms of which 4 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 86 places in 206 ms of which 5 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 85 places in 212 ms of which 3 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 93 places in 181 ms of which 5 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 86 places in 179 ms of which 2 ms to minimize.
[2024-06-01 07:08:44] [INFO ] Deduced a trap composed of 89 places in 177 ms of which 2 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 90 places in 195 ms of which 2 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:08:45] [INFO ] Deduced a trap composed of 84 places in 151 ms of which 2 ms to minimize.
Problem TDEAD342 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 20/175 constraints. Problems are: Problem set: 12 solved, 399 unsolved
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 91 places in 207 ms of which 5 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 87 places in 177 ms of which 4 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 88 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:08:46] [INFO ] Deduced a trap composed of 92 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 87 places in 183 ms of which 4 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 90 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:08:47] [INFO ] Deduced a trap composed of 89 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 85 places in 185 ms of which 3 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 90 places in 169 ms of which 3 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 90 places in 170 ms of which 5 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:08:48] [INFO ] Deduced a trap composed of 95 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 88 places in 135 ms of which 8 ms to minimize.
[2024-06-01 07:08:49] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/882 variables, and 192 constraints, problems are : Problem set: 12 solved, 399 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/470 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 97/97 constraints]
Escalating to Integer solving :Problem set: 12 solved, 399 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 39/39 constraints. Problems are: Problem set: 12 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/39 constraints. Problems are: Problem set: 12 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 52/91 constraints. Problems are: Problem set: 12 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 4/95 constraints. Problems are: Problem set: 12 solved, 399 unsolved
Problem TDEAD343 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 97/192 constraints. Problems are: Problem set: 19 solved, 392 unsolved
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 84 places in 157 ms of which 2 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 91 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 81 places in 170 ms of which 6 ms to minimize.
[2024-06-01 07:08:54] [INFO ] Deduced a trap composed of 90 places in 161 ms of which 5 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 92 places in 176 ms of which 5 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 85 places in 223 ms of which 4 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 88 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:08:55] [INFO ] Deduced a trap composed of 79 places in 184 ms of which 5 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 80 places in 196 ms of which 6 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 4 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 83 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:08:56] [INFO ] Deduced a trap composed of 80 places in 158 ms of which 5 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 77 places in 175 ms of which 9 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 78 places in 193 ms of which 25 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 84 places in 161 ms of which 5 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 8 ms to minimize.
[2024-06-01 07:08:57] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 2 ms to minimize.
Problem TDEAD382 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/212 constraints. Problems are: Problem set: 20 solved, 391 unsolved
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 86 places in 188 ms of which 3 ms to minimize.
[2024-06-01 07:08:58] [INFO ] Deduced a trap composed of 86 places in 152 ms of which 6 ms to minimize.
[2024-06-01 07:08:59] [INFO ] Deduced a trap composed of 84 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:09:04] [INFO ] Deduced a trap composed of 87 places in 5699 ms of which 5 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 92 places in 178 ms of which 5 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 87 places in 163 ms of which 4 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 88 places in 196 ms of which 9 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:09:05] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 90 places in 169 ms of which 4 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 92 places in 179 ms of which 7 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:09:06] [INFO ] Deduced a trap composed of 89 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 89 places in 183 ms of which 6 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 89 places in 163 ms of which 4 ms to minimize.
[2024-06-01 07:09:07] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 3 ms to minimize.
Problem TDEAD353 is UNSAT
Problem TDEAD366 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/232 constraints. Problems are: Problem set: 22 solved, 389 unsolved
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 2 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 89 places in 172 ms of which 4 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 92 places in 169 ms of which 4 ms to minimize.
[2024-06-01 07:09:08] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 92 places in 179 ms of which 2 ms to minimize.
[2024-06-01 07:09:09] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:09:10] [INFO ] Deduced a trap composed of 85 places in 149 ms of which 3 ms to minimize.
[2024-06-01 07:09:13] [INFO ] Deduced a trap composed of 90 places in 3615 ms of which 29 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 88 places in 207 ms of which 5 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 2 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:09:14] [INFO ] Deduced a trap composed of 86 places in 193 ms of which 6 ms to minimize.
[2024-06-01 07:09:15] [INFO ] Deduced a trap composed of 87 places in 197 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 20/252 constraints. Problems are: Problem set: 22 solved, 389 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/882 variables, and 252 constraints, problems are : Problem set: 22 solved, 389 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/470 constraints, PredecessorRefiner: 0/411 constraints, Known Traps: 157/157 constraints]
After SMT, in 60256ms problems are : Problem set: 22 solved, 389 unsolved
Search for dead transitions found 22 dead transitions in 60283ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 470/582 places, 390/521 transitions.
Applied a total of 0 rules in 21 ms. Remains 470 /470 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61390 ms. Remains : 470/582 places, 390/521 transitions.
Support contains 38 out of 470 places after structural reductions.
[2024-06-01 07:09:20] [INFO ] Flatten gal took : 76 ms
[2024-06-01 07:09:20] [INFO ] Flatten gal took : 35 ms
[2024-06-01 07:09:20] [INFO ] Input system was already deterministic with 390 transitions.
RANDOM walk for 40000 steps (292 resets) in 3003 ms. (13 steps per ms) remains 13/32 properties
BEST_FIRST walk for 40003 steps (50 resets) in 284 ms. (140 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (55 resets) in 161 ms. (246 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (54 resets) in 240 ms. (165 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (50 resets) in 268 ms. (148 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (52 resets) in 192 ms. (207 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (52 resets) in 128 ms. (310 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (52 resets) in 148 ms. (268 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (51 resets) in 148 ms. (268 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (49 resets) in 90 ms. (439 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (50 resets) in 73 ms. (540 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40002 steps (53 resets) in 73 ms. (540 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (51 resets) in 105 ms. (377 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (52 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
// Phase 1: matrix 390 rows 470 cols
[2024-06-01 07:09:22] [INFO ] Computed 96 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 71/89 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 214/303 variables, 46/50 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 155/458 variables, 42/92 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 3 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 86 places in 179 ms of which 2 ms to minimize.
[2024-06-01 07:09:22] [INFO ] Deduced a trap composed of 89 places in 180 ms of which 2 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 3 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:09:23] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 92 places in 196 ms of which 2 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 78 places in 172 ms of which 3 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 81 places in 200 ms of which 3 ms to minimize.
[2024-06-01 07:09:24] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:09:31] [INFO ] Deduced a trap composed of 22 places in 7141 ms of which 5 ms to minimize.
SMT process timed out in 9674ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 390/390 transitions.
Graph (trivial) has 206 edges and 470 vertex of which 6 / 470 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 999 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 464 transition count 334
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 416 transition count 334
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 91 Pre rules applied. Total rules applied 98 place count 416 transition count 243
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 296 place count 309 transition count 243
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 306 place count 299 transition count 233
Iterating global reduction 2 with 10 rules applied. Total rules applied 316 place count 299 transition count 233
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 542 place count 184 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 544 place count 183 transition count 126
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 546 place count 183 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 548 place count 181 transition count 124
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 553 place count 181 transition count 124
Applied a total of 553 rules in 175 ms. Remains 181 /470 variables (removed 289) and now considering 124/390 (removed 266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 181/470 places, 124/390 transitions.
RANDOM walk for 40000 steps (1210 resets) in 1433 ms. (27 steps per ms) remains 4/12 properties
BEST_FIRST walk for 40000 steps (585 resets) in 337 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (641 resets) in 361 ms. (110 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (591 resets) in 375 ms. (106 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (603 resets) in 323 ms. (123 steps per ms) remains 4/4 properties
// Phase 1: matrix 124 rows 181 cols
[2024-06-01 07:09:32] [INFO ] Computed 76 invariants in 8 ms
[2024-06-01 07:09:32] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 58/67 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 78/145 variables, 48/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 34/179 variables, 22/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 124/303 variables, 179/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 13/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 10 (OVERLAPS) 2/305 variables, 2/270 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 0/270 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/305 variables, 0/270 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 270 constraints, problems are : Problem set: 1 solved, 3 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 181/181 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/62 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
Problem AtomicPropp4 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 81/143 variables, 49/55 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 1/56 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 7 (OVERLAPS) 36/179 variables, 22/78 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 1/79 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/79 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 124/303 variables, 179/258 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 13/271 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 1/272 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/303 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/305 variables, 2/274 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 07:09:33] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/305 variables, 1/275 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/305 variables, 0/275 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/305 variables, 0/275 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 275 constraints, problems are : Problem set: 3 solved, 1 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 181/181 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 842ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 124/124 transitions.
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 0 with 3 rules applied. Total rules applied 3 place count 181 transition count 121
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 178 transition count 121
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 6 place count 178 transition count 113
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 24 place count 168 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 167 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 167 transition count 112
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 38 place count 161 transition count 106
Applied a total of 38 rules in 21 ms. Remains 161 /181 variables (removed 20) and now considering 106/124 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 161/181 places, 106/124 transitions.
RANDOM walk for 40000 steps (1418 resets) in 380 ms. (104 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (786 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2013 steps, run visited all 1 properties in 32 ms. (steps per millisecond=62 )
Probabilistic random walk after 2013 steps, saw 903 distinct states, run finished after 35 ms. (steps per millisecond=57 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-12-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 455 stabilizing places and 375 stable transitions
Graph (complete) has 1006 edges and 470 vertex of which 469 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 390/390 transitions.
Graph (complete) has 1006 edges and 470 vertex of which 469 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 468 transition count 340
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 99 place count 420 transition count 338
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 418 transition count 338
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 102 Pre rules applied. Total rules applied 101 place count 418 transition count 236
Deduced a syphon composed of 102 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 222 rules applied. Total rules applied 323 place count 298 transition count 236
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 336 place count 285 transition count 223
Iterating global reduction 3 with 13 rules applied. Total rules applied 349 place count 285 transition count 223
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 349 place count 285 transition count 222
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 351 place count 284 transition count 222
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 589 place count 163 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 590 place count 163 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 592 place count 162 transition count 108
Applied a total of 592 rules in 47 ms. Remains 162 /470 variables (removed 308) and now considering 108/390 (removed 282) transitions.
// Phase 1: matrix 108 rows 162 cols
[2024-06-01 07:09:34] [INFO ] Computed 74 invariants in 2 ms
[2024-06-01 07:09:34] [INFO ] Implicit Places using invariants in 205 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 221 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/470 places, 108/390 transitions.
Applied a total of 0 rules in 4 ms. Remains 143 /143 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 273 ms. Remains : 143/470 places, 108/390 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-00
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-00 finished in 550 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 5 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 390/390 transitions.
Graph (trivial) has 220 edges and 470 vertex of which 6 / 470 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 1000 edges and 465 vertex of which 464 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 463 transition count 331
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 412 transition count 331
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 104 place count 412 transition count 233
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 318 place count 296 transition count 233
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 331 place count 283 transition count 220
Iterating global reduction 2 with 13 rules applied. Total rules applied 344 place count 283 transition count 220
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 344 place count 283 transition count 219
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 346 place count 282 transition count 219
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 570 place count 168 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 572 place count 167 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 573 place count 166 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 574 place count 165 transition count 112
Applied a total of 574 rules in 47 ms. Remains 165 /470 variables (removed 305) and now considering 112/390 (removed 278) transitions.
// Phase 1: matrix 112 rows 165 cols
[2024-06-01 07:09:34] [INFO ] Computed 73 invariants in 2 ms
[2024-06-01 07:09:35] [INFO ] Implicit Places using invariants in 177 ms returned [43, 44, 49, 50, 51, 52, 53, 54, 55]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 178 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/470 places, 112/390 transitions.
Applied a total of 0 rules in 12 ms. Remains 156 /156 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 238 ms. Remains : 156/470 places, 112/390 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-01 finished in 290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U (G(p0)||(p0&&G((p1 U X((p2||G(p3))))))))))'
Support contains 5 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 390/390 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 457 transition count 377
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 457 transition count 377
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 455 transition count 375
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 455 transition count 375
Applied a total of 30 rules in 21 ms. Remains 455 /470 variables (removed 15) and now considering 375/390 (removed 15) transitions.
// Phase 1: matrix 375 rows 455 cols
[2024-06-01 07:09:35] [INFO ] Computed 96 invariants in 3 ms
[2024-06-01 07:09:35] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-01 07:09:35] [INFO ] Invariant cache hit.
[2024-06-01 07:09:35] [INFO ] Implicit Places using invariants and state equation in 433 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 601 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/470 places, 375/390 transitions.
Applied a total of 0 rules in 12 ms. Remains 454 /454 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 634 ms. Remains : 454/470 places, 375/390 transitions.
Stuttering acceptance computed with spot in 409 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-03
Product exploration explored 100000 steps with 725 reset in 377 ms.
Stack based approach found an accepted trace after 57799 steps with 426 reset with depth 10 and stack size 10 in 193 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-03 finished in 1659 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(F(X(G(X(F((!(p0 U p1)||p0)))))))))'
Support contains 2 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 390/390 transitions.
Graph (trivial) has 217 edges and 470 vertex of which 6 / 470 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1000 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 463 transition count 333
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 414 transition count 333
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 100 place count 414 transition count 235
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 314 place count 298 transition count 235
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 326 place count 286 transition count 223
Iterating global reduction 2 with 12 rules applied. Total rules applied 338 place count 286 transition count 223
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 338 place count 286 transition count 222
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 340 place count 285 transition count 222
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 576 place count 165 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 577 place count 164 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 578 place count 163 transition count 105
Applied a total of 578 rules in 37 ms. Remains 163 /470 variables (removed 307) and now considering 105/390 (removed 285) transitions.
// Phase 1: matrix 105 rows 163 cols
[2024-06-01 07:09:36] [INFO ] Computed 73 invariants in 1 ms
[2024-06-01 07:09:37] [INFO ] Implicit Places using invariants in 160 ms returned [0, 1, 6, 7, 30, 31, 32, 33, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 161 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/470 places, 105/390 transitions.
Applied a total of 0 rules in 15 ms. Remains 145 /145 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 145/470 places, 105/390 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-05
Stuttering criterion allowed to conclude after 25 steps with 4 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-05 finished in 329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 390/390 transitions.
Graph (trivial) has 220 edges and 470 vertex of which 6 / 470 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 1000 edges and 465 vertex of which 464 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 463 transition count 332
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 413 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 412 transition count 331
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 104 place count 412 transition count 232
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 320 place count 295 transition count 232
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 333 place count 282 transition count 219
Iterating global reduction 3 with 13 rules applied. Total rules applied 346 place count 282 transition count 219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 346 place count 282 transition count 218
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 348 place count 281 transition count 218
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 580 place count 163 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 582 place count 162 transition count 108
Applied a total of 582 rules in 34 ms. Remains 162 /470 variables (removed 308) and now considering 108/390 (removed 282) transitions.
// Phase 1: matrix 108 rows 162 cols
[2024-06-01 07:09:37] [INFO ] Computed 74 invariants in 0 ms
[2024-06-01 07:09:37] [INFO ] Implicit Places using invariants in 110 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 52, 53, 54]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 111 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/470 places, 108/390 transitions.
Applied a total of 0 rules in 5 ms. Remains 144 /144 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 150 ms. Remains : 144/470 places, 108/390 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-06 finished in 192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X((F(!p1)||G(p0)))) U X(G(!p2))))'
Support contains 3 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 390/390 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 459 transition count 379
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 459 transition count 379
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 457 transition count 377
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 457 transition count 377
Applied a total of 26 rules in 21 ms. Remains 457 /470 variables (removed 13) and now considering 377/390 (removed 13) transitions.
// Phase 1: matrix 377 rows 457 cols
[2024-06-01 07:09:37] [INFO ] Computed 96 invariants in 2 ms
[2024-06-01 07:09:37] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-06-01 07:09:37] [INFO ] Invariant cache hit.
[2024-06-01 07:09:38] [INFO ] Implicit Places using invariants and state equation in 627 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 899 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 377/390 transitions.
Applied a total of 0 rules in 15 ms. Remains 456 /456 variables (removed 0) and now considering 377/377 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 936 ms. Remains : 456/470 places, 377/390 transitions.
Stuttering acceptance computed with spot in 259 ms :[p2, (AND p1 p2 (NOT p0)), p2, true, p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 p2)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-07
Product exploration explored 100000 steps with 33299 reset in 257 ms.
Product exploration explored 100000 steps with 33449 reset in 193 ms.
Computed a total of 441 stabilizing places and 362 stable transitions
Graph (complete) has 986 edges and 456 vertex of which 455 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 441 stabilizing places and 362 stable transitions
Detected a total of 441/456 stabilizing places and 362/377 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 613 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[p2, (AND p1 p2 (NOT p0)), p2, true, p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 p2)]
Reduction of identical properties reduced properties to check from 11 to 7
RANDOM walk for 40000 steps (285 resets) in 287 ms. (138 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (54 resets) in 271 ms. (147 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (46 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
// Phase 1: matrix 377 rows 456 cols
[2024-06-01 07:09:40] [INFO ] Computed 95 invariants in 17 ms
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 220/321 variables, 48/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 128/449 variables, 42/94 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/450 variables, 1/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/450 variables, 0/95 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 373/823 variables, 450/545 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/823 variables, 0/545 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/832 variables, 5/550 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/832 variables, 0/550 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/833 variables, 1/551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/833 variables, 0/551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/833 variables, 0/551 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 833/833 variables, and 551 constraints, problems are : Problem set: 1 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/96 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 225/321 variables, 49/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:09:40] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 4 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 3 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:09:41] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 26 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 0 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 14/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 128/449 variables, 42/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 1/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/450 variables, 1/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/450 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 373/823 variables, 450/560 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/823 variables, 1/561 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 3 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/823 variables, 5/566 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/823 variables, 0/566 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 9/832 variables, 5/571 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/832 variables, 7/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/832 variables, 0/578 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/833 variables, 1/579 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/833 variables, 0/579 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/833 variables, 0/579 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 833/833 variables, and 579 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3309 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 27/27 constraints]
After SMT, in 3621ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 64 ms.
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 377/377 transitions.
Graph (trivial) has 205 edges and 456 vertex of which 6 / 456 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 979 edges and 451 vertex of which 450 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 450 transition count 323
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 404 transition count 323
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 94 place count 404 transition count 226
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 306 place count 289 transition count 226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 307 place count 288 transition count 225
Iterating global reduction 2 with 1 rules applied. Total rules applied 308 place count 288 transition count 225
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 552 place count 164 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 554 place count 163 transition count 109
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 556 place count 163 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 558 place count 161 transition count 107
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 559 place count 161 transition count 107
Applied a total of 559 rules in 55 ms. Remains 161 /456 variables (removed 295) and now considering 107/377 (removed 270) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 161/456 places, 107/377 transitions.
RANDOM walk for 151 steps (5 resets) in 5 ms. (25 steps per ms) remains 0/1 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 p1))), (X (NOT (AND p0 p2))), (X (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) (NOT p2))), (G (OR (NOT p0) (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1), (F p2), (F (NOT p0))]
Knowledge based reduction with 25 factoid took 2666 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Stuttering acceptance computed with spot in 333 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Support contains 3 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 377/377 transitions.
Applied a total of 0 rules in 8 ms. Remains 456 /456 variables (removed 0) and now considering 377/377 (removed 0) transitions.
[2024-06-01 07:09:47] [INFO ] Invariant cache hit.
[2024-06-01 07:09:47] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-06-01 07:09:47] [INFO ] Invariant cache hit.
[2024-06-01 07:09:48] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2024-06-01 07:09:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (OVERLAPS) 1/456 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 60 places in 296 ms of which 5 ms to minimize.
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 3 ms to minimize.
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 58 places in 182 ms of which 5 ms to minimize.
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 2 ms to minimize.
[2024-06-01 07:10:04] [INFO ] Deduced a trap composed of 58 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 88 places in 179 ms of which 4 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 82 places in 173 ms of which 3 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 60 places in 178 ms of which 4 ms to minimize.
[2024-06-01 07:10:05] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 6 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 82 places in 166 ms of which 5 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 81 places in 122 ms of which 3 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 6 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 4 ms to minimize.
[2024-06-01 07:10:06] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 2 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 80 places in 192 ms of which 2 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 85 places in 171 ms of which 6 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2024-06-01 07:10:07] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 2 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 83 places in 114 ms of which 2 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 80 places in 182 ms of which 7 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 4 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 75 places in 184 ms of which 2 ms to minimize.
[2024-06-01 07:10:08] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 3 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 2 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 80 places in 158 ms of which 8 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 2 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 82 places in 161 ms of which 2 ms to minimize.
[2024-06-01 07:10:09] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 85 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 3 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 2 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:10:10] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 2 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 2 ms to minimize.
Problem TDEAD333 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 20/135 constraints. Problems are: Problem set: 6 solved, 370 unsolved
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 65 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 2 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:10:11] [INFO ] Deduced a trap composed of 83 places in 143 ms of which 3 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 82 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 4 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 63 places in 156 ms of which 2 ms to minimize.
[2024-06-01 07:10:12] [INFO ] Deduced a trap composed of 82 places in 133 ms of which 3 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 82 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 5 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2024-06-01 07:10:13] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 78 places in 148 ms of which 2 ms to minimize.
[2024-06-01 07:10:14] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 20/155 constraints. Problems are: Problem set: 6 solved, 370 unsolved
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 62 places in 201 ms of which 3 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 2 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 60 places in 166 ms of which 3 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:10:17] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 81 places in 170 ms of which 5 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 3 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 3 ms to minimize.
[2024-06-01 07:10:18] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 2 ms to minimize.
SMT process timed out in 30192ms, After SMT, problems are : Problem set: 6 solved, 370 unsolved
Search for dead transitions found 6 dead transitions in 30197ms
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 LTL mode, iteration 1 : 456/456 places, 371/377 transitions.
Applied a total of 0 rules in 9 ms. Remains 456 /456 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31524 ms. Remains : 456/456 places, 371/377 transitions.
Computed a total of 441 stabilizing places and 356 stable transitions
Graph (complete) has 974 edges and 456 vertex of which 455 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 441 stabilizing places and 356 stable transitions
Detected a total of 441/456 stabilizing places and 356/371 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND p2 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 853 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 6717 steps (47 resets) in 35 ms. (186 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND p2 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p1)))), (F p1), (F (NOT (OR p2 (NOT p1)))), (F p2), (F (NOT (OR p2 p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 1988 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Stuttering acceptance computed with spot in 259 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Stuttering acceptance computed with spot in 217 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Product exploration explored 100000 steps with 33194 reset in 178 ms.
Product exploration explored 100000 steps with 33408 reset in 159 ms.
Applying partial POR strategy [true, true, false, true, true, true]
Stuttering acceptance computed with spot in 221 ms :[p2, (AND p1 p2), (OR (AND (NOT p0) p2) (AND p1 p2)), true, p1, (AND p1 p2)]
Support contains 3 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 371/371 transitions.
Graph (trivial) has 203 edges and 456 vertex of which 6 / 456 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 968 edges and 451 vertex of which 450 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 450 transition count 364
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 68 Pre rules applied. Total rules applied 47 place count 450 transition count 413
Deduced a syphon composed of 113 places in 0 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 115 place count 450 transition count 413
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 131 place count 434 transition count 382
Deduced a syphon composed of 97 places in 1 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 147 place count 434 transition count 382
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 245 places in 0 ms
Iterating global reduction 1 with 148 rules applied. Total rules applied 295 place count 434 transition count 382
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 329 place count 400 transition count 348
Deduced a syphon composed of 211 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 363 place count 400 transition count 348
Deduced a syphon composed of 211 places in 0 ms
Applied a total of 363 rules in 83 ms. Remains 400 /456 variables (removed 56) and now considering 348/371 (removed 23) transitions.
[2024-06-01 07:10:23] [INFO ] Redundant transitions in 15 ms returned []
Running 347 sub problems to find dead transitions.
// Phase 1: matrix 348 rows 400 cols
[2024-06-01 07:10:23] [INFO ] Computed 97 invariants in 5 ms
[2024-06-01 07:10:23] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 54/95 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 347 unsolved
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 4 ms to minimize.
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 2 ms to minimize.
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:10:30] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 3 ms to minimize.
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 3 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 3 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-06-01 07:10:31] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 14 places in 174 ms of which 3 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 14 places in 164 ms of which 5 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 4 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 38 places in 163 ms of which 4 ms to minimize.
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 3 ms to minimize.
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-06-01 07:10:32] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 2 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 3 places in 163 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
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/117 constraints. Problems are: Problem set: 149 solved, 198 unsolved
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
[2024-06-01 07:10:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
Problem TDEAD37 is UNSAT
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
Problem TDEAD38 is UNSAT
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
Problem TDEAD39 is UNSAT
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
Problem TDEAD42 is UNSAT
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Problem TDEAD52 is UNSAT
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD54 is UNSAT
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Problem TDEAD55 is UNSAT
[2024-06-01 07:10:34] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 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 TDEAD98 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/137 constraints. Problems are: Problem set: 195 solved, 152 unsolved
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 38 places in 172 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
Problem TDEAD59 is UNSAT
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 0 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD63 is UNSAT
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-06-01 07:10:35] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 2 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
Problem TDEAD72 is UNSAT
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
Problem TDEAD73 is UNSAT
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
Problem TDEAD79 is UNSAT
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 4 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:10:36] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD297 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/157 constraints. Problems are: Problem set: 232 solved, 115 unsolved
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
[2024-06-01 07:10:37] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 4 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 5 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 4 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 4 ms to minimize.
[2024-06-01 07:10:38] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 7 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 3 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 14 places in 159 ms of which 4 ms to minimize.
Problem TDEAD107 is UNSAT
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD125 is UNSAT
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
Problem TDEAD133 is UNSAT
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:10:39] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 3 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 4 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 3 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 2 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 2 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 20/177 constraints. Problems are: Problem set: 238 solved, 109 unsolved
[2024-06-01 07:10:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 3 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 3 ms to minimize.
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 38 places in 116 ms of which 2 ms to minimize.
Problem TDEAD139 is UNSAT
Problem TDEAD145 is UNSAT
[2024-06-01 07:10:41] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 4 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 7 ms to minimize.
Problem TDEAD150 is UNSAT
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 3 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 ms to minimize.
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 2 ms to minimize.
Problem TDEAD163 is UNSAT
[2024-06-01 07:10:42] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 2 ms to minimize.
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
Problem TDEAD187 is UNSAT
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
Problem TDEAD193 is UNSAT
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
Problem TDEAD195 is UNSAT
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:10:43] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 2 ms to minimize.
Problem TDEAD139 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD275 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 20/197 constraints. Problems are: Problem set: 249 solved, 98 unsolved
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 39 places in 142 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 3 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 3 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 2 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 36 places in 144 ms of which 3 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 5 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 12/209 constraints. Problems are: Problem set: 249 solved, 98 unsolved
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:10:47] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 4 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-06-01 07:10:48] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 7/216 constraints. Problems are: Problem set: 249 solved, 98 unsolved
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 37 places in 140 ms of which 2 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 36 places in 172 ms of which 4 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 2 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 5 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 4 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 37 places in 162 ms of which 5 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 2 ms to minimize.
[2024-06-01 07:10:50] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 6 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 8 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 38 places in 170 ms of which 5 ms to minimize.
[2024-06-01 07:10:51] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 11/227 constraints. Problems are: Problem set: 249 solved, 98 unsolved
[2024-06-01 07:10:52] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 9 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 6 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 38 places in 173 ms of which 6 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 7 ms to minimize.
[2024-06-01 07:10:53] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/748 variables, and 232 constraints, problems are : Problem set: 249 solved, 98 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/400 constraints, ReadFeed: 0/12 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 135/135 constraints]
Escalating to Integer solving :Problem set: 249 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 249 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 163/354 variables, 54/54 constraints. Problems are: Problem set: 249 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 135/189 constraints. Problems are: Problem set: 249 solved, 98 unsolved
[2024-06-01 07:10:57] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 1 ms to minimize.
[2024-06-01 07:10:58] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2024-06-01 07:10:59] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 4 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 36 places in 113 ms of which 2 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 3 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:11:00] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 16/205 constraints. Problems are: Problem set: 249 solved, 98 unsolved
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 2 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 3/208 constraints. Problems are: Problem set: 249 solved, 98 unsolved
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/209 constraints. Problems are: Problem set: 249 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/209 constraints. Problems are: Problem set: 249 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 46/400 variables, 43/252 constraints. Problems are: Problem set: 249 solved, 98 unsolved
[2024-06-01 07:11:03] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 5 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 6 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 2 ms to minimize.
[2024-06-01 07:11:04] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 5/257 constraints. Problems are: Problem set: 249 solved, 98 unsolved
[2024-06-01 07:11:05] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 1/258 constraints. Problems are: Problem set: 249 solved, 98 unsolved
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 6 ms to minimize.
[2024-06-01 07:11:06] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 2/260 constraints. Problems are: Problem set: 249 solved, 98 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/260 constraints. Problems are: Problem set: 249 solved, 98 unsolved
Problem TDEAD116 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
At refinement iteration 12 (OVERLAPS) 347/747 variables, 400/660 constraints. Problems are: Problem set: 253 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/747 variables, 11/671 constraints. Problems are: Problem set: 253 solved, 94 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/747 variables, 94/765 constraints. Problems are: Problem set: 253 solved, 94 unsolved
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:11:13] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/747 variables, 2/767 constraints. Problems are: Problem set: 253 solved, 94 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 747/748 variables, and 767 constraints, problems are : Problem set: 253 solved, 94 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 400/400 constraints, ReadFeed: 11/12 constraints, PredecessorRefiner: 94/347 constraints, Known Traps: 165/165 constraints]
After SMT, in 60311ms problems are : Problem set: 253 solved, 94 unsolved
Search for dead transitions found 253 dead transitions in 60317ms
Found 253 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 253 transitions
Dead transitions reduction (with SMT) removed 253 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 400/456 places, 95/371 transitions.
Graph (complete) has 717 edges and 400 vertex of which 189 are kept as prefixes of interest. Removing 211 places using SCC suffix rule.4 ms
Discarding 211 places :
Also discarding 0 output transitions
Ensure Unique test removed 33 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 156 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 156 transition count 107
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 15 ms. Remains 156 /400 variables (removed 244) and now considering 107/95 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 156/456 places, 107/371 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60440 ms. Remains : 156/456 places, 107/371 transitions.
Support contains 3 out of 456 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 456/456 places, 371/371 transitions.
Applied a total of 0 rules in 33 ms. Remains 456 /456 variables (removed 0) and now considering 371/371 (removed 0) transitions.
// Phase 1: matrix 371 rows 456 cols
[2024-06-01 07:11:24] [INFO ] Computed 97 invariants in 6 ms
[2024-06-01 07:11:24] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-06-01 07:11:24] [INFO ] Invariant cache hit.
[2024-06-01 07:11:25] [INFO ] Implicit Places using invariants and state equation in 620 ms returned [381]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 970 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 455/456 places, 371/371 transitions.
Applied a total of 0 rules in 7 ms. Remains 455 /455 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1013 ms. Remains : 455/456 places, 371/371 transitions.
Treatment of property BusinessProcesses-PT-12-LTLFireability-07 finished in 107841 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(((p0||(G(p1)&&F(p2)))&&(p2||G(p0)))))'
Support contains 3 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 390/390 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 459 transition count 379
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 459 transition count 379
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 458 transition count 378
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 458 transition count 378
Applied a total of 24 rules in 40 ms. Remains 458 /470 variables (removed 12) and now considering 378/390 (removed 12) transitions.
// Phase 1: matrix 378 rows 458 cols
[2024-06-01 07:11:25] [INFO ] Computed 96 invariants in 5 ms
[2024-06-01 07:11:25] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-06-01 07:11:25] [INFO ] Invariant cache hit.
[2024-06-01 07:11:26] [INFO ] Implicit Places using invariants and state equation in 583 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 862 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 457/470 places, 378/390 transitions.
Applied a total of 0 rules in 6 ms. Remains 457 /457 variables (removed 0) and now considering 378/378 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 908 ms. Remains : 457/470 places, 378/390 transitions.
Stuttering acceptance computed with spot in 254 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-09 finished in 1190 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(F(p0))))'
Support contains 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 390/390 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 456 transition count 376
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 456 transition count 376
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 454 transition count 374
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 454 transition count 374
Applied a total of 32 rules in 22 ms. Remains 454 /470 variables (removed 16) and now considering 374/390 (removed 16) transitions.
// Phase 1: matrix 374 rows 454 cols
[2024-06-01 07:11:26] [INFO ] Computed 96 invariants in 4 ms
[2024-06-01 07:11:26] [INFO ] Implicit Places using invariants in 252 ms returned []
[2024-06-01 07:11:26] [INFO ] Invariant cache hit.
[2024-06-01 07:11:27] [INFO ] Implicit Places using invariants and state equation in 520 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 788 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/470 places, 374/390 transitions.
Applied a total of 0 rules in 8 ms. Remains 453 /453 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 819 ms. Remains : 453/470 places, 374/390 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-10
Stuttering criterion allowed to conclude after 132 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-10 finished in 950 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(p1)||p0))) U p2)&&X(p3)))'
Support contains 6 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 390/390 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 457 transition count 377
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 457 transition count 377
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 455 transition count 375
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 455 transition count 375
Applied a total of 30 rules in 35 ms. Remains 455 /470 variables (removed 15) and now considering 375/390 (removed 15) transitions.
// Phase 1: matrix 375 rows 455 cols
[2024-06-01 07:11:27] [INFO ] Computed 96 invariants in 4 ms
[2024-06-01 07:11:27] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-06-01 07:11:27] [INFO ] Invariant cache hit.
[2024-06-01 07:11:28] [INFO ] Implicit Places using invariants and state equation in 565 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 884 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/470 places, 375/390 transitions.
Applied a total of 0 rules in 8 ms. Remains 454 /454 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 928 ms. Remains : 454/470 places, 375/390 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p2) (NOT p3)), (NOT p3), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-12
Entered a terminal (fully accepting) state of product in 6 steps with 2 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-12 finished in 1255 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(p0)||G(p1))))'
Support contains 5 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 390/390 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 457 transition count 377
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 457 transition count 377
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 455 transition count 375
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 455 transition count 375
Applied a total of 30 rules in 31 ms. Remains 455 /470 variables (removed 15) and now considering 375/390 (removed 15) transitions.
// Phase 1: matrix 375 rows 455 cols
[2024-06-01 07:11:28] [INFO ] Computed 96 invariants in 20 ms
[2024-06-01 07:11:28] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-06-01 07:11:28] [INFO ] Invariant cache hit.
[2024-06-01 07:11:29] [INFO ] Implicit Places using invariants and state equation in 595 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 835 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/470 places, 375/390 transitions.
Applied a total of 0 rules in 9 ms. Remains 454 /454 variables (removed 0) and now considering 375/375 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 875 ms. Remains : 454/470 places, 375/390 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-13 finished in 1115 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(p0)||(X(G(p1)) U (p2&&F(p3)))))'
Support contains 4 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 390/390 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 460 transition count 380
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 460 transition count 380
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 459 transition count 379
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 459 transition count 379
Applied a total of 22 rules in 40 ms. Remains 459 /470 variables (removed 11) and now considering 379/390 (removed 11) transitions.
// Phase 1: matrix 379 rows 459 cols
[2024-06-01 07:11:29] [INFO ] Computed 96 invariants in 7 ms
[2024-06-01 07:11:30] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-06-01 07:11:30] [INFO ] Invariant cache hit.
[2024-06-01 07:11:30] [INFO ] Implicit Places using invariants and state equation in 639 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 987 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 458/470 places, 379/390 transitions.
Applied a total of 0 rules in 8 ms. Remains 458 /458 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1037 ms. Remains : 458/470 places, 379/390 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), true, (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-15
Entered a terminal (fully accepting) state of product in 99177 steps with 723 reset in 295 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-15 finished in 1644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X((F(!p1)||G(p0)))) U X(G(!p2))))'
Found a Lengthening insensitive property : BusinessProcesses-PT-12-LTLFireability-07
Stuttering acceptance computed with spot in 285 ms :[p2, (AND p1 p2 (NOT p0)), p2, true, p1, (AND p1 (NOT p2) (NOT p0)), (AND p1 p2)]
Support contains 3 out of 470 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 470/470 places, 390/390 transitions.
Graph (trivial) has 216 edges and 470 vertex of which 6 / 470 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 1000 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 463 transition count 333
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 414 transition count 333
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 100 place count 414 transition count 236
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 312 place count 299 transition count 236
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 322 place count 289 transition count 226
Iterating global reduction 2 with 10 rules applied. Total rules applied 332 place count 289 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 332 place count 289 transition count 225
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 334 place count 288 transition count 225
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 572 place count 167 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 574 place count 166 transition count 112
Applied a total of 574 rules in 43 ms. Remains 166 /470 variables (removed 304) and now considering 112/390 (removed 278) transitions.
// Phase 1: matrix 112 rows 166 cols
[2024-06-01 07:11:31] [INFO ] Computed 74 invariants in 2 ms
[2024-06-01 07:11:32] [INFO ] Implicit Places using invariants in 137 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 139 ms to find 19 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 147/470 places, 112/390 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 186 ms. Remains : 147/470 places, 112/390 transitions.
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-07
Entered a terminal (fully accepting) state of product in 29 steps with 8 reset in 1 ms.
Treatment of property BusinessProcesses-PT-12-LTLFireability-07 finished in 670 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-07 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-01 07:11:32] [INFO ] Flatten gal took : 27 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 194246 ms.
ITS solved all properties within timeout

BK_STOP 1717225892223

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-12"
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-12, 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-171620399700540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-12.tgz
mv BusinessProcesses-PT-12 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 ;