About the Execution of GreatSPN+red for ShieldPPPt-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 11518.104 | 3600000.00 | 10560147.00 | 7345.50 | ??T?TF?????T??T? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r355-tall-171683759300671.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldPPPt-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759300671
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 762K May 18 16:43 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 ShieldPPPt-PT-040B-ReachabilityFireability-2023-00
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717024484082
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 23:14:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 23:14:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 23:14:45] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2024-05-29 23:14:45] [INFO ] Transformed 3123 places.
[2024-05-29 23:14:45] [INFO ] Transformed 2843 transitions.
[2024-05-29 23:14:45] [INFO ] Found NUPN structural information;
[2024-05-29 23:14:45] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 419 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 2479 ms. (16 steps per ms) remains 13/16 properties
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 631 ms. (63 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1004 ms. (39 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 13/13 properties
// Phase 1: matrix 2843 rows 3123 cols
[2024-05-29 23:14:47] [INFO ] Computed 441 invariants in 46 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 294/294 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 2518/2812 variables, 388/682 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2812 variables, 2518/3200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2812 variables, 0/3200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 311/3123 variables, 53/3253 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3123 variables, 311/3564 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3123 variables, 0/3564 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 2843/5966 variables, 3123/6687 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5966 variables, 0/6687 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5966/5966 variables, and 6687 constraints, problems are : Problem set: 0 solved, 13 unsolved in 5048 ms.
Refiners :[Domain max(s): 3123/3123 constraints, Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 3123/3123 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 294/294 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 2518/2812 variables, 388/682 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2812 variables, 2518/3200 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-29 23:14:54] [INFO ] Deduced a trap composed of 17 places in 482 ms of which 68 ms to minimize.
[2024-05-29 23:14:54] [INFO ] Deduced a trap composed of 28 places in 393 ms of which 8 ms to minimize.
[2024-05-29 23:14:54] [INFO ] Deduced a trap composed of 27 places in 347 ms of which 7 ms to minimize.
[2024-05-29 23:14:55] [INFO ] Deduced a trap composed of 24 places in 446 ms of which 8 ms to minimize.
[2024-05-29 23:14:55] [INFO ] Deduced a trap composed of 29 places in 433 ms of which 8 ms to minimize.
[2024-05-29 23:14:56] [INFO ] Deduced a trap composed of 17 places in 407 ms of which 8 ms to minimize.
[2024-05-29 23:14:56] [INFO ] Deduced a trap composed of 25 places in 413 ms of which 7 ms to minimize.
[2024-05-29 23:14:57] [INFO ] Deduced a trap composed of 36 places in 385 ms of which 8 ms to minimize.
[2024-05-29 23:14:57] [INFO ] Deduced a trap composed of 34 places in 377 ms of which 8 ms to minimize.
[2024-05-29 23:14:58] [INFO ] Deduced a trap composed of 34 places in 363 ms of which 7 ms to minimize.
SMT process timed out in 10689ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 294 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 538 transitions
Trivial Post-agglo rules discarded 538 transitions
Performed 538 trivial Post agglomeration. Transition count delta: 538
Iterating post reduction 0 with 538 rules applied. Total rules applied 538 place count 3123 transition count 2305
Reduce places removed 538 places and 0 transitions.
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Iterating post reduction 1 with 619 rules applied. Total rules applied 1157 place count 2585 transition count 2224
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 2 with 81 rules applied. Total rules applied 1238 place count 2504 transition count 2224
Performed 173 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 173 Pre rules applied. Total rules applied 1238 place count 2504 transition count 2051
Deduced a syphon composed of 173 places in 5 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 3 with 346 rules applied. Total rules applied 1584 place count 2331 transition count 2051
Discarding 238 places :
Symmetric choice reduction at 3 with 238 rule applications. Total rules 1822 place count 2093 transition count 1813
Iterating global reduction 3 with 238 rules applied. Total rules applied 2060 place count 2093 transition count 1813
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 2060 place count 2093 transition count 1733
Deduced a syphon composed of 80 places in 14 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 2220 place count 2013 transition count 1733
Performed 545 Post agglomeration using F-continuation condition.Transition count delta: 545
Deduced a syphon composed of 545 places in 4 ms
Reduce places removed 545 places and 0 transitions.
Iterating global reduction 3 with 1090 rules applied. Total rules applied 3310 place count 1468 transition count 1188
Renaming transitions due to excessive name length > 1024 char.
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 76 places in 3 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 3462 place count 1392 transition count 1188
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 3467 place count 1392 transition count 1183
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 3472 place count 1387 transition count 1183
Partial Free-agglomeration rule applied 97 times.
Drop transitions (Partial Free agglomeration) removed 97 transitions
Iterating global reduction 4 with 97 rules applied. Total rules applied 3569 place count 1387 transition count 1183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3570 place count 1386 transition count 1182
Applied a total of 3570 rules in 1028 ms. Remains 1386 /3123 variables (removed 1737) and now considering 1182/2843 (removed 1661) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1039 ms. Remains : 1386/3123 places, 1182/2843 transitions.
RANDOM walk for 40000 steps (8 resets) in 798 ms. (50 steps per ms) remains 12/13 properties
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 509 ms. (78 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 230 ms. (173 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 84056 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 12
Probabilistic random walk after 84056 steps, saw 64929 distinct states, run finished after 3011 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 1182 rows 1386 cols
[2024-05-29 23:15:03] [INFO ] Computed 441 invariants in 6 ms
[2024-05-29 23:15:03] [INFO ] State equation strengthened by 117 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 969/1262 variables, 387/387 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1262 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 48/1310 variables, 20/407 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1310 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1155/2465 variables, 1310/1717 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2465 variables, 116/1833 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2465 variables, 0/1833 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 81/2546 variables, 60/1893 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2546 variables, 22/1915 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2546 variables, 1/1916 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2546 variables, 0/1916 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 4/2550 variables, 6/1922 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2550 variables, 4/1926 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2550 variables, 0/1926 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 4/2554 variables, 2/1928 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2554 variables, 0/1928 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 11/2565 variables, 10/1938 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2565 variables, 3/1941 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2565 variables, 0/1941 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 3/2568 variables, 2/1943 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2568 variables, 1/1944 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2568 variables, 0/1944 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (OVERLAPS) 0/2568 variables, 0/1944 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2568/2568 variables, and 1944 constraints, problems are : Problem set: 0 solved, 12 unsolved in 7259 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1386/1386 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 969/1262 variables, 387/387 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 23:15:11] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 3 ms to minimize.
[2024-05-29 23:15:11] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 3 ms to minimize.
[2024-05-29 23:15:11] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 3 ms to minimize.
[2024-05-29 23:15:11] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 3 ms to minimize.
[2024-05-29 23:15:11] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 3 ms to minimize.
[2024-05-29 23:15:11] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 3 ms to minimize.
[2024-05-29 23:15:12] [INFO ] Deduced a trap composed of 7 places in 161 ms of which 3 ms to minimize.
[2024-05-29 23:15:12] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 3 ms to minimize.
[2024-05-29 23:15:12] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 3 ms to minimize.
[2024-05-29 23:15:12] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 3 ms to minimize.
[2024-05-29 23:15:12] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 3 ms to minimize.
[2024-05-29 23:15:12] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
[2024-05-29 23:15:13] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-05-29 23:15:13] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 3 ms to minimize.
[2024-05-29 23:15:13] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 3 ms to minimize.
[2024-05-29 23:15:13] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 3 ms to minimize.
[2024-05-29 23:15:13] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 4 ms to minimize.
[2024-05-29 23:15:13] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 2 ms to minimize.
[2024-05-29 23:15:14] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 3 ms to minimize.
[2024-05-29 23:15:14] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1262 variables, 20/407 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 23:15:14] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-29 23:15:14] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 2 ms to minimize.
[2024-05-29 23:15:14] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 2 ms to minimize.
[2024-05-29 23:15:14] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 3 ms to minimize.
[2024-05-29 23:15:14] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-29 23:15:14] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-29 23:15:15] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 3 ms to minimize.
[2024-05-29 23:15:15] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 3 ms to minimize.
[2024-05-29 23:15:15] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 2 ms to minimize.
[2024-05-29 23:15:15] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-29 23:15:15] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-05-29 23:15:15] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-05-29 23:15:15] [INFO ] Deduced a trap composed of 8 places in 98 ms of which 2 ms to minimize.
[2024-05-29 23:15:15] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-05-29 23:15:15] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-05-29 23:15:16] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-29 23:15:16] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-29 23:15:16] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-29 23:15:16] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-29 23:15:16] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1262 variables, 20/427 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 23:15:16] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 3 ms to minimize.
[2024-05-29 23:15:16] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-05-29 23:15:16] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 3 ms to minimize.
[2024-05-29 23:15:16] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-29 23:15:17] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
[2024-05-29 23:15:17] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 3 ms to minimize.
[2024-05-29 23:15:17] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 2 ms to minimize.
[2024-05-29 23:15:17] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-29 23:15:17] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 3 ms to minimize.
[2024-05-29 23:15:17] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-29 23:15:17] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 2 ms to minimize.
[2024-05-29 23:15:17] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-29 23:15:18] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-29 23:15:18] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 3 ms to minimize.
[2024-05-29 23:15:18] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 2 ms to minimize.
[2024-05-29 23:15:18] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-29 23:15:18] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-05-29 23:15:18] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-29 23:15:18] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-05-29 23:15:18] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1262 variables, 20/447 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 23:15:19] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 2 ms to minimize.
[2024-05-29 23:15:19] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-05-29 23:15:19] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 2 ms to minimize.
[2024-05-29 23:15:19] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 4 ms to minimize.
[2024-05-29 23:15:19] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-29 23:15:19] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-05-29 23:15:19] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
[2024-05-29 23:15:19] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 2 ms to minimize.
[2024-05-29 23:15:20] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
[2024-05-29 23:15:20] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 2 ms to minimize.
[2024-05-29 23:15:20] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-29 23:15:20] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-29 23:15:20] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 23:15:20] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1262 variables, 14/461 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 23:15:20] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-29 23:15:21] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-29 23:15:21] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1262 variables, 3/464 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 23:15:21] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1262 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1262 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 48/1310 variables, 20/485 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 23:15:22] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 3 ms to minimize.
[2024-05-29 23:15:22] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 3 ms to minimize.
[2024-05-29 23:15:22] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 3 ms to minimize.
[2024-05-29 23:15:22] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2024-05-29 23:15:22] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 2 ms to minimize.
[2024-05-29 23:15:22] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 3 ms to minimize.
[2024-05-29 23:15:23] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 3 ms to minimize.
[2024-05-29 23:15:23] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2024-05-29 23:15:23] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 2 ms to minimize.
[2024-05-29 23:15:23] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 3 ms to minimize.
[2024-05-29 23:15:23] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-05-29 23:15:23] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-05-29 23:15:23] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 2 ms to minimize.
[2024-05-29 23:15:23] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-29 23:15:24] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-29 23:15:24] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 3 ms to minimize.
[2024-05-29 23:15:24] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-05-29 23:15:24] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1310 variables, 18/503 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 23:15:24] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1310 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1310 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 1155/2465 variables, 1310/1814 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2465 variables, 116/1930 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2465 variables, 6/1936 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 23:15:27] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 4 ms to minimize.
[2024-05-29 23:15:27] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 4 ms to minimize.
[2024-05-29 23:15:27] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 4 ms to minimize.
[2024-05-29 23:15:28] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2465 variables, 4/1940 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 23:15:28] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2465 variables, 1/1941 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 23:15:30] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2465 variables, 1/1942 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 23:15:32] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2465 variables, 1/1943 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2465 variables, 0/1943 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (OVERLAPS) 81/2546 variables, 60/2003 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2546 variables, 22/2025 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2546 variables, 1/2026 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2546 variables, 6/2032 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 23:15:38] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 3 ms to minimize.
[2024-05-29 23:15:38] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 3 ms to minimize.
[2024-05-29 23:15:38] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 2 ms to minimize.
[2024-05-29 23:15:38] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 3 ms to minimize.
[2024-05-29 23:15:38] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 3 ms to minimize.
[2024-05-29 23:15:39] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-05-29 23:15:39] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 3 ms to minimize.
[2024-05-29 23:15:39] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-29 23:15:40] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 2 ms to minimize.
[2024-05-29 23:15:40] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 3 ms to minimize.
[2024-05-29 23:15:40] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 3 ms to minimize.
[2024-05-29 23:15:41] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2546 variables, 12/2044 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-29 23:15:43] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 2 ms to minimize.
[2024-05-29 23:15:43] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/2546 variables, 2/2046 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2546 variables, 0/2046 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 28 (OVERLAPS) 4/2550 variables, 6/2052 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2550 variables, 4/2056 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2550 variables, 0/2056 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 31 (OVERLAPS) 4/2554 variables, 2/2058 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2554 variables, 0/2058 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 33 (OVERLAPS) 11/2565 variables, 10/2068 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2565 variables, 3/2071 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2565 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 36 (OVERLAPS) 3/2568 variables, 2/2073 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2568 variables, 1/2074 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2568/2568 variables, and 2074 constraints, problems are : Problem set: 0 solved, 12 unsolved in 45021 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1386/1386 constraints, ReadFeed: 117/117 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 118/118 constraints]
After SMT, in 52356ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 293 out of 1386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1386/1386 places, 1182/1182 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 1386 transition count 1181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1385 transition count 1181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1384 transition count 1181
Applied a total of 4 rules in 115 ms. Remains 1384 /1386 variables (removed 2) and now considering 1181/1182 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 1384/1386 places, 1181/1182 transitions.
RANDOM walk for 40000 steps (8 resets) in 689 ms. (57 steps per ms) remains 11/12 properties
FORMULA ShieldPPPt-PT-040B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 385 ms. (103 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 282 ms. (141 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 337 ms. (118 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 96026 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 11
Probabilistic random walk after 96026 steps, saw 73878 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
// Phase 1: matrix 1181 rows 1384 cols
[2024-05-29 23:15:59] [INFO ] Computed 441 invariants in 9 ms
[2024-05-29 23:15:59] [INFO ] State equation strengthened by 119 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 973/1262 variables, 387/387 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1262 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 46/1308 variables, 20/407 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1308 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1154/2462 variables, 1308/1715 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2462 variables, 118/1833 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2462 variables, 0/1833 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 81/2543 variables, 60/1893 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2543 variables, 22/1915 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2543 variables, 1/1916 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2543 variables, 0/1916 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 4/2547 variables, 6/1922 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2547 variables, 4/1926 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2547 variables, 0/1926 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 4/2551 variables, 2/1928 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2551 variables, 0/1928 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 11/2562 variables, 10/1938 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2562 variables, 3/1941 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2562 variables, 0/1941 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 3/2565 variables, 2/1943 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2565 variables, 1/1944 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2565 variables, 0/1944 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 0/2565 variables, 0/1944 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2565/2565 variables, and 1944 constraints, problems are : Problem set: 0 solved, 11 unsolved in 6778 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1384/1384 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 973/1262 variables, 387/387 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:16:07] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 3 ms to minimize.
[2024-05-29 23:16:07] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 2 ms to minimize.
[2024-05-29 23:16:07] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 3 ms to minimize.
[2024-05-29 23:16:07] [INFO ] Deduced a trap composed of 5 places in 144 ms of which 3 ms to minimize.
[2024-05-29 23:16:07] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 3 ms to minimize.
[2024-05-29 23:16:08] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 3 ms to minimize.
[2024-05-29 23:16:08] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 3 ms to minimize.
[2024-05-29 23:16:08] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 3 ms to minimize.
[2024-05-29 23:16:08] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 3 ms to minimize.
[2024-05-29 23:16:08] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 3 ms to minimize.
[2024-05-29 23:16:08] [INFO ] Deduced a trap composed of 6 places in 137 ms of which 3 ms to minimize.
[2024-05-29 23:16:08] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 3 ms to minimize.
[2024-05-29 23:16:09] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 3 ms to minimize.
[2024-05-29 23:16:09] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 4 ms to minimize.
[2024-05-29 23:16:09] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 3 ms to minimize.
[2024-05-29 23:16:09] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 3 ms to minimize.
[2024-05-29 23:16:09] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 3 ms to minimize.
[2024-05-29 23:16:09] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 3 ms to minimize.
[2024-05-29 23:16:10] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 2 ms to minimize.
[2024-05-29 23:16:10] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1262 variables, 20/407 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:16:10] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 3 ms to minimize.
[2024-05-29 23:16:10] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 2 ms to minimize.
[2024-05-29 23:16:10] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 3 ms to minimize.
[2024-05-29 23:16:10] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 3 ms to minimize.
[2024-05-29 23:16:10] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-05-29 23:16:10] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-29 23:16:11] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
[2024-05-29 23:16:11] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 2 ms to minimize.
[2024-05-29 23:16:11] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
[2024-05-29 23:16:11] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 3 ms to minimize.
[2024-05-29 23:16:11] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-29 23:16:11] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 2 ms to minimize.
[2024-05-29 23:16:11] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 3 ms to minimize.
[2024-05-29 23:16:11] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-29 23:16:12] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 2 ms to minimize.
[2024-05-29 23:16:12] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-29 23:16:12] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 3 ms to minimize.
[2024-05-29 23:16:12] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-05-29 23:16:12] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2024-05-29 23:16:12] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1262 variables, 20/427 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:16:12] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 3 ms to minimize.
[2024-05-29 23:16:12] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 3 ms to minimize.
[2024-05-29 23:16:13] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-05-29 23:16:13] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2024-05-29 23:16:13] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 3 ms to minimize.
[2024-05-29 23:16:13] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
[2024-05-29 23:16:13] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 3 ms to minimize.
[2024-05-29 23:16:13] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-29 23:16:13] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 3 ms to minimize.
[2024-05-29 23:16:13] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 3 ms to minimize.
[2024-05-29 23:16:14] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-05-29 23:16:14] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
[2024-05-29 23:16:14] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 3 ms to minimize.
[2024-05-29 23:16:14] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 3 ms to minimize.
[2024-05-29 23:16:14] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 2 ms to minimize.
[2024-05-29 23:16:14] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 2 ms to minimize.
[2024-05-29 23:16:14] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-29 23:16:15] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-05-29 23:16:15] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-29 23:16:15] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1262 variables, 20/447 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:16:15] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-05-29 23:16:15] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-29 23:16:15] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2024-05-29 23:16:15] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1262 variables, 4/451 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:16:16] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-29 23:16:16] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1262 variables, 2/453 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:16:16] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-05-29 23:16:16] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1262 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:16:17] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-29 23:16:17] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1262 variables, 2/457 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1262 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 46/1308 variables, 20/477 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:16:17] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 2 ms to minimize.
[2024-05-29 23:16:17] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-29 23:16:18] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-05-29 23:16:18] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1308 variables, 4/481 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1308 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 1154/2462 variables, 1308/1789 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2462 variables, 118/1907 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2462 variables, 5/1912 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:16:20] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 4 ms to minimize.
[2024-05-29 23:16:20] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 5 ms to minimize.
[2024-05-29 23:16:20] [INFO ] Deduced a trap composed of 7 places in 207 ms of which 4 ms to minimize.
[2024-05-29 23:16:21] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 5 ms to minimize.
[2024-05-29 23:16:21] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 4 ms to minimize.
[2024-05-29 23:16:21] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 4 ms to minimize.
[2024-05-29 23:16:22] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 4 ms to minimize.
[2024-05-29 23:16:22] [INFO ] Deduced a trap composed of 17 places in 198 ms of which 4 ms to minimize.
[2024-05-29 23:16:22] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 4 ms to minimize.
[2024-05-29 23:16:23] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 4 ms to minimize.
[2024-05-29 23:16:23] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 4 ms to minimize.
[2024-05-29 23:16:24] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2462 variables, 12/1924 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:16:25] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 4 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2462 variables, 1/1925 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:16:26] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 3 ms to minimize.
[2024-05-29 23:16:26] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2462 variables, 2/1927 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2462 variables, 0/1927 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 81/2543 variables, 60/1987 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2543 variables, 22/2009 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2543 variables, 1/2010 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2543 variables, 6/2016 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:16:31] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 4 ms to minimize.
[2024-05-29 23:16:31] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 4 ms to minimize.
[2024-05-29 23:16:31] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 3 ms to minimize.
[2024-05-29 23:16:31] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 4 ms to minimize.
[2024-05-29 23:16:32] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 3 ms to minimize.
[2024-05-29 23:16:32] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 3 ms to minimize.
[2024-05-29 23:16:32] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 4 ms to minimize.
[2024-05-29 23:16:32] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 4 ms to minimize.
[2024-05-29 23:16:33] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 4 ms to minimize.
[2024-05-29 23:16:33] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 3 ms to minimize.
[2024-05-29 23:16:33] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 3 ms to minimize.
[2024-05-29 23:16:33] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 3 ms to minimize.
[2024-05-29 23:16:34] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2543 variables, 13/2029 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:16:37] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 4 ms to minimize.
[2024-05-29 23:16:38] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 4 ms to minimize.
[2024-05-29 23:16:38] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 4 ms to minimize.
[2024-05-29 23:16:38] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 3 ms to minimize.
[2024-05-29 23:16:39] [INFO ] Deduced a trap composed of 7 places in 171 ms of which 4 ms to minimize.
[2024-05-29 23:16:39] [INFO ] Deduced a trap composed of 7 places in 187 ms of which 4 ms to minimize.
[2024-05-29 23:16:39] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 4 ms to minimize.
[2024-05-29 23:16:39] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 3 ms to minimize.
[2024-05-29 23:16:40] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 4 ms to minimize.
[2024-05-29 23:16:40] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 4 ms to minimize.
[2024-05-29 23:16:40] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 4 ms to minimize.
[2024-05-29 23:16:40] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 3 ms to minimize.
[2024-05-29 23:16:41] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 3 ms to minimize.
[2024-05-29 23:16:41] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 3 ms to minimize.
[2024-05-29 23:16:41] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 3 ms to minimize.
[2024-05-29 23:16:42] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2543 variables, 16/2045 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2543 variables, 0/2045 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (OVERLAPS) 4/2547 variables, 6/2051 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2547 variables, 4/2055 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2547 variables, 0/2055 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (OVERLAPS) 4/2551 variables, 2/2057 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2551 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (OVERLAPS) 11/2562 variables, 10/2067 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2562 variables, 3/2070 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:16:53] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 3 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/2562 variables, 1/2071 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2562 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (OVERLAPS) 3/2565 variables, 2/2073 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2565 variables, 1/2074 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2565 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:16:59] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 3 ms to minimize.
At refinement iteration 39 (OVERLAPS) 0/2565 variables, 1/2075 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2565 variables, 0/2075 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (OVERLAPS) 0/2565 variables, 0/2075 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2565/2565 variables, and 2075 constraints, problems are : Problem set: 0 solved, 11 unsolved in 58482 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1384/1384 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 120/120 constraints]
After SMT, in 65329ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 19604 ms.
Support contains 289 out of 1384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1384/1384 places, 1181/1181 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1384 transition count 1180
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1383 transition count 1180
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1382 transition count 1179
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1382 transition count 1179
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 1379 transition count 1176
Applied a total of 10 rules in 89 ms. Remains 1379 /1384 variables (removed 5) and now considering 1176/1181 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 1379/1384 places, 1176/1181 transitions.
RANDOM walk for 40000 steps (8 resets) in 607 ms. (65 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 439 ms. (90 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 268 ms. (148 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 221 ms. (180 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 85229 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 11
Probabilistic random walk after 85229 steps, saw 65591 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 1176 rows 1379 cols
[2024-05-29 23:17:28] [INFO ] Computed 441 invariants in 4 ms
[2024-05-29 23:17:28] [INFO ] State equation strengthened by 119 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 968/1257 variables, 387/387 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1257 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 46/1303 variables, 20/407 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1303 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1149/2452 variables, 1303/1710 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2452 variables, 118/1828 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2452 variables, 0/1828 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 81/2533 variables, 60/1888 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2533 variables, 22/1910 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2533 variables, 1/1911 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2533 variables, 0/1911 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 4/2537 variables, 6/1917 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2537 variables, 4/1921 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2537 variables, 0/1921 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 4/2541 variables, 2/1923 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2541 variables, 0/1923 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 11/2552 variables, 10/1933 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2552 variables, 3/1936 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2552 variables, 0/1936 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 3/2555 variables, 2/1938 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2555 variables, 1/1939 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2555 variables, 0/1939 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 0/2555 variables, 0/1939 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2555/2555 variables, and 1939 constraints, problems are : Problem set: 0 solved, 11 unsolved in 6739 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1379/1379 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 968/1257 variables, 387/387 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:17:36] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 4 ms to minimize.
[2024-05-29 23:17:36] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 3 ms to minimize.
[2024-05-29 23:17:36] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 3 ms to minimize.
[2024-05-29 23:17:36] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 3 ms to minimize.
[2024-05-29 23:17:36] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 3 ms to minimize.
[2024-05-29 23:17:36] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-05-29 23:17:37] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 3 ms to minimize.
[2024-05-29 23:17:37] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 3 ms to minimize.
[2024-05-29 23:17:37] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 3 ms to minimize.
[2024-05-29 23:17:37] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 3 ms to minimize.
[2024-05-29 23:17:37] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 3 ms to minimize.
[2024-05-29 23:17:38] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 3 ms to minimize.
[2024-05-29 23:17:38] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 4 ms to minimize.
[2024-05-29 23:17:38] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 3 ms to minimize.
[2024-05-29 23:17:38] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 3 ms to minimize.
[2024-05-29 23:17:38] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 3 ms to minimize.
[2024-05-29 23:17:38] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 4 ms to minimize.
[2024-05-29 23:17:38] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 3 ms to minimize.
[2024-05-29 23:17:39] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 3 ms to minimize.
[2024-05-29 23:17:39] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1257 variables, 20/407 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:17:39] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 2 ms to minimize.
[2024-05-29 23:17:39] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 3 ms to minimize.
[2024-05-29 23:17:39] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 3 ms to minimize.
[2024-05-29 23:17:39] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-05-29 23:17:40] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 2 ms to minimize.
[2024-05-29 23:17:40] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 2 ms to minimize.
[2024-05-29 23:17:40] [INFO ] Deduced a trap composed of 10 places in 132 ms of which 2 ms to minimize.
[2024-05-29 23:17:40] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 3 ms to minimize.
[2024-05-29 23:17:40] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 3 ms to minimize.
[2024-05-29 23:17:40] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 2 ms to minimize.
[2024-05-29 23:17:40] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 3 ms to minimize.
[2024-05-29 23:17:41] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 2 ms to minimize.
[2024-05-29 23:17:41] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 3 ms to minimize.
[2024-05-29 23:17:41] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 2 ms to minimize.
[2024-05-29 23:17:41] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2024-05-29 23:17:41] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 2 ms to minimize.
[2024-05-29 23:17:41] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-05-29 23:17:41] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-05-29 23:17:42] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 2 ms to minimize.
[2024-05-29 23:17:42] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1257 variables, 20/427 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:17:42] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 3 ms to minimize.
[2024-05-29 23:17:42] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 2 ms to minimize.
[2024-05-29 23:17:42] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 3 ms to minimize.
[2024-05-29 23:17:42] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 3 ms to minimize.
[2024-05-29 23:17:42] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 2 ms to minimize.
[2024-05-29 23:17:43] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 2 ms to minimize.
[2024-05-29 23:17:43] [INFO ] Deduced a trap composed of 8 places in 124 ms of which 3 ms to minimize.
[2024-05-29 23:17:43] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-05-29 23:17:43] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 2 ms to minimize.
[2024-05-29 23:17:43] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 3 ms to minimize.
[2024-05-29 23:17:43] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 3 ms to minimize.
[2024-05-29 23:17:43] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
[2024-05-29 23:17:44] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
[2024-05-29 23:17:44] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2024-05-29 23:17:44] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 3 ms to minimize.
[2024-05-29 23:17:44] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 2 ms to minimize.
[2024-05-29 23:17:44] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 2 ms to minimize.
[2024-05-29 23:17:44] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 3 ms to minimize.
[2024-05-29 23:17:44] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
[2024-05-29 23:17:44] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1257 variables, 20/447 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:17:45] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-05-29 23:17:45] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 3 ms to minimize.
[2024-05-29 23:17:45] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-05-29 23:17:45] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-05-29 23:17:45] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-29 23:17:45] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-29 23:17:45] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-29 23:17:45] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-29 23:17:46] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-29 23:17:46] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-29 23:17:46] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 3 ms to minimize.
[2024-05-29 23:17:46] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-05-29 23:17:46] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-05-29 23:17:46] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-29 23:17:46] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 3 ms to minimize.
[2024-05-29 23:17:47] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1257 variables, 16/463 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:17:47] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2024-05-29 23:17:47] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 2 ms to minimize.
[2024-05-29 23:17:47] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 2 ms to minimize.
[2024-05-29 23:17:47] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-05-29 23:17:47] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-05-29 23:17:47] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-05-29 23:17:48] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-29 23:17:48] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1257 variables, 8/471 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:17:48] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-29 23:17:48] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1257 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:17:48] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1257 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1257 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 46/1303 variables, 20/494 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:17:49] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 2 ms to minimize.
[2024-05-29 23:17:49] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
[2024-05-29 23:17:49] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 3 ms to minimize.
[2024-05-29 23:17:50] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 3 ms to minimize.
[2024-05-29 23:17:50] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2024-05-29 23:17:50] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-05-29 23:17:50] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 3 ms to minimize.
[2024-05-29 23:17:50] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-05-29 23:17:50] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 3 ms to minimize.
[2024-05-29 23:17:50] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-29 23:17:50] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
[2024-05-29 23:17:51] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-05-29 23:17:51] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-05-29 23:17:51] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 2 ms to minimize.
[2024-05-29 23:17:51] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 3 ms to minimize.
[2024-05-29 23:17:51] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1303 variables, 16/510 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:17:51] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 2 ms to minimize.
[2024-05-29 23:17:52] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-05-29 23:17:52] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-05-29 23:17:52] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1303 variables, 4/514 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:17:52] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1303 variables, 1/515 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:17:53] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1303 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:17:53] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1303 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1303 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 1149/2452 variables, 1303/1820 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2452 variables, 118/1938 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2452 variables, 5/1943 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:17:55] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 4 ms to minimize.
[2024-05-29 23:17:55] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 2 ms to minimize.
[2024-05-29 23:17:55] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 4 ms to minimize.
[2024-05-29 23:17:55] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 3 ms to minimize.
[2024-05-29 23:17:55] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 3 ms to minimize.
[2024-05-29 23:17:56] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 3 ms to minimize.
[2024-05-29 23:17:56] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 2 ms to minimize.
[2024-05-29 23:17:56] [INFO ] Deduced a trap composed of 11 places in 132 ms of which 3 ms to minimize.
[2024-05-29 23:17:57] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 3 ms to minimize.
[2024-05-29 23:17:57] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 3 ms to minimize.
[2024-05-29 23:17:57] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2452 variables, 11/1954 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:17:58] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 3 ms to minimize.
[2024-05-29 23:17:59] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 3 ms to minimize.
[2024-05-29 23:17:59] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2452 variables, 3/1957 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2452 variables, 0/1957 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (OVERLAPS) 81/2533 variables, 60/2017 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2533 variables, 22/2039 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2533 variables, 1/2040 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2533 variables, 6/2046 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:18:05] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 3 ms to minimize.
[2024-05-29 23:18:05] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 4 ms to minimize.
[2024-05-29 23:18:05] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 3 ms to minimize.
[2024-05-29 23:18:06] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 3 ms to minimize.
[2024-05-29 23:18:06] [INFO ] Deduced a trap composed of 6 places in 141 ms of which 3 ms to minimize.
[2024-05-29 23:18:06] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 3 ms to minimize.
[2024-05-29 23:18:06] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 3 ms to minimize.
[2024-05-29 23:18:06] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 3 ms to minimize.
[2024-05-29 23:18:07] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 3 ms to minimize.
[2024-05-29 23:18:07] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 3 ms to minimize.
[2024-05-29 23:18:07] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 3 ms to minimize.
[2024-05-29 23:18:08] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 3 ms to minimize.
[2024-05-29 23:18:08] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 3 ms to minimize.
[2024-05-29 23:18:08] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 3 ms to minimize.
[2024-05-29 23:18:09] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 3 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2533 variables, 15/2061 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2533 variables, 0/2061 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (OVERLAPS) 4/2537 variables, 6/2067 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2537 variables, 4/2071 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2537 variables, 0/2071 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (OVERLAPS) 4/2541 variables, 2/2073 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-29 23:18:18] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 3 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/2541 variables, 1/2074 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2541 variables, 0/2074 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (OVERLAPS) 11/2552 variables, 10/2084 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2552 variables, 3/2087 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2552 variables, 0/2087 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (OVERLAPS) 3/2555 variables, 2/2089 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2555 variables, 1/2090 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2555 variables, 0/2090 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (OVERLAPS) 0/2555 variables, 0/2090 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2555/2555 variables, and 2090 constraints, problems are : Problem set: 0 solved, 11 unsolved in 56965 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 1379/1379 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 140/140 constraints]
After SMT, in 63770ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 32195 ms.
Support contains 289 out of 1379 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1379/1379 places, 1176/1176 transitions.
Applied a total of 0 rules in 41 ms. Remains 1379 /1379 variables (removed 0) and now considering 1176/1176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 1379/1379 places, 1176/1176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1379/1379 places, 1176/1176 transitions.
Applied a total of 0 rules in 29 ms. Remains 1379 /1379 variables (removed 0) and now considering 1176/1176 (removed 0) transitions.
[2024-05-29 23:19:04] [INFO ] Invariant cache hit.
[2024-05-29 23:19:05] [INFO ] Implicit Places using invariants in 634 ms returned []
[2024-05-29 23:19:05] [INFO ] Invariant cache hit.
[2024-05-29 23:19:06] [INFO ] State equation strengthened by 119 read => feed constraints.
[2024-05-29 23:19:08] [INFO ] Implicit Places using invariants and state equation in 2587 ms returned []
Implicit Place search using SMT with State Equation took 3231 ms to find 0 implicit places.
[2024-05-29 23:19:08] [INFO ] Redundant transitions in 96 ms returned []
Running 1158 sub problems to find dead transitions.
[2024-05-29 23:19:08] [INFO ] Invariant cache hit.
[2024-05-29 23:19:08] [INFO ] State equation strengthened by 119 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1361 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1361/2555 variables, and 59 constraints, problems are : Problem set: 0 solved, 1158 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 59/441 constraints, State Equation: 0/1379 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 1158/1158 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1361 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1361 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 2 (OVERLAPS) 18/1379 variables, 382/441 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-05-29 23:20:02] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-29 23:20:02] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 23:20:03] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-29 23:20:03] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-29 23:20:03] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-29 23:20:03] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 23:20:04] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-29 23:20:04] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-29 23:20:04] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-29 23:20:04] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-29 23:20:05] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-29 23:20:05] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 23:20:05] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2024-05-29 23:20:05] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 23:20:05] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 23:20:05] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-29 23:20:05] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-29 23:20:06] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-29 23:20:06] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-29 23:20:06] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1379 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
(s694 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 1)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 1)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 1)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 1)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 1)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 1)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 1)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 1)
(s195 0)
(s196 0)
(s197 1)
(s198 0)
(s199 1)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 1)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 1)
(s212 1)
(s213 0)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 1)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 1)
(s224 0)
(s225 1)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 1)
(s231 1)
(s232 0)
(s233 0)
(s234 1)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 1)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 1)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 1)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 1)
(s300 0)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 1)
(s306 0)
(s307 1)
(s308 0)
(s309 0)
(s310 1)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 1)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 1)
(s325 0)
(s326 0)
(s327 0)
(s328 1)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 1)
(s337 1)
(s338 0)
(s339 1)
(s340 0)
(s341 1)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 1)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 1)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 1)
(s360 0)
(s361 0)
(s362 1)
(s363 0)
(s364 1)
(s365 0)
(s366 0)
(s367 1)
(s368 0)
(s369 1)
(s370 1)
(s371 0)
(s372 1)
(s373 0)
(s374 1)
(s375 0)
(s376 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 1)
(s383 0)
(s384 1)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 1)
(s394 0)
(s395 0)
(s396 1)
(s397 0)
(s398 1)
(s399 0)
(s400 1)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 1)
(s406 0)
(s407 1)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 1)
(s413 0)
(s414 1)
(s415 0)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 1)
(s421 0)
(s422 0)
(s423 1)
(s424 0)
(s425 1)
(s426 0)
(s427 0)
(s428 1)
(s429 0)
(s430 1)
(s431 0)
(s432 1)
(s433 0)
(s434 0)
(s435 1)
(s436 0)
(s437 0)
(s438 1)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 1)
(s448 0)
(s449 0)
(s450 0)
(s451 1)
(s452 0)
(s453 1)
(s454 0)
(s455 0)
(s456 1)
(s457 0)
(s458 1)
(s459 0)
(s460 0)
(s461 1)
(s462 0)
(s463 1)
(s464 1)
(s465 0)
(s466 0)
(s467 1)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 1)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 1)
(s481 0)
(s482 0)
(s483 0)
(s484 1)
(s485 0)
(s486 0)
(s487 1)
(s488 0)
(s489 1)
(s490 0)
(s491 0)
(s492 1)
(s493 0)
(s494 1)
(s495 0)
(s496 0)
(s497 0)
(s498 1)
(s499 0)
(s500 1)
(s501 1)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 1)
(s507 0)
(s508 1)
(s509 0)
(s510 0)
(s511 1)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 1)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 1)
(s522 0)
(s523 1)
(s524 0)
(s525 0)
(s526 1)
(s527 0)
(s528 1)
(s529 0)
(s530 0)
(s531 1)
(s532 0)
(s533 1)
(s534 1)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 1)
(s541 0)
(s542 0)
(s543 0)
(s544 1)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 1)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 1)
(s557 0)
(s558 0)
(s559 1)
(s560 0)
(s561 1)
(s562 0)
(s563 0)
(s564 1)
(s565 0)
(s566 1)
(s567 0)
(s568 0)
(s569 0)
(s570 1)
(s571 0)
(s572 1)
(s573 0)
(s574 0)
(s575 1)
(s576 0)
(s577 0)
(s578 0)
(s579 1)
(s580 0)
(s581 0)
(s582 1)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 1)
(s588 0)
(s589 1)
(s590 0)
(s591 0)
(s592 1)
(s593 0)
(s594 1)
(s595 0)
(s596 0)
(s597 0)
(s598 1)
(s599 0)
(s600 1)
(s601 0)
(s602 0)
(s603 1)
(s604 0)
(s605 1)
(s606 1)
(s607 0)
(s608 1)
(s609 0)
(s610 0)
(s611 0)
(s612 1)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 1)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 1)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 1)
(s630 0)
(s631 1)
(s632 0)
(s633 0)
(s634 0)
(s635 1)
(s636 0)
(s637 1)
(s638 0)
(s639 0)
(s640 1)
(s641 0)
(s642 1)
(s643 0)
(s644 0)
(s645 1)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 1)
(s651 1)
(s652 0)
(s653 0)
(s654 0)
(s655 1)
(s656 0)
(s657 0)
(s658 0)
(s659 1)
(s660 0)
(s661 0)
(s662 1)
(s663 0)
(s664 1)
(s665 0)
(s666 0)
(s667 1)
(s668 0)
(s669 1)
(s670 0)
(s671 0)
(s672 1)
(s673 0)
(s674 1)
(s675 0)
(s676 0)
(s677 1)
(s678 0)
(s679 0)
(s680 1)
(s681 0)
(s682 0)
(s683 1)
(s684 0)
(s685 0)
(s686 1)
(s687 0)
(s688 0)
(s689 0)
(s690 1)
(s691 0)
(s692 0)
(s693 0)
(s694 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1379/2555 variables, and 461 constraints, problems are : Problem set: 0 solved, 1158 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 441/441 constraints, State Equation: 0/1379 constraints, ReadFeed: 0/119 constraints, PredecessorRefiner: 0/1158 constraints, Known Traps: 20/20 constraints]
After SMT, in 60318ms problems are : Problem set: 0 solved, 1158 unsolved
Search for dead transitions found 0 dead transitions in 60331ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63700 ms. Remains : 1379/1379 places, 1176/1176 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 131 times.
Drop transitions (Partial Free agglomeration) removed 131 transitions
Iterating global reduction 0 with 131 rules applied. Total rules applied 131 place count 1379 transition count 1176
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 132 place count 1379 transition count 1175
Applied a total of 132 rules in 103 ms. Remains 1379 /1379 variables (removed 0) and now considering 1175/1176 (removed 1) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 1175 rows 1379 cols
[2024-05-29 23:20:08] [INFO ] Computed 441 invariants in 4 ms
[2024-05-29 23:20:09] [INFO ] After 527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-29 23:20:09] [INFO ] [Nat]Absence check using 441 positive place invariants in 93 ms returned sat
[2024-05-29 23:20:11] [INFO ] After 1444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-29 23:20:11] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-29 23:20:12] [INFO ] After 1470ms SMT Verify possible using 94 Read/Feed constraints in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2024-05-29 23:20:13] [INFO ] Deduced a trap composed of 7 places in 505 ms of which 8 ms to minimize.
[2024-05-29 23:20:14] [INFO ] Deduced a trap composed of 7 places in 489 ms of which 8 ms to minimize.
[2024-05-29 23:20:14] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 5 ms to minimize.
[2024-05-29 23:20:15] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 4 ms to minimize.
[2024-05-29 23:20:15] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 5 ms to minimize.
[2024-05-29 23:20:15] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 5 ms to minimize.
[2024-05-29 23:20:16] [INFO ] Deduced a trap composed of 11 places in 238 ms of which 5 ms to minimize.
[2024-05-29 23:20:16] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 5 ms to minimize.
[2024-05-29 23:20:16] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 5 ms to minimize.
[2024-05-29 23:20:16] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 4 ms to minimize.
[2024-05-29 23:20:17] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 4 ms to minimize.
[2024-05-29 23:20:17] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 5 ms to minimize.
[2024-05-29 23:20:17] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 5 ms to minimize.
[2024-05-29 23:20:18] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 4 ms to minimize.
[2024-05-29 23:20:18] [INFO ] Deduced a trap composed of 7 places in 214 ms of which 5 ms to minimize.
[2024-05-29 23:20:18] [INFO ] Deduced a trap composed of 7 places in 218 ms of which 4 ms to minimize.
[2024-05-29 23:20:18] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 4 ms to minimize.
[2024-05-29 23:20:19] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 5 ms to minimize.
[2024-05-29 23:20:19] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5915 ms
[2024-05-29 23:20:19] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 4 ms to minimize.
[2024-05-29 23:20:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2024-05-29 23:20:19] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 4 ms to minimize.
[2024-05-29 23:20:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2024-05-29 23:20:20] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 4 ms to minimize.
[2024-05-29 23:20:20] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 5 ms to minimize.
[2024-05-29 23:20:20] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 4 ms to minimize.
[2024-05-29 23:20:21] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 5 ms to minimize.
[2024-05-29 23:20:21] [INFO ] Deduced a trap composed of 8 places in 239 ms of which 4 ms to minimize.
[2024-05-29 23:20:21] [INFO ] Deduced a trap composed of 11 places in 240 ms of which 5 ms to minimize.
[2024-05-29 23:20:22] [INFO ] Deduced a trap composed of 13 places in 229 ms of which 5 ms to minimize.
[2024-05-29 23:20:22] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 4 ms to minimize.
[2024-05-29 23:20:22] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 5 ms to minimize.
[2024-05-29 23:20:22] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 4 ms to minimize.
[2024-05-29 23:20:23] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 5 ms to minimize.
[2024-05-29 23:20:23] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 4 ms to minimize.
[2024-05-29 23:20:23] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 4 ms to minimize.
[2024-05-29 23:20:23] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3745 ms
[2024-05-29 23:20:24] [INFO ] Deduced a trap composed of 9 places in 279 ms of which 5 ms to minimize.
[2024-05-29 23:20:24] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 5 ms to minimize.
[2024-05-29 23:20:24] [INFO ] Deduced a trap composed of 7 places in 256 ms of which 5 ms to minimize.
[2024-05-29 23:20:25] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 5 ms to minimize.
[2024-05-29 23:20:25] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 5 ms to minimize.
[2024-05-29 23:20:25] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 5 ms to minimize.
[2024-05-29 23:20:26] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 5 ms to minimize.
[2024-05-29 23:20:26] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 5 ms to minimize.
[2024-05-29 23:20:26] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 4 ms to minimize.
[2024-05-29 23:20:26] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 4 ms to minimize.
[2024-05-29 23:20:27] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 5 ms to minimize.
[2024-05-29 23:20:27] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 4 ms to minimize.
[2024-05-29 23:20:27] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 4 ms to minimize.
[2024-05-29 23:20:28] [INFO ] Deduced a trap composed of 15 places in 232 ms of which 4 ms to minimize.
[2024-05-29 23:20:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 4342 ms
[2024-05-29 23:20:28] [INFO ] Deduced a trap composed of 3 places in 216 ms of which 4 ms to minimize.
[2024-05-29 23:20:29] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 5 ms to minimize.
[2024-05-29 23:20:29] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 5 ms to minimize.
[2024-05-29 23:20:29] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 5 ms to minimize.
[2024-05-29 23:20:29] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 4 ms to minimize.
[2024-05-29 23:20:30] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 4 ms to minimize.
[2024-05-29 23:20:30] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 4 ms to minimize.
[2024-05-29 23:20:30] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 4 ms to minimize.
[2024-05-29 23:20:30] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 4 ms to minimize.
[2024-05-29 23:20:31] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 4 ms to minimize.
[2024-05-29 23:20:31] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 4 ms to minimize.
[2024-05-29 23:20:31] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 4 ms to minimize.
[2024-05-29 23:20:31] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 4 ms to minimize.
[2024-05-29 23:20:32] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 3 ms to minimize.
[2024-05-29 23:20:32] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 4 ms to minimize.
[2024-05-29 23:20:32] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 3 ms to minimize.
[2024-05-29 23:20:32] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 4 ms to minimize.
[2024-05-29 23:20:32] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4476 ms
[2024-05-29 23:20:33] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 4 ms to minimize.
[2024-05-29 23:20:33] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 3 ms to minimize.
[2024-05-29 23:20:33] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 3 ms to minimize.
[2024-05-29 23:20:33] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 4 ms to minimize.
[2024-05-29 23:20:34] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 3 ms to minimize.
[2024-05-29 23:20:34] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 3 ms to minimize.
[2024-05-29 23:20:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1330 ms
[2024-05-29 23:20:34] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 3 ms to minimize.
[2024-05-29 23:20:35] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 3 ms to minimize.
[2024-05-29 23:20:35] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 4 ms to minimize.
[2024-05-29 23:20:35] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 4 ms to minimize.
[2024-05-29 23:20:35] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 4 ms to minimize.
[2024-05-29 23:20:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1171 ms
[2024-05-29 23:20:36] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 3 ms to minimize.
[2024-05-29 23:20:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
TRAPS : Iteration 1
[2024-05-29 23:20:36] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 4 ms to minimize.
[2024-05-29 23:20:36] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 4 ms to minimize.
[2024-05-29 23:20:37] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 3 ms to minimize.
[2024-05-29 23:20:37] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 4 ms to minimize.
[2024-05-29 23:20:37] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 3 ms to minimize.
[2024-05-29 23:20:37] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 3 ms to minimize.
[2024-05-29 23:20:38] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 3 ms to minimize.
[2024-05-29 23:20:38] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 3 ms to minimize.
[2024-05-29 23:20:38] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 3 ms to minimize.
[2024-05-29 23:20:38] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 3 ms to minimize.
[2024-05-29 23:20:38] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 3 ms to minimize.
[2024-05-29 23:20:39] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 3 ms to minimize.
[2024-05-29 23:20:39] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 3 ms to minimize.
[2024-05-29 23:20:39] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 3 ms to minimize.
[2024-05-29 23:20:39] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 3 ms to minimize.
[2024-05-29 23:20:39] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 4 ms to minimize.
[2024-05-29 23:20:40] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 4 ms to minimize.
[2024-05-29 23:20:40] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 3 ms to minimize.
[2024-05-29 23:20:40] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 3 ms to minimize.
[2024-05-29 23:20:40] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 3 ms to minimize.
[2024-05-29 23:20:40] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 3 ms to minimize.
[2024-05-29 23:20:40] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4375 ms
[2024-05-29 23:20:41] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 3 ms to minimize.
[2024-05-29 23:20:41] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 3 ms to minimize.
[2024-05-29 23:20:41] [INFO ] Deduced a trap composed of 7 places in 167 ms of which 4 ms to minimize.
[2024-05-29 23:20:42] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 3 ms to minimize.
[2024-05-29 23:20:42] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 4 ms to minimize.
[2024-05-29 23:20:42] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 3 ms to minimize.
[2024-05-29 23:20:42] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 6 ms to minimize.
[2024-05-29 23:20:43] [INFO ] Deduced a trap composed of 10 places in 161 ms of which 4 ms to minimize.
[2024-05-29 23:20:43] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 3 ms to minimize.
[2024-05-29 23:20:43] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 4 ms to minimize.
[2024-05-29 23:20:43] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 3 ms to minimize.
[2024-05-29 23:20:43] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 3 ms to minimize.
[2024-05-29 23:20:44] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 3 ms to minimize.
[2024-05-29 23:20:44] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 4 ms to minimize.
[2024-05-29 23:20:44] [INFO ] Deduced a trap composed of 11 places in 156 ms of which 3 ms to minimize.
[2024-05-29 23:20:44] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 3 ms to minimize.
[2024-05-29 23:20:45] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 3 ms to minimize.
[2024-05-29 23:20:45] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3822 ms
[2024-05-29 23:20:45] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 4 ms to minimize.
[2024-05-29 23:20:45] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 4 ms to minimize.
[2024-05-29 23:20:46] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 4 ms to minimize.
[2024-05-29 23:20:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 744 ms
[2024-05-29 23:20:46] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 5 ms to minimize.
[2024-05-29 23:20:47] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 4 ms to minimize.
[2024-05-29 23:20:47] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 5 ms to minimize.
[2024-05-29 23:20:47] [INFO ] Deduced a trap composed of 12 places in 249 ms of which 5 ms to minimize.
[2024-05-29 23:20:48] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 5 ms to minimize.
[2024-05-29 23:20:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1638 ms
[2024-05-29 23:20:48] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 4 ms to minimize.
[2024-05-29 23:20:48] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 4 ms to minimize.
[2024-05-29 23:20:49] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 4 ms to minimize.
[2024-05-29 23:20:49] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 4 ms to minimize.
[2024-05-29 23:20:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1041 ms
[2024-05-29 23:20:49] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 4 ms to minimize.
[2024-05-29 23:20:50] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 4 ms to minimize.
[2024-05-29 23:20:50] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 4 ms to minimize.
[2024-05-29 23:20:50] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 4 ms to minimize.
[2024-05-29 23:20:50] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 3 ms to minimize.
[2024-05-29 23:20:51] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 3 ms to minimize.
[2024-05-29 23:20:51] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 4 ms to minimize.
[2024-05-29 23:20:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1680 ms
TRAPS : Iteration 2
[2024-05-29 23:20:52] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 4 ms to minimize.
[2024-05-29 23:20:52] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 3 ms to minimize.
[2024-05-29 23:20:52] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 3 ms to minimize.
[2024-05-29 23:20:52] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 4 ms to minimize.
[2024-05-29 23:20:53] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 4 ms to minimize.
[2024-05-29 23:20:53] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 4 ms to minimize.
[2024-05-29 23:20:53] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 4 ms to minimize.
[2024-05-29 23:20:53] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 3 ms to minimize.
[2024-05-29 23:20:54] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
[2024-05-29 23:20:54] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 3 ms to minimize.
[2024-05-29 23:20:54] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 3 ms to minimize.
[2024-05-29 23:20:54] [INFO ] Deduced a trap composed of 14 places in 181 ms of which 3 ms to minimize.
[2024-05-29 23:20:55] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 4 ms to minimize.
[2024-05-29 23:20:55] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 4 ms to minimize.
[2024-05-29 23:20:55] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3406 ms
[2024-05-29 23:20:55] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 4 ms to minimize.
[2024-05-29 23:20:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2024-05-29 23:20:56] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 4 ms to minimize.
[2024-05-29 23:20:56] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 3 ms to minimize.
[2024-05-29 23:20:56] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 3 ms to minimize.
[2024-05-29 23:20:56] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 3 ms to minimize.
[2024-05-29 23:20:57] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 3 ms to minimize.
[2024-05-29 23:20:57] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 4 ms to minimize.
[2024-05-29 23:20:57] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 4 ms to minimize.
[2024-05-29 23:20:57] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 3 ms to minimize.
[2024-05-29 23:20:57] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 3 ms to minimize.
[2024-05-29 23:20:58] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 4 ms to minimize.
[2024-05-29 23:20:58] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 4 ms to minimize.
[2024-05-29 23:20:58] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 4 ms to minimize.
[2024-05-29 23:20:58] [INFO ] Deduced a trap composed of 16 places in 148 ms of which 3 ms to minimize.
[2024-05-29 23:20:58] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3025 ms
[2024-05-29 23:20:59] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 4 ms to minimize.
[2024-05-29 23:20:59] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 3 ms to minimize.
[2024-05-29 23:20:59] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 4 ms to minimize.
[2024-05-29 23:20:59] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 3 ms to minimize.
[2024-05-29 23:21:00] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 4 ms to minimize.
[2024-05-29 23:21:00] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 3 ms to minimize.
[2024-05-29 23:21:00] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 3 ms to minimize.
[2024-05-29 23:21:00] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 4 ms to minimize.
[2024-05-29 23:21:01] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 3 ms to minimize.
[2024-05-29 23:21:01] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1961 ms
[2024-05-29 23:21:01] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 2 ms to minimize.
[2024-05-29 23:21:01] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 3 ms to minimize.
[2024-05-29 23:21:01] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 2 ms to minimize.
[2024-05-29 23:21:02] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 3 ms to minimize.
[2024-05-29 23:21:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 803 ms
[2024-05-29 23:21:02] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 2 ms to minimize.
[2024-05-29 23:21:02] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 3 ms to minimize.
[2024-05-29 23:21:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2024-05-29 23:21:03] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 3 ms to minimize.
[2024-05-29 23:21:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2024-05-29 23:21:03] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 4 ms to minimize.
[2024-05-29 23:21:03] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 4 ms to minimize.
[2024-05-29 23:21:03] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 3 ms to minimize.
[2024-05-29 23:21:04] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 4 ms to minimize.
[2024-05-29 23:21:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 905 ms
TRAPS : Iteration 3
[2024-05-29 23:21:04] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 3 ms to minimize.
[2024-05-29 23:21:05] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 3 ms to minimize.
[2024-05-29 23:21:05] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 3 ms to minimize.
[2024-05-29 23:21:05] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 3 ms to minimize.
[2024-05-29 23:21:05] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 2 ms to minimize.
[2024-05-29 23:21:05] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 2 ms to minimize.
[2024-05-29 23:21:06] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 3 ms to minimize.
[2024-05-29 23:21:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1428 ms
[2024-05-29 23:21:06] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 3 ms to minimize.
[2024-05-29 23:21:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2024-05-29 23:21:06] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 3 ms to minimize.
[2024-05-29 23:21:07] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 3 ms to minimize.
[2024-05-29 23:21:07] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 3 ms to minimize.
[2024-05-29 23:21:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 671 ms
[2024-05-29 23:21:08] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 4 ms to minimize.
[2024-05-29 23:21:08] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 5 ms to minimize.
[2024-05-29 23:21:08] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 5 ms to minimize.
[2024-05-29 23:21:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1043 ms
[2024-05-29 23:21:09] [INFO ] Deduced a trap composed of 8 places in 197 ms of which 3 ms to minimize.
[2024-05-29 23:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2024-05-29 23:21:09] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 3 ms to minimize.
[2024-05-29 23:21:09] [INFO ] Deduced a trap composed of 7 places in 185 ms of which 4 ms to minimize.
[2024-05-29 23:21:10] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 4 ms to minimize.
[2024-05-29 23:21:10] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 3 ms to minimize.
[2024-05-29 23:21:10] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 3 ms to minimize.
[2024-05-29 23:21:10] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 3 ms to minimize.
[2024-05-29 23:21:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1408 ms
[2024-05-29 23:21:11] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-05-29 23:21:11] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 4 ms to minimize.
[2024-05-29 23:21:11] [INFO ] Deduced a trap composed of 11 places in 176 ms of which 4 ms to minimize.
[2024-05-29 23:21:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 717 ms
[2024-05-29 23:21:12] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 3 ms to minimize.
[2024-05-29 23:21:12] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 4 ms to minimize.
[2024-05-29 23:21:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 523 ms
[2024-05-29 23:21:12] [INFO ] Deduced a trap composed of 14 places in 199 ms of which 4 ms to minimize.
[2024-05-29 23:21:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
TRAPS : Iteration 4
[2024-05-29 23:21:13] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 4 ms to minimize.
[2024-05-29 23:21:13] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 3 ms to minimize.
[2024-05-29 23:21:13] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 4 ms to minimize.
[2024-05-29 23:21:14] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 3 ms to minimize.
[2024-05-29 23:21:14] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 4 ms to minimize.
[2024-05-29 23:21:14] [INFO ] Deduced a trap composed of 11 places in 170 ms of which 3 ms to minimize.
[2024-05-29 23:21:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1424 ms
[2024-05-29 23:21:15] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 4 ms to minimize.
[2024-05-29 23:21:15] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 3 ms to minimize.
[2024-05-29 23:21:15] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 3 ms to minimize.
[2024-05-29 23:21:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 739 ms
[2024-05-29 23:21:16] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 3 ms to minimize.
[2024-05-29 23:21:16] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 4 ms to minimize.
[2024-05-29 23:21:17] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 3 ms to minimize.
[2024-05-29 23:21:17] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 3 ms to minimize.
[2024-05-29 23:21:17] [INFO ] Deduced a trap composed of 15 places in 183 ms of which 3 ms to minimize.
[2024-05-29 23:21:17] [INFO ] Deduced a trap composed of 12 places in 177 ms of which 4 ms to minimize.
[2024-05-29 23:21:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1484 ms
[2024-05-29 23:21:18] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 4 ms to minimize.
[2024-05-29 23:21:18] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 3 ms to minimize.
[2024-05-29 23:21:18] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 3 ms to minimize.
[2024-05-29 23:21:18] [INFO ] Deduced a trap composed of 12 places in 167 ms of which 3 ms to minimize.
[2024-05-29 23:21:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 934 ms
[2024-05-29 23:21:19] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 3 ms to minimize.
[2024-05-29 23:21:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
TRAPS : Iteration 5
[2024-05-29 23:21:20] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 4 ms to minimize.
[2024-05-29 23:21:20] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 4 ms to minimize.
[2024-05-29 23:21:21] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 4 ms to minimize.
[2024-05-29 23:21:21] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 4 ms to minimize.
[2024-05-29 23:21:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1125 ms
[2024-05-29 23:21:21] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 4 ms to minimize.
[2024-05-29 23:21:22] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 4 ms to minimize.
[2024-05-29 23:21:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 527 ms
[2024-05-29 23:21:22] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 3 ms to minimize.
[2024-05-29 23:21:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2024-05-29 23:21:23] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 3 ms to minimize.
[2024-05-29 23:21:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 247 ms
[2024-05-29 23:21:23] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 3 ms to minimize.
[2024-05-29 23:21:23] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-05-29 23:21:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 428 ms
[2024-05-29 23:21:24] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 3 ms to minimize.
[2024-05-29 23:21:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
TRAPS : Iteration 6
[2024-05-29 23:21:25] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 3 ms to minimize.
[2024-05-29 23:21:25] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 3 ms to minimize.
[2024-05-29 23:21:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 475 ms
[2024-05-29 23:21:26] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 4 ms to minimize.
[2024-05-29 23:21:26] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 4 ms to minimize.
[2024-05-29 23:21:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 510 ms
[2024-05-29 23:21:26] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 4 ms to minimize.
[2024-05-29 23:21:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2024-05-29 23:21:27] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 4 ms to minimize.
[2024-05-29 23:21:27] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 4 ms to minimize.
[2024-05-29 23:21:27] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 4 ms to minimize.
[2024-05-29 23:21:28] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 5 ms to minimize.
[2024-05-29 23:21:28] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 4 ms to minimize.
[2024-05-29 23:21:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1404 ms
[2024-05-29 23:21:29] [INFO ] Deduced a trap composed of 8 places in 237 ms of which 4 ms to minimize.
[2024-05-29 23:21:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2024-05-29 23:21:29] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 4 ms to minimize.
[2024-05-29 23:21:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
TRAPS : Iteration 7
[2024-05-29 23:21:30] [INFO ] Deduced a trap composed of 16 places in 235 ms of which 4 ms to minimize.
[2024-05-29 23:21:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2024-05-29 23:21:30] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 4 ms to minimize.
[2024-05-29 23:21:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2024-05-29 23:21:31] [INFO ] Deduced a trap composed of 13 places in 194 ms of which 4 ms to minimize.
[2024-05-29 23:21:31] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 4 ms to minimize.
[2024-05-29 23:21:31] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 4 ms to minimize.
[2024-05-29 23:21:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 811 ms
[2024-05-29 23:21:32] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 4 ms to minimize.
[2024-05-29 23:21:32] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 4 ms to minimize.
[2024-05-29 23:21:33] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 4 ms to minimize.
[2024-05-29 23:21:33] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 3 ms to minimize.
[2024-05-29 23:21:33] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 4 ms to minimize.
[2024-05-29 23:21:33] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 4 ms to minimize.
[2024-05-29 23:21:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1507 ms
[2024-05-29 23:21:34] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 3 ms to minimize.
[2024-05-29 23:21:34] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 3 ms to minimize.
[2024-05-29 23:21:34] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 3 ms to minimize.
[2024-05-29 23:21:34] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 3 ms to minimize.
[2024-05-29 23:21:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 878 ms
[2024-05-29 23:21:35] [INFO ] Deduced a trap composed of 11 places in 137 ms of which 3 ms to minimize.
[2024-05-29 23:21:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2024-05-29 23:21:35] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 3 ms to minimize.
[2024-05-29 23:21:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
TRAPS : Iteration 8
[2024-05-29 23:21:37] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 4 ms to minimize.
[2024-05-29 23:21:37] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 3 ms to minimize.
[2024-05-29 23:21:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 548 ms
[2024-05-29 23:21:38] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 4 ms to minimize.
[2024-05-29 23:21:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2024-05-29 23:21:39] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 4 ms to minimize.
[2024-05-29 23:21:39] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 5 ms to minimize.
[2024-05-29 23:21:39] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 4 ms to minimize.
[2024-05-29 23:21:40] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 4 ms to minimize.
[2024-05-29 23:21:40] [INFO ] Deduced a trap composed of 12 places in 207 ms of which 4 ms to minimize.
[2024-05-29 23:21:40] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 4 ms to minimize.
[2024-05-29 23:21:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1642 ms
TRAPS : Iteration 9
[2024-05-29 23:21:41] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 4 ms to minimize.
[2024-05-29 23:21:41] [INFO ] Deduced a trap composed of 8 places in 199 ms of which 4 ms to minimize.
[2024-05-29 23:21:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 559 ms
[2024-05-29 23:21:42] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 3 ms to minimize.
[2024-05-29 23:21:42] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 3 ms to minimize.
[2024-05-29 23:21:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2024-05-29 23:21:43] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 4 ms to minimize.
[2024-05-29 23:21:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2024-05-29 23:21:43] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 3 ms to minimize.
[2024-05-29 23:21:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
TRAPS : Iteration 10
[2024-05-29 23:21:44] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 4 ms to minimize.
[2024-05-29 23:21:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2024-05-29 23:21:45] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 4 ms to minimize.
[2024-05-29 23:21:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2024-05-29 23:21:46] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 5 ms to minimize.
[2024-05-29 23:21:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
TRAPS : Iteration 11
[2024-05-29 23:21:48] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 4 ms to minimize.
[2024-05-29 23:21:48] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 4 ms to minimize.
[2024-05-29 23:21:48] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 4 ms to minimize.
[2024-05-29 23:21:49] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 4 ms to minimize.
[2024-05-29 23:21:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1265 ms
[2024-05-29 23:21:50] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 3 ms to minimize.
[2024-05-29 23:21:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2024-05-29 23:21:50] [INFO ] Deduced a trap composed of 6 places in 161 ms of which 3 ms to minimize.
[2024-05-29 23:21:50] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 3 ms to minimize.
[2024-05-29 23:21:50] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 4 ms to minimize.
[2024-05-29 23:21:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 745 ms
[2024-05-29 23:21:51] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 3 ms to minimize.
[2024-05-29 23:21:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2024-05-29 23:21:51] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 3 ms to minimize.
[2024-05-29 23:21:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
TRAPS : Iteration 12
[2024-05-29 23:21:53] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 4 ms to minimize.
[2024-05-29 23:21:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2024-05-29 23:21:54] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 3 ms to minimize.
[2024-05-29 23:21:54] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 3 ms to minimize.
[2024-05-29 23:21:54] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 4 ms to minimize.
[2024-05-29 23:21:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 705 ms
[2024-05-29 23:21:55] [INFO ] Deduced a trap composed of 14 places in 161 ms of which 3 ms to minimize.
[2024-05-29 23:21:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2024-05-29 23:21:55] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 4 ms to minimize.
[2024-05-29 23:21:55] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 4 ms to minimize.
[2024-05-29 23:21:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 447 ms
TRAPS : Iteration 13
[2024-05-29 23:21:56] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 4 ms to minimize.
[2024-05-29 23:21:56] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 3 ms to minimize.
[2024-05-29 23:21:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 456 ms
[2024-05-29 23:21:57] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 3 ms to minimize.
[2024-05-29 23:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2024-05-29 23:21:58] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 3 ms to minimize.
[2024-05-29 23:21:58] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 3 ms to minimize.
[2024-05-29 23:21:59] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 3 ms to minimize.
[2024-05-29 23:21:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 656 ms
TRAPS : Iteration 14
[2024-05-29 23:22:00] [INFO ] Deduced a trap composed of 13 places in 209 ms of which 4 ms to minimize.
[2024-05-29 23:22:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2024-05-29 23:22:00] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 4 ms to minimize.
[2024-05-29 23:22:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2024-05-29 23:22:02] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 4 ms to minimize.
[2024-05-29 23:22:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2024-05-29 23:22:02] [INFO ] Deduced a trap composed of 15 places in 187 ms of which 4 ms to minimize.
[2024-05-29 23:22:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
TRAPS : Iteration 15
[2024-05-29 23:22:03] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 3 ms to minimize.
[2024-05-29 23:22:03] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 3 ms to minimize.
[2024-05-29 23:22:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 485 ms
[2024-05-29 23:22:04] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 4 ms to minimize.
[2024-05-29 23:22:04] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 4 ms to minimize.
[2024-05-29 23:22:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 599 ms
[2024-05-29 23:22:05] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 5 ms to minimize.
[2024-05-29 23:22:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 406 ms
[2024-05-29 23:22:06] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 4 ms to minimize.
[2024-05-29 23:22:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2024-05-29 23:22:06] [INFO ] Deduced a trap composed of 7 places in 215 ms of which 4 ms to minimize.
[2024-05-29 23:22:07] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 4 ms to minimize.
[2024-05-29 23:22:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 590 ms
TRAPS : Iteration 16
[2024-05-29 23:22:08] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 4 ms to minimize.
[2024-05-29 23:22:08] [INFO ] Deduced a trap composed of 10 places in 167 ms of which 4 ms to minimize.
[2024-05-29 23:22:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 513 ms
[2024-05-29 23:22:08] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 4 ms to minimize.
[2024-05-29 23:22:09] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 4 ms to minimize.
[2024-05-29 23:22:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 555 ms
[2024-05-29 23:22:09] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 4 ms to minimize.
[2024-05-29 23:22:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2024-05-29 23:22:10] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 3 ms to minimize.
[2024-05-29 23:22:10] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 3 ms to minimize.
[2024-05-29 23:22:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 483 ms
TRAPS : Iteration 17
[2024-05-29 23:22:11] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 3 ms to minimize.
[2024-05-29 23:22:11] [INFO ] Deduced a trap composed of 6 places in 176 ms of which 3 ms to minimize.
[2024-05-29 23:22:11] [INFO ] Deduced a trap composed of 18 places in 172 ms of which 3 ms to minimize.
[2024-05-29 23:22:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 744 ms
[2024-05-29 23:22:12] [INFO ] Deduced a trap composed of 11 places in 160 ms of which 3 ms to minimize.
[2024-05-29 23:22:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
[2024-05-29 23:22:13] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 5 ms to minimize.
[2024-05-29 23:22:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2024-05-29 23:22:14] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 5 ms to minimize.
[2024-05-29 23:22:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 303 ms
[2024-05-29 23:22:14] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 4 ms to minimize.
[2024-05-29 23:22:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
TRAPS : Iteration 18
[2024-05-29 23:22:15] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 4 ms to minimize.
[2024-05-29 23:22:16] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 4 ms to minimize.
[2024-05-29 23:22:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 540 ms
[2024-05-29 23:22:16] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 4 ms to minimize.
[2024-05-29 23:22:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2024-05-29 23:22:17] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 3 ms to minimize.
[2024-05-29 23:22:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
TRAPS : Iteration 19
[2024-05-29 23:22:19] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 4 ms to minimize.
[2024-05-29 23:22:19] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 4 ms to minimize.
[2024-05-29 23:22:19] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 5 ms to minimize.
[2024-05-29 23:22:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 949 ms
[2024-05-29 23:22:21] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 3 ms to minimize.
[2024-05-29 23:22:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2024-05-29 23:22:21] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 3 ms to minimize.
[2024-05-29 23:22:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
TRAPS : Iteration 20
[2024-05-29 23:22:22] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 3 ms to minimize.
[2024-05-29 23:22:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2024-05-29 23:22:23] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 4 ms to minimize.
[2024-05-29 23:22:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2024-05-29 23:22:24] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
[2024-05-29 23:22:24] [INFO ] Deduced a trap composed of 10 places in 147 ms of which 3 ms to minimize.
[2024-05-29 23:22:24] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 3 ms to minimize.
[2024-05-29 23:22:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 640 ms
TRAPS : Iteration 21
[2024-05-29 23:22:27] [INFO ] After 135699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2024-05-29 23:22:29] [INFO ] After 139741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Over-approximation ignoring read arcs solved 0 properties in 140433 ms.
[2024-05-29 23:22:29] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-29 23:22:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1379 places, 1176 transitions and 4322 arcs took 9 ms.
[2024-05-29 23:22:29] [INFO ] Flatten gal took : 128 ms
Total runtime 464303 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldPPPt-PT-040B
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1379
TRANSITIONS: 1176
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.024s, Sys 0.003s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2884
MODEL NAME: /home/mcc/execution/413/model
1379 places, 1176 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
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="ShieldPPPt-PT-040B"
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 ShieldPPPt-PT-040B, 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 r355-tall-171683759300671"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-PT-040B 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 '
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 ;