Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K 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.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 16:29 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 157K 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-15-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-15-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716307312393

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 16:01:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 16:01:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 16:01:54] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2024-05-21 16:01:54] [INFO ] Transformed 630 places.
[2024-05-21 16:01:54] [INFO ] Transformed 566 transitions.
[2024-05-21 16:01:54] [INFO ] Found NUPN structural information;
[2024-05-21 16:01:54] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 299 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 15 ms
Reduce places removed 4 places and 4 transitions.
RANDOM walk for 40000 steps (273 resets) in 1595 ms. (25 steps per ms) remains 10/16 properties
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (48 resets) in 585 ms. (68 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (48 resets) in 158 ms. (251 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (48 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (40 resets) in 1161 ms. (34 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (47 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (47 resets) in 118 ms. (336 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (48 resets) in 251 ms. (158 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (54 resets) in 184 ms. (216 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (46 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (43 resets) in 227 ms. (175 steps per ms) remains 10/10 properties
// Phase 1: matrix 562 rows 626 cols
[2024-05-21 16:01:56] [INFO ] Computed 102 invariants in 31 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 177/177 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem BusinessProcesses-PT-15-ReachabilityFireability-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 352/529 variables, 61/238 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 352/590 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 1/591 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/529 variables, 0/591 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 97/626 variables, 40/631 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 97/728 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/626 variables, 0/728 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 562/1188 variables, 626/1354 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1188 variables, 0/1354 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/1188 variables, 0/1354 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1188/1188 variables, and 1354 constraints, problems are : Problem set: 1 solved, 9 unsolved in 3544 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 626/626 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem BusinessProcesses-PT-15-ReachabilityFireability-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 375/524 variables, 61/210 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 375/585 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/524 variables, 1/586 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-21 16:02:02] [INFO ] Deduced a trap composed of 11 places in 2055 ms of which 25 ms to minimize.
[2024-05-21 16:02:02] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 3 ms to minimize.
[2024-05-21 16:02:02] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 2 ms to minimize.
[2024-05-21 16:02:02] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 4 ms to minimize.
[2024-05-21 16:02:03] [INFO ] Deduced a trap composed of 12 places in 181 ms of which 3 ms to minimize.
[2024-05-21 16:02:03] [INFO ] Deduced a trap composed of 147 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:02:03] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 6 ms to minimize.
[2024-05-21 16:02:03] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:02:03] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:02:03] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:02:03] [INFO ] Deduced a trap composed of 137 places in 164 ms of which 4 ms to minimize.
[2024-05-21 16:02:03] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 3 ms to minimize.
[2024-05-21 16:02:04] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 3 ms to minimize.
[2024-05-21 16:02:04] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 3 ms to minimize.
[2024-05-21 16:02:04] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 3 ms to minimize.
[2024-05-21 16:02:04] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 2 ms to minimize.
[2024-05-21 16:02:04] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 3 ms to minimize.
[2024-05-21 16:02:04] [INFO ] Deduced a trap composed of 28 places in 141 ms of which 3 ms to minimize.
SMT process timed out in 8887ms, After SMT, problems are : Problem set: 2 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 131 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 562/562 transitions.
Graph (complete) has 1275 edges and 626 vertex of which 622 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 622 transition count 520
Reduce places removed 41 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 59 rules applied. Total rules applied 101 place count 581 transition count 502
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 119 place count 563 transition count 502
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 119 place count 563 transition count 396
Deduced a syphon composed of 106 places in 5 ms
Ensure Unique test removed 11 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 223 rules applied. Total rules applied 342 place count 446 transition count 396
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 397 place count 391 transition count 341
Iterating global reduction 3 with 55 rules applied. Total rules applied 452 place count 391 transition count 341
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 574 place count 330 transition count 280
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 575 place count 330 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 576 place count 329 transition count 279
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 581 place count 329 transition count 279
Applied a total of 581 rules in 199 ms. Remains 329 /626 variables (removed 297) and now considering 279/562 (removed 283) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 329/626 places, 279/562 transitions.
RANDOM walk for 40000 steps (666 resets) in 546 ms. (73 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (126 resets) in 164 ms. (242 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (126 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (125 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (104 resets) in 180 ms. (221 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (128 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (129 resets) in 50 ms. (784 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (127 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (111 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 660152 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :4 out of 8
Probabilistic random walk after 660152 steps, saw 111405 distinct states, run finished after 3004 ms. (steps per millisecond=219 ) properties seen :4
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 279 rows 329 cols
[2024-05-21 16:02:08] [INFO ] Computed 88 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 159/283 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 43/326 variables, 30/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/326 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 279/605 variables, 326/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/608 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/608 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 417 constraints, problems are : Problem set: 0 solved, 4 unsolved in 735 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 159/283 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:09] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:02:09] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:02:09] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:02:09] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 2 ms to minimize.
[2024-05-21 16:02:09] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-21 16:02:09] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-21 16:02:09] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:02:10] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-05-21 16:02:10] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:02:10] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:10] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 43/326 variables, 30/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 279/605 variables, 326/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:10] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:02:10] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-05-21 16:02:10] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:02:10] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:02:11] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 5 ms to minimize.
[2024-05-21 16:02:11] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:02:11] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 6 ms to minimize.
[2024-05-21 16:02:11] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 3 ms to minimize.
[2024-05-21 16:02:11] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:02:11] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:02:11] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:02:11] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:02:12] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 3 ms to minimize.
[2024-05-21 16:02:12] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:02:12] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 3 ms to minimize.
[2024-05-21 16:02:12] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:02:12] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:02:12] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:02:12] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:02:12] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 20/446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:13] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:02:13] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:02:13] [INFO ] Deduced a trap composed of 73 places in 153 ms of which 2 ms to minimize.
[2024-05-21 16:02:13] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:02:13] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:02:13] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:02:13] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 6 ms to minimize.
[2024-05-21 16:02:14] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:02:14] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:02:14] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:02:14] [INFO ] Deduced a trap composed of 76 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:02:14] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:02:14] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 3 ms to minimize.
[2024-05-21 16:02:14] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:02:14] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:02:15] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:02:15] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:02:15] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:02:15] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:02:15] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/605 variables, 20/466 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:15] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:02:15] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:02:16] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:02:16] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:02:16] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:02:16] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:02:16] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:02:16] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:02:16] [INFO ] Deduced a trap composed of 72 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:02:17] [INFO ] Deduced a trap composed of 79 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:02:17] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:02:17] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:02:17] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:02:17] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:02:17] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 2 ms to minimize.
[2024-05-21 16:02:17] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:02:17] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:02:18] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-05-21 16:02:18] [INFO ] Deduced a trap composed of 77 places in 172 ms of which 3 ms to minimize.
[2024-05-21 16:02:18] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/605 variables, 20/486 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:18] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:02:18] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:02:18] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:02:19] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:02:19] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:02:19] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-21 16:02:19] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-21 16:02:19] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:02:19] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 3 ms to minimize.
[2024-05-21 16:02:19] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:02:19] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:02:20] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 4 ms to minimize.
[2024-05-21 16:02:20] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 2 ms to minimize.
[2024-05-21 16:02:20] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:02:20] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:02:20] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:02:20] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:02:20] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:02:20] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 4 ms to minimize.
[2024-05-21 16:02:21] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/605 variables, 20/506 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:21] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:02:21] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:02:21] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:02:21] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:02:22] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:02:22] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:02:22] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:02:22] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:02:22] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:02:22] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:02:22] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 3 ms to minimize.
[2024-05-21 16:02:22] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:02:23] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:02:23] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:02:23] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:02:23] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:02:23] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:02:23] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 3 ms to minimize.
[2024-05-21 16:02:23] [INFO ] Deduced a trap composed of 66 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:02:23] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/605 variables, 20/526 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:24] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:02:24] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:02:24] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 3 ms to minimize.
[2024-05-21 16:02:24] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:02:24] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 3 ms to minimize.
[2024-05-21 16:02:24] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:02:24] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:02:25] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2024-05-21 16:02:25] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:02:25] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:02:25] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 3 ms to minimize.
[2024-05-21 16:02:25] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:02:25] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:02:26] [INFO ] Deduced a trap composed of 84 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:02:26] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:02:26] [INFO ] Deduced a trap composed of 78 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:02:26] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:02:26] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 3 ms to minimize.
[2024-05-21 16:02:26] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:02:27] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/605 variables, 20/546 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:27] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 3 ms to minimize.
[2024-05-21 16:02:27] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:02:27] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-05-21 16:02:27] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 3 ms to minimize.
[2024-05-21 16:02:28] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 3 ms to minimize.
[2024-05-21 16:02:28] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 2 ms to minimize.
[2024-05-21 16:02:28] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 3 ms to minimize.
[2024-05-21 16:02:28] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:02:28] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:02:29] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 2 ms to minimize.
[2024-05-21 16:02:29] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:02:29] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:02:29] [INFO ] Deduced a trap composed of 76 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:02:29] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:02:29] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:02:29] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:02:30] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:02:30] [INFO ] Deduced a trap composed of 80 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:02:30] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/605 variables, 19/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/605 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/608 variables, 3/568 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/608 variables, 3/571 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:31] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 2 ms to minimize.
[2024-05-21 16:02:31] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 4 ms to minimize.
[2024-05-21 16:02:31] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 3 ms to minimize.
[2024-05-21 16:02:31] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:02:32] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:02:32] [INFO ] Deduced a trap composed of 64 places in 149 ms of which 3 ms to minimize.
[2024-05-21 16:02:32] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 2 ms to minimize.
[2024-05-21 16:02:32] [INFO ] Deduced a trap composed of 7 places in 127 ms of which 3 ms to minimize.
[2024-05-21 16:02:33] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:02:33] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 3 ms to minimize.
[2024-05-21 16:02:33] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:02:33] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:02:34] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:02:34] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:02:34] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:02:34] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:02:35] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 17/588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 0/608 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 588 constraints, problems are : Problem set: 0 solved, 4 unsolved in 27410 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 167/167 constraints]
After SMT, in 28190ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1618 ms.
Support contains 124 out of 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 279/279 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 329 transition count 277
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 327 transition count 277
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 327 transition count 276
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 6 place count 326 transition count 276
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 18 place count 320 transition count 270
Applied a total of 18 rules in 30 ms. Remains 320 /329 variables (removed 9) and now considering 270/279 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 320/329 places, 270/279 transitions.
RANDOM walk for 40000 steps (697 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (134 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (113 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (131 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (117 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 577153 steps, run timeout after 3001 ms. (steps per millisecond=192 ) properties seen :0 out of 4
Probabilistic random walk after 577153 steps, saw 95828 distinct states, run finished after 3001 ms. (steps per millisecond=192 ) properties seen :0
// Phase 1: matrix 270 rows 320 cols
[2024-05-21 16:02:41] [INFO ] Computed 88 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 156/280 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 37/317 variables, 29/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 270/587 variables, 317/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/590 variables, 3/408 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/590 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/590 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 590/590 variables, and 408 constraints, problems are : Problem set: 0 solved, 4 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 156/280 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:42] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:02:42] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:02:42] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:02:42] [INFO ] Deduced a trap composed of 67 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:02:42] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:02:42] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:02:42] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 16:02:42] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:02:43] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:02:43] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:02:43] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:02:43] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:02:43] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:02:43] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 1 ms to minimize.
[2024-05-21 16:02:43] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:02:43] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:02:43] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:02:43] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:02:43] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:02:44] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:44] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-21 16:02:44] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 37/317 variables, 29/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:44] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 270/587 variables, 317/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:44] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 2 ms to minimize.
[2024-05-21 16:02:44] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:02:44] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:02:45] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:02:45] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:02:45] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-21 16:02:45] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:02:45] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 3 ms to minimize.
[2024-05-21 16:02:45] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:02:45] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:02:45] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:02:46] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:02:46] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:02:46] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 2 ms to minimize.
[2024-05-21 16:02:46] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:02:46] [INFO ] Deduced a trap composed of 62 places in 141 ms of which 5 ms to minimize.
[2024-05-21 16:02:46] [INFO ] Deduced a trap composed of 63 places in 163 ms of which 5 ms to minimize.
[2024-05-21 16:02:47] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:02:47] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:02:47] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/587 variables, 20/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:47] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:02:47] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:02:47] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 3 ms to minimize.
[2024-05-21 16:02:47] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 2 ms to minimize.
[2024-05-21 16:02:48] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:02:48] [INFO ] Deduced a trap composed of 70 places in 91 ms of which 2 ms to minimize.
[2024-05-21 16:02:48] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:02:48] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:02:48] [INFO ] Deduced a trap composed of 60 places in 124 ms of which 3 ms to minimize.
[2024-05-21 16:02:48] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:02:48] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:02:48] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:02:49] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:02:49] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 3 ms to minimize.
[2024-05-21 16:02:49] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:02:49] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 3 ms to minimize.
[2024-05-21 16:02:49] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:02:49] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 3 ms to minimize.
[2024-05-21 16:02:49] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 2 ms to minimize.
[2024-05-21 16:02:50] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/587 variables, 20/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:50] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 2 ms to minimize.
[2024-05-21 16:02:50] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2024-05-21 16:02:50] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-21 16:02:50] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:02:50] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:02:50] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 2 ms to minimize.
[2024-05-21 16:02:51] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2024-05-21 16:02:51] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 3 ms to minimize.
[2024-05-21 16:02:51] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:02:51] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:02:51] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:02:51] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:02:51] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:02:51] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:02:52] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
[2024-05-21 16:02:52] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:02:52] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 2 ms to minimize.
[2024-05-21 16:02:52] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:02:52] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:02:52] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/587 variables, 20/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:52] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:02:53] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:02:53] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 2 ms to minimize.
[2024-05-21 16:02:53] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 3 ms to minimize.
[2024-05-21 16:02:53] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 2 ms to minimize.
[2024-05-21 16:02:53] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:02:53] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 2 ms to minimize.
[2024-05-21 16:02:53] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 2 ms to minimize.
[2024-05-21 16:02:54] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:02:54] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 3 ms to minimize.
[2024-05-21 16:02:54] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:02:54] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 3 ms to minimize.
[2024-05-21 16:02:54] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:02:54] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-05-21 16:02:55] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 2 ms to minimize.
[2024-05-21 16:02:55] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 2 ms to minimize.
[2024-05-21 16:02:55] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
[2024-05-21 16:02:55] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 2 ms to minimize.
[2024-05-21 16:02:55] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-05-21 16:02:55] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/587 variables, 20/509 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:56] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/587 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/587 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 3/590 variables, 3/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/590 variables, 3/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:02:56] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:02:57] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 3 ms to minimize.
[2024-05-21 16:02:57] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:02:57] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
[2024-05-21 16:02:57] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2024-05-21 16:02:57] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 3 ms to minimize.
[2024-05-21 16:02:57] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:02:58] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 3 ms to minimize.
[2024-05-21 16:02:58] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 2 ms to minimize.
[2024-05-21 16:02:58] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 2 ms to minimize.
[2024-05-21 16:02:58] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:02:58] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 2 ms to minimize.
[2024-05-21 16:02:59] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 2 ms to minimize.
[2024-05-21 16:02:59] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 2 ms to minimize.
[2024-05-21 16:02:59] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 2 ms to minimize.
[2024-05-21 16:02:59] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-21 16:02:59] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
[2024-05-21 16:03:00] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/590 variables, 18/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/590 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 16:03:01] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 3 ms to minimize.
[2024-05-21 16:03:01] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 3 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/590 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/590 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/590 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 590/590 variables, and 536 constraints, problems are : Problem set: 0 solved, 4 unsolved in 20395 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 124/124 constraints]
After SMT, in 20932ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 1135 ms.
Support contains 67 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 270/270 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 320 transition count 262
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 312 transition count 260
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 310 transition count 260
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 20 place count 310 transition count 239
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 67 place count 284 transition count 239
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 73 place count 278 transition count 233
Iterating global reduction 3 with 6 rules applied. Total rules applied 79 place count 278 transition count 233
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 125 place count 255 transition count 210
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 255 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 253 transition count 208
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 253 transition count 208
Applied a total of 130 rules in 48 ms. Remains 253 /320 variables (removed 67) and now considering 208/270 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 253/320 places, 208/270 transitions.
RANDOM walk for 40000 steps (1075 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (235 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (200 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (245 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 887544 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :1 out of 3
Probabilistic random walk after 887544 steps, saw 141660 distinct states, run finished after 3001 ms. (steps per millisecond=295 ) properties seen :1
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 208 rows 253 cols
[2024-05-21 16:03:07] [INFO ] Computed 83 invariants in 5 ms
[2024-05-21 16:03:07] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 118/164 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 46/210 variables, 24/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 39/249 variables, 23/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/251 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 208/459 variables, 251/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/461 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/461 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/461 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 339 constraints, problems are : Problem set: 0 solved, 2 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 118/164 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:03:07] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:03:07] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:03:07] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 46/210 variables, 24/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 39/249 variables, 23/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:03:07] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:03:07] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/249 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/251 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 208/459 variables, 251/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/459 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/461 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:03:08] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 3 ms to minimize.
[2024-05-21 16:03:08] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-05-21 16:03:08] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:03:08] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:03:08] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:03:08] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-21 16:03:08] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/461 variables, 7/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:03:09] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/461 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:03:09] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 2 ms to minimize.
[2024-05-21 16:03:09] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/461 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/461 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:03:09] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/461 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 16:03:10] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/461 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/461 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/461 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 358 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3138 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 253/253 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 3398ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 452 ms.
Support contains 46 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 208/208 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 253 transition count 204
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 249 transition count 204
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 249 transition count 202
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 247 transition count 202
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 244 transition count 199
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 244 transition count 199
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 55 place count 225 transition count 181
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 224 transition count 180
Applied a total of 56 rules in 66 ms. Remains 224 /253 variables (removed 29) and now considering 180/208 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 224/253 places, 180/208 transitions.
RANDOM walk for 40000 steps (1458 resets) in 219 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (283 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (319 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1129319 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :1 out of 2
Probabilistic random walk after 1129319 steps, saw 182788 distinct states, run finished after 3002 ms. (steps per millisecond=376 ) properties seen :1
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 180 rows 224 cols
[2024-05-21 16:03:14] [INFO ] Computed 82 invariants in 6 ms
[2024-05-21 16:03:14] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/138 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/173 variables, 21/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 42/215 variables, 24/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/216 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 180/396 variables, 216/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 4/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/404 variables, 8/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 3/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/404 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/404 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 224/224 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 94/138 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:03:14] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 35/173 variables, 21/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 42/215 variables, 24/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/216 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 180/396 variables, 216/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/404 variables, 8/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/404 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/404 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:03:14] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2024-05-21 16:03:14] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/404 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/404 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/404 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 676 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 224/224 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 954ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 44 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 224 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 223 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 223 transition count 178
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 221 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 220 transition count 177
Applied a total of 7 rules in 24 ms. Remains 220 /224 variables (removed 4) and now considering 177/180 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 220/224 places, 177/180 transitions.
RANDOM walk for 40000 steps (1442 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (269 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1250160 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :0 out of 1
Probabilistic random walk after 1250160 steps, saw 209655 distinct states, run finished after 3001 ms. (steps per millisecond=416 ) properties seen :0
// Phase 1: matrix 177 rows 220 cols
[2024-05-21 16:03:18] [INFO ] Computed 81 invariants in 3 ms
[2024-05-21 16:03:18] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 97/141 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/175 variables, 21/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/212 variables, 22/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 177/389 variables, 212/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 4/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 8/397 variables, 8/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/397 variables, 3/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/397 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 220/220 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 97/141 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:03:18] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:03:18] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 34/175 variables, 21/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 37/212 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 177/389 variables, 212/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:03:18] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/397 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 3/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/397 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:03:19] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/397 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/397 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/397 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 739 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 220/220 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 976ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 84 ms.
Support contains 44 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 177/177 transitions.
Applied a total of 0 rules in 8 ms. Remains 220 /220 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 220/220 places, 177/177 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 177/177 transitions.
Applied a total of 0 rules in 7 ms. Remains 220 /220 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2024-05-21 16:03:19] [INFO ] Invariant cache hit.
[2024-05-21 16:03:19] [INFO ] Implicit Places using invariants in 141 ms returned [24, 26, 31, 36, 38, 40, 42, 63, 65, 179, 189]
[2024-05-21 16:03:19] [INFO ] Actually due to overlaps returned [24, 31, 36, 40, 63, 179, 189]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 151 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 213/220 places, 177/177 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 208 transition count 169
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 208 transition count 169
Applied a total of 10 rules in 10 ms. Remains 208 /213 variables (removed 5) and now considering 169/177 (removed 8) transitions.
// Phase 1: matrix 169 rows 208 cols
[2024-05-21 16:03:19] [INFO ] Computed 74 invariants in 1 ms
[2024-05-21 16:03:19] [INFO ] Implicit Places using invariants in 123 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 124 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/220 places, 169/177 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 205 transition count 164
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 205 transition count 164
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 205 transition count 164
Applied a total of 10 rules in 18 ms. Remains 205 /207 variables (removed 2) and now considering 164/169 (removed 5) transitions.
// Phase 1: matrix 164 rows 205 cols
[2024-05-21 16:03:19] [INFO ] Computed 73 invariants in 1 ms
[2024-05-21 16:03:19] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 16:03:19] [INFO ] Invariant cache hit.
[2024-05-21 16:03:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-21 16:03:20] [INFO ] Implicit Places using invariants and state equation in 275 ms returned [135, 137, 139]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 391 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 202/220 places, 164/177 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 202 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 201 transition count 163
Applied a total of 2 rules in 9 ms. Remains 201 /202 variables (removed 1) and now considering 163/164 (removed 1) transitions.
// Phase 1: matrix 163 rows 201 cols
[2024-05-21 16:03:20] [INFO ] Computed 70 invariants in 2 ms
[2024-05-21 16:03:20] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 16:03:20] [INFO ] Invariant cache hit.
[2024-05-21 16:03:20] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:03:20] [INFO ] Implicit Places using invariants and state equation in 267 ms returned [53, 54, 55, 56, 57, 61]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 363 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 195/220 places, 163/177 transitions.
Applied a total of 0 rules in 6 ms. Remains 195 /195 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 1081 ms. Remains : 195/220 places, 163/177 transitions.
RANDOM walk for 40000 steps (1480 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (282 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1518962 steps, run timeout after 3001 ms. (steps per millisecond=506 ) properties seen :0 out of 1
Probabilistic random walk after 1518962 steps, saw 234189 distinct states, run finished after 3001 ms. (steps per millisecond=506 ) properties seen :0
// Phase 1: matrix 163 rows 195 cols
[2024-05-21 16:03:23] [INFO ] Computed 64 invariants in 4 ms
[2024-05-21 16:03:23] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/144 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 28/172 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/190 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 163/353 variables, 190/254 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 5/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/358 variables, 5/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/358 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 358/358 variables, and 264 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 195/195 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 100/144 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:03:23] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/172 variables, 15/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/190 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 163/353 variables, 190/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 5/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:03:24] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:03:24] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:03:24] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:03:24] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:03:24] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:03:24] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:03:24] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:03:24] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:03:24] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:03:24] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:03:24] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:03:24] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:03:25] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:03:25] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:03:25] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:03:25] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 2 ms to minimize.
[2024-05-21 16:03:25] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:03:25] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:03:25] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:03:25] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 20/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:03:25] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 2 ms to minimize.
[2024-05-21 16:03:25] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 2 ms to minimize.
[2024-05-21 16:03:25] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:03:25] [INFO ] Deduced a trap composed of 56 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:03:25] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:03:26] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:03:26] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:03:26] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:03:26] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:03:26] [INFO ] Deduced a trap composed of 57 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:03:26] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 11/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/353 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/358 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/358 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/358 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 358/358 variables, and 297 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3145 ms.
Refiners :[Positive P Invariants (semi-flows): 49/49 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 195/195 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 32/32 constraints]
After SMT, in 3363ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 44 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 163/163 transitions.
Applied a total of 0 rules in 5 ms. Remains 195 /195 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 195/195 places, 163/163 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 163/163 transitions.
Applied a total of 0 rules in 7 ms. Remains 195 /195 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-05-21 16:03:26] [INFO ] Invariant cache hit.
[2024-05-21 16:03:27] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 16:03:27] [INFO ] Invariant cache hit.
[2024-05-21 16:03:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-21 16:03:27] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-05-21 16:03:27] [INFO ] Redundant transitions in 4 ms returned []
Running 160 sub problems to find dead transitions.
[2024-05-21 16:03:27] [INFO ] Invariant cache hit.
[2024-05-21 16:03:27] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 3/195 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-05-21 16:03:28] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:03:29] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:03:29] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:03:29] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 2 ms to minimize.
[2024-05-21 16:03:29] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 2 ms to minimize.
[2024-05-21 16:03:29] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:03:29] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:03:29] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:03:29] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-05-21 16:03:29] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:03:29] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:03:29] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:03:29] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:03:29] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:03:29] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:03:29] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:03:30] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:03:30] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:03:30] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 2 ms to minimize.
[2024-05-21 16:03:30] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 20/84 constraints. Problems are: Problem set: 4 solved, 156 unsolved
[2024-05-21 16:03:30] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:03:30] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:03:30] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:03:30] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 2 ms to minimize.
[2024-05-21 16:03:30] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:03:30] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:03:30] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:03:30] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 2 ms to minimize.
[2024-05-21 16:03:30] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:03:31] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:03:31] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:03:31] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:03:31] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 2 ms to minimize.
[2024-05-21 16:03:31] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-21 16:03:31] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:03:31] [INFO ] Deduced a trap composed of 55 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:03:31] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:03:31] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:03:31] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:03:31] [INFO ] Deduced a trap composed of 55 places in 56 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD140 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 20/104 constraints. Problems are: Problem set: 12 solved, 148 unsolved
[2024-05-21 16:03:31] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-21 16:03:31] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 16:03:32] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:03:32] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:03:32] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:03:32] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 2 ms to minimize.
[2024-05-21 16:03:32] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-21 16:03:32] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:03:32] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:03:32] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:03:32] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:03:32] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:03:32] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:03:32] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:03:32] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:03:33] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-05-21 16:03:33] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:03:33] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:03:33] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:03:33] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 20/124 constraints. Problems are: Problem set: 12 solved, 148 unsolved
[2024-05-21 16:03:34] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-05-21 16:03:34] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:03:34] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:03:34] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2024-05-21 16:03:34] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:03:34] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:03:34] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 2 ms to minimize.
[2024-05-21 16:03:34] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:03:34] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 1 ms to minimize.
[2024-05-21 16:03:34] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-21 16:03:35] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:03:35] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-05-21 16:03:35] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-21 16:03:35] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:03:35] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 3 ms to minimize.
[2024-05-21 16:03:35] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:03:35] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:03:35] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 1 ms to minimize.
[2024-05-21 16:03:35] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:03:35] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 20/144 constraints. Problems are: Problem set: 14 solved, 146 unsolved
[2024-05-21 16:03:35] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:03:36] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:03:36] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:03:36] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:03:36] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:03:36] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:03:36] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 2 ms to minimize.
[2024-05-21 16:03:36] [INFO ] Deduced a trap composed of 56 places in 82 ms of which 2 ms to minimize.
[2024-05-21 16:03:36] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-05-21 16:03:36] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:03:36] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
[2024-05-21 16:03:37] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:03:37] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:03:37] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:03:37] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:03:37] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:03:37] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:03:37] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:03:37] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:03:37] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 20/164 constraints. Problems are: Problem set: 15 solved, 145 unsolved
[2024-05-21 16:03:37] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:03:37] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:03:37] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:03:38] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:03:38] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:03:38] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 1 ms to minimize.
[2024-05-21 16:03:38] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:03:38] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:03:38] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:03:38] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:03:38] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:03:38] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:03:38] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:03:38] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:03:38] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:03:39] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 2 ms to minimize.
[2024-05-21 16:03:39] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:03:39] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:03:39] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2024-05-21 16:03:39] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 20/184 constraints. Problems are: Problem set: 15 solved, 145 unsolved
[2024-05-21 16:03:40] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:03:40] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 2 ms to minimize.
[2024-05-21 16:03:40] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 2 ms to minimize.
[2024-05-21 16:03:40] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:03:40] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-05-21 16:03:40] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2024-05-21 16:03:40] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:03:40] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:03:41] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/195 variables, 20/204 constraints. Problems are: Problem set: 18 solved, 142 unsolved
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 1 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
Problem TDEAD51 is UNSAT
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:03:42] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:03:43] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:03:43] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:03:43] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 1 ms to minimize.
[2024-05-21 16:03:43] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:03:43] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:03:43] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:03:43] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 20/224 constraints. Problems are: Problem set: 19 solved, 141 unsolved
[2024-05-21 16:03:43] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2024-05-21 16:03:43] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:03:43] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:03:43] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:03:44] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 2 ms to minimize.
[2024-05-21 16:03:44] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
[2024-05-21 16:03:44] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:03:44] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:03:44] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:03:44] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:03:44] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-05-21 16:03:44] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:03:44] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:03:45] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:03:45] [INFO ] Deduced a trap composed of 60 places in 61 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
[2024-05-21 16:03:45] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:03:45] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-05-21 16:03:45] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:03:45] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:03:45] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD137 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 20/244 constraints. Problems are: Problem set: 22 solved, 138 unsolved
[2024-05-21 16:03:46] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:03:46] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:03:46] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:03:46] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:03:46] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:03:46] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 2 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:03:47] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:03:48] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 20/264 constraints. Problems are: Problem set: 22 solved, 138 unsolved
[2024-05-21 16:03:48] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-05-21 16:03:48] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:03:48] [INFO ] Deduced a trap composed of 61 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:03:48] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:03:48] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:03:48] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:03:48] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 2 ms to minimize.
[2024-05-21 16:03:48] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:03:49] [INFO ] Deduced a trap composed of 53 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:03:49] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:03:49] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:03:49] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2024-05-21 16:03:49] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
Problem TDEAD53 is UNSAT
[2024-05-21 16:03:49] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2024-05-21 16:03:49] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:03:49] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 2 ms to minimize.
Problem TDEAD56 is UNSAT
[2024-05-21 16:03:49] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:03:49] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:03:50] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:03:50] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 2 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/195 variables, 20/284 constraints. Problems are: Problem set: 25 solved, 135 unsolved
[2024-05-21 16:03:50] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:03:50] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 2 ms to minimize.
[2024-05-21 16:03:50] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:03:50] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 2 ms to minimize.
[2024-05-21 16:03:50] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:03:51] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 2 ms to minimize.
[2024-05-21 16:03:51] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:03:51] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:03:51] [INFO ] Deduced a trap composed of 57 places in 52 ms of which 1 ms to minimize.
[2024-05-21 16:03:51] [INFO ] Deduced a trap composed of 51 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:03:51] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 2 ms to minimize.
[2024-05-21 16:03:51] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 2 ms to minimize.
[2024-05-21 16:03:51] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 2 ms to minimize.
Problem TDEAD62 is UNSAT
[2024-05-21 16:03:51] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:03:51] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:03:51] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:03:51] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:03:51] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-05-21 16:03:51] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:03:52] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 2 ms to minimize.
Problem TDEAD62 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/195 variables, 20/304 constraints. Problems are: Problem set: 26 solved, 134 unsolved
[2024-05-21 16:03:52] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2024-05-21 16:03:52] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-21 16:03:52] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2024-05-21 16:03:53] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 2 ms to minimize.
[2024-05-21 16:03:53] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:03:53] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:03:53] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
[2024-05-21 16:03:53] [INFO ] Deduced a trap composed of 52 places in 63 ms of which 1 ms to minimize.
[2024-05-21 16:03:53] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2024-05-21 16:03:53] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 2 ms to minimize.
[2024-05-21 16:03:54] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
[2024-05-21 16:03:54] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2024-05-21 16:03:54] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 2 ms to minimize.
[2024-05-21 16:03:54] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 2 ms to minimize.
[2024-05-21 16:03:54] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:03:54] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
[2024-05-21 16:03:54] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-05-21 16:03:54] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-21 16:03:54] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:03:54] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/195 variables, 20/324 constraints. Problems are: Problem set: 26 solved, 134 unsolved
[2024-05-21 16:03:55] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
[2024-05-21 16:03:55] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-21 16:03:55] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:03:55] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-21 16:03:55] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 2 ms to minimize.
[2024-05-21 16:03:55] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 2 ms to minimize.
[2024-05-21 16:03:55] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2024-05-21 16:03:55] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-05-21 16:03:55] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 2 ms to minimize.
[2024-05-21 16:03:55] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 2 ms to minimize.
[2024-05-21 16:03:56] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-05-21 16:03:56] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:03:56] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-05-21 16:03:56] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2024-05-21 16:03:56] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 2 ms to minimize.
[2024-05-21 16:03:56] [INFO ] Deduced a trap composed of 54 places in 69 ms of which 2 ms to minimize.
[2024-05-21 16:03:56] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-05-21 16:03:56] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2024-05-21 16:03:56] [INFO ] Deduced a trap composed of 53 places in 61 ms of which 2 ms to minimize.
[2024-05-21 16:03:56] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 1 ms to minimize.
Problem TDEAD135 is UNSAT
At refinement iteration 17 (INCLUDED_ONLY) 0/195 variables, 20/344 constraints. Problems are: Problem set: 27 solved, 133 unsolved
[2024-05-21 16:03:57] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-05-21 16:03:57] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 2 ms to minimize.
[2024-05-21 16:03:57] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 2 ms to minimize.
[2024-05-21 16:03:57] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 3 ms to minimize.
[2024-05-21 16:03:57] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
SMT process timed out in 30108ms, After SMT, problems are : Problem set: 27 solved, 133 unsolved
Search for dead transitions found 27 dead transitions in 30113ms
Found 27 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 27 transitions
Dead transitions reduction (with SMT) removed 27 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 195/195 places, 136/163 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 192 transition count 136
Applied a total of 3 rules in 7 ms. Remains 192 /195 variables (removed 3) and now considering 136/136 (removed 0) transitions.
// Phase 1: matrix 136 rows 192 cols
[2024-05-21 16:03:57] [INFO ] Computed 67 invariants in 1 ms
[2024-05-21 16:03:57] [INFO ] Implicit Places using invariants in 120 ms returned [21, 28, 180, 182]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 121 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 188/195 places, 136/163 transitions.
Applied a total of 0 rules in 5 ms. Remains 188 /188 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 30635 ms. Remains : 188/195 places, 136/163 transitions.
RANDOM walk for 40000 steps (1479 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (284 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1496877 steps, run timeout after 3001 ms. (steps per millisecond=498 ) properties seen :0 out of 1
Probabilistic random walk after 1496877 steps, saw 231044 distinct states, run finished after 3001 ms. (steps per millisecond=498 ) properties seen :0
// Phase 1: matrix 136 rows 188 cols
[2024-05-21 16:04:00] [INFO ] Computed 63 invariants in 2 ms
[2024-05-21 16:04:00] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 93/137 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 28/165 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/183 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 136/319 variables, 183/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 5/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/324 variables, 5/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/324 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 256 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 188/188 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 93/137 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:04:00] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/165 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 18/183 variables, 14/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 136/319 variables, 183/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 5/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/324 variables, 5/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/324 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 16:04:01] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/324 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/324 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 188/188 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 758ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 5461 steps, including 250 resets, run visited all 1 properties in 20 ms. (steps per millisecond=273 )
FORMULA BusinessProcesses-PT-15-ReachabilityFireability-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 30 ms.
All properties solved without resorting to model-checking.
Total runtime 127516 ms.
ITS solved all properties within timeout

BK_STOP 1716307441542

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityFireability -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-15"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BusinessProcesses-PT-15, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398500567"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-15.tgz
mv BusinessProcesses-PT-15 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;