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.r528-tall-171683761700703.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 ltsminxred
Input is ShieldPPPt-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761700703
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K 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.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 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:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 1.9M 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-100B-ReachabilityFireability-2023-00
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPt-PT-100B-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717261783168

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:09:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 17:09:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:09:44] [INFO ] Load time of PNML (sax parser for PT used): 334 ms
[2024-06-01 17:09:45] [INFO ] Transformed 7803 places.
[2024-06-01 17:09:45] [INFO ] Transformed 7103 transitions.
[2024-06-01 17:09:45] [INFO ] Found NUPN structural information;
[2024-06-01 17:09:45] [INFO ] Parsed PT model containing 7803 places and 7103 transitions and 17806 arcs in 770 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3158 ms. (12 steps per ms) remains 12/16 properties
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 680 ms. (58 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 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
// Phase 1: matrix 7103 rows 7803 cols
[2024-06-01 17:09:47] [INFO ] Computed 1101 invariants in 75 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 154/154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 4720/4874 variables, 650/804 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4874 variables, 4720/5524 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4874 variables, 0/5524 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2929/7803 variables, 451/5975 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7803 variables, 2929/8904 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7803 variables, 0/8904 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SMT process timed out in 5294ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 154 out of 7803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1772 transitions
Trivial Post-agglo rules discarded 1772 transitions
Performed 1772 trivial Post agglomeration. Transition count delta: 1772
Iterating post reduction 0 with 1772 rules applied. Total rules applied 1772 place count 7803 transition count 5331
Reduce places removed 1772 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 1 with 1823 rules applied. Total rules applied 3595 place count 6031 transition count 5280
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 2 with 51 rules applied. Total rules applied 3646 place count 5980 transition count 5280
Performed 413 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 413 Pre rules applied. Total rules applied 3646 place count 5980 transition count 4867
Deduced a syphon composed of 413 places in 23 ms
Reduce places removed 413 places and 0 transitions.
Iterating global reduction 3 with 826 rules applied. Total rules applied 4472 place count 5567 transition count 4867
Discarding 667 places :
Symmetric choice reduction at 3 with 667 rule applications. Total rules 5139 place count 4900 transition count 4200
Iterating global reduction 3 with 667 rules applied. Total rules applied 5806 place count 4900 transition count 4200
Performed 273 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 273 Pre rules applied. Total rules applied 5806 place count 4900 transition count 3927
Deduced a syphon composed of 273 places in 19 ms
Reduce places removed 273 places and 0 transitions.
Iterating global reduction 3 with 546 rules applied. Total rules applied 6352 place count 4627 transition count 3927
Performed 1636 Post agglomeration using F-continuation condition.Transition count delta: 1636
Deduced a syphon composed of 1636 places in 10 ms
Reduce places removed 1636 places and 0 transitions.
Iterating global reduction 3 with 3272 rules applied. Total rules applied 9624 place count 2991 transition count 2291
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 9 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 9826 place count 2890 transition count 2291
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 8 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10028 place count 2789 transition count 2291
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 64 places in 9 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 10156 place count 2725 transition count 2291
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 10164 place count 2725 transition count 2283
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 10172 place count 2717 transition count 2283
Partial Free-agglomeration rule applied 286 times.
Drop transitions (Partial Free agglomeration) removed 286 transitions
Iterating global reduction 4 with 286 rules applied. Total rules applied 10458 place count 2717 transition count 2283
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 10459 place count 2716 transition count 2282
Applied a total of 10459 rules in 3420 ms. Remains 2716 /7803 variables (removed 5087) and now considering 2282/7103 (removed 4821) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3432 ms. Remains : 2716/7803 places, 2282/7103 transitions.
RANDOM walk for 40000 steps (8 resets) in 1016 ms. (39 steps per ms) remains 11/12 properties
FORMULA ShieldPPPt-PT-100B-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 555 ms. (71 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 406 ms. (98 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 417 ms. (95 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 425 ms. (93 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 457 ms. (87 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 415 ms. (96 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 396 ms. (100 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 464 ms. (86 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 406 ms. (98 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 484 ms. (82 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 53062 steps, run timeout after 3001 ms. (steps per millisecond=17 ) properties seen :0 out of 11
Probabilistic random walk after 53062 steps, saw 41345 distinct states, run finished after 3009 ms. (steps per millisecond=17 ) properties seen :0
// Phase 1: matrix 2282 rows 2716 cols
[2024-06-01 17:10:00] [INFO ] Computed 1101 invariants in 10 ms
[2024-06-01 17:10:00] [INFO ] State equation strengthened by 541 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1519/1654 variables, 641/641 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1654 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 865/2519 variables, 374/1015 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2519 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2139/4658 variables, 2519/3534 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4658 variables, 541/4075 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4658 variables, 0/4075 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 98/4756 variables, 54/4129 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4756 variables, 19/4148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4756 variables, 0/4148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 6/4762 variables, 6/4154 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4762 variables, 6/4160 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4762 variables, 0/4160 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 12/4774 variables, 6/4166 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4774 variables, 0/4166 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 82/4856 variables, 52/4218 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4856 variables, 14/4232 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4856 variables, 0/4232 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 4/4860 variables, 5/4237 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4860 variables, 4/4241 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4860 variables, 0/4241 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 6/4866 variables, 3/4244 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4866 variables, 0/4244 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (OVERLAPS) 70/4936 variables, 41/4285 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4936 variables, 13/4298 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4936 variables, 0/4298 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (OVERLAPS) 4/4940 variables, 4/4302 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4940 variables, 4/4306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/4940 variables, 0/4306 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (OVERLAPS) 8/4948 variables, 4/4310 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/4948 variables, 0/4310 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (OVERLAPS) 33/4981 variables, 26/4336 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/4981 variables, 8/4344 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/4981 variables, 0/4344 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (OVERLAPS) 14/4995 variables, 8/4352 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/4995 variables, 3/4355 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/4995 variables, 0/4355 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (OVERLAPS) 2/4997 variables, 1/4356 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/4997 variables, 0/4356 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (OVERLAPS) 1/4998 variables, 2/4358 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/4998 variables, 0/4358 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 42 (OVERLAPS) 0/4998 variables, 0/4358 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4998/4998 variables, and 4358 constraints, problems are : Problem set: 0 solved, 11 unsolved in 26261 ms.
Refiners :[Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2716/2716 constraints, ReadFeed: 541/541 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/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1519/1654 variables, 641/641 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 17:10:27] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 15 ms to minimize.
[2024-06-01 17:10:27] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 3 ms to minimize.
[2024-06-01 17:10:27] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 4 ms to minimize.
[2024-06-01 17:10:27] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 2 ms to minimize.
[2024-06-01 17:10:27] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-06-01 17:10:27] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-06-01 17:10:27] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-06-01 17:10:28] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-06-01 17:10:28] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-06-01 17:10:28] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 3 ms to minimize.
[2024-06-01 17:10:28] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-06-01 17:10:28] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-06-01 17:10:28] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-06-01 17:10:28] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-06-01 17:10:28] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 2 ms to minimize.
[2024-06-01 17:10:28] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-06-01 17:10:28] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 17:10:29] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-06-01 17:10:29] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-06-01 17:10:29] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1654 variables, 20/661 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 17:10:29] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 2 ms to minimize.
[2024-06-01 17:10:29] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-06-01 17:10:29] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-06-01 17:10:29] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 17:10:29] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-06-01 17:10:29] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-06-01 17:10:30] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-06-01 17:10:30] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 1 ms to minimize.
[2024-06-01 17:10:30] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-06-01 17:10:30] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2024-06-01 17:10:30] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1654 variables, 11/672 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1654 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 865/2519 variables, 374/1046 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 17:10:31] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-06-01 17:10:31] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
[2024-06-01 17:10:31] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 5 ms to minimize.
[2024-06-01 17:10:31] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-06-01 17:10:31] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-06-01 17:10:31] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 2 ms to minimize.
[2024-06-01 17:10:32] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-06-01 17:10:32] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 17:10:32] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
[2024-06-01 17:10:32] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2024-06-01 17:10:32] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 17:10:32] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 1 ms to minimize.
[2024-06-01 17:10:32] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-06-01 17:10:33] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2519 variables, 14/1060 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2519 variables, 0/1060 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 2139/4658 variables, 2519/3579 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4658 variables, 541/4120 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4658 variables, 8/4128 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 17:10:41] [INFO ] Deduced a trap composed of 6 places in 329 ms of which 6 ms to minimize.
[2024-06-01 17:10:41] [INFO ] Deduced a trap composed of 6 places in 301 ms of which 6 ms to minimize.
[2024-06-01 17:10:42] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 5 ms to minimize.
[2024-06-01 17:10:42] [INFO ] Deduced a trap composed of 8 places in 314 ms of which 6 ms to minimize.
[2024-06-01 17:10:43] [INFO ] Deduced a trap composed of 8 places in 304 ms of which 5 ms to minimize.
[2024-06-01 17:10:43] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 5 ms to minimize.
[2024-06-01 17:10:43] [INFO ] Deduced a trap composed of 9 places in 301 ms of which 6 ms to minimize.
[2024-06-01 17:10:44] [INFO ] Deduced a trap composed of 11 places in 305 ms of which 6 ms to minimize.
[2024-06-01 17:10:44] [INFO ] Deduced a trap composed of 8 places in 281 ms of which 5 ms to minimize.
[2024-06-01 17:10:45] [INFO ] Deduced a trap composed of 8 places in 286 ms of which 5 ms to minimize.
[2024-06-01 17:10:45] [INFO ] Deduced a trap composed of 9 places in 301 ms of which 10 ms to minimize.
[2024-06-01 17:10:45] [INFO ] Deduced a trap composed of 8 places in 290 ms of which 5 ms to minimize.
[2024-06-01 17:10:46] [INFO ] Deduced a trap composed of 9 places in 290 ms of which 5 ms to minimize.
[2024-06-01 17:10:46] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 5 ms to minimize.
[2024-06-01 17:10:47] [INFO ] Deduced a trap composed of 9 places in 373 ms of which 7 ms to minimize.
[2024-06-01 17:10:47] [INFO ] Deduced a trap composed of 7 places in 365 ms of which 6 ms to minimize.
[2024-06-01 17:10:48] [INFO ] Deduced a trap composed of 8 places in 392 ms of which 6 ms to minimize.
[2024-06-01 17:10:48] [INFO ] Deduced a trap composed of 9 places in 374 ms of which 7 ms to minimize.
[2024-06-01 17:10:49] [INFO ] Deduced a trap composed of 7 places in 366 ms of which 7 ms to minimize.
[2024-06-01 17:10:49] [INFO ] Deduced a trap composed of 12 places in 371 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4658 variables, 20/4148 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 17:10:53] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 5 ms to minimize.
[2024-06-01 17:10:53] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/4658 variables, 2/4150 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4658 variables, 0/4150 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 98/4756 variables, 54/4204 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4756 variables, 19/4223 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4756 variables, 3/4226 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 17:11:07] [INFO ] Deduced a trap composed of 5 places in 227 ms of which 4 ms to minimize.
[2024-06-01 17:11:07] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 4 ms to minimize.
[2024-06-01 17:11:08] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 4 ms to minimize.
[2024-06-01 17:11:08] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 4 ms to minimize.
[2024-06-01 17:11:09] [INFO ] Deduced a trap composed of 6 places in 204 ms of which 4 ms to minimize.
[2024-06-01 17:11:09] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 4 ms to minimize.
[2024-06-01 17:11:09] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 4 ms to minimize.
[2024-06-01 17:11:10] [INFO ] Deduced a trap composed of 7 places in 199 ms of which 4 ms to minimize.
[2024-06-01 17:11:10] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4756/4998 variables, and 4235 constraints, problems are : Problem set: 0 solved, 11 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 1034/1101 constraints, State Equation: 2573/2716 constraints, ReadFeed: 541/541 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 76/76 constraints]
After SMT, in 71374ms problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 135 out of 2716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2716/2716 places, 2282/2282 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 2716 transition count 2272
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 2706 transition count 2272
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 2706 transition count 2270
Deduced a syphon composed of 2 places in 22 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 2704 transition count 2270
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 6 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 60 place count 2686 transition count 2252
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 2683 transition count 2252
Applied a total of 66 rules in 385 ms. Remains 2683 /2716 variables (removed 33) and now considering 2252/2282 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 2683/2716 places, 2252/2282 transitions.
RANDOM walk for 40000 steps (8 resets) in 958 ms. (41 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 555 ms. (71 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 578 ms. (69 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 611 ms. (65 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 517 ms. (77 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 612 ms. (65 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 566 ms. (70 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 409 ms. (97 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 527 ms. (75 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 394 ms. (101 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 481 ms. (82 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 115202 steps, run timeout after 6001 ms. (steps per millisecond=19 ) properties seen :0 out of 11
Probabilistic random walk after 115202 steps, saw 96286 distinct states, run finished after 6002 ms. (steps per millisecond=19 ) properties seen :0
// Phase 1: matrix 2252 rows 2683 cols
[2024-06-01 17:11:20] [INFO ] Computed 1101 invariants in 9 ms
[2024-06-01 17:11:20] [INFO ] State equation strengthened by 548 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1498/1633 variables, 641/641 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1633 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 855/2488 variables, 374/1015 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2488 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 2110/4598 variables, 2488/3503 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4598 variables, 548/4051 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4598 variables, 0/4051 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 98/4696 variables, 54/4105 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4696 variables, 19/4124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4696 variables, 0/4124 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 6/4702 variables, 6/4130 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4702 variables, 6/4136 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4702 variables, 0/4136 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 12/4714 variables, 6/4142 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4714 variables, 0/4142 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 82/4796 variables, 52/4194 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4796 variables, 14/4208 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4796 variables, 0/4208 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 4/4800 variables, 5/4213 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4800 variables, 4/4217 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4800 variables, 0/4217 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (OVERLAPS) 6/4806 variables, 3/4220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4806 variables, 0/4220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (OVERLAPS) 70/4876 variables, 41/4261 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4876 variables, 13/4274 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/4876 variables, 0/4274 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (OVERLAPS) 4/4880 variables, 4/4278 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4880 variables, 4/4282 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/4880 variables, 0/4282 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (OVERLAPS) 8/4888 variables, 4/4286 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/4888 variables, 0/4286 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (OVERLAPS) 35/4923 variables, 26/4312 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/4923 variables, 8/4320 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/4923 variables, 0/4320 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (OVERLAPS) 12/4935 variables, 8/4328 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/4935 variables, 4/4332 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/4935 variables, 0/4332 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (OVERLAPS) 0/4935 variables, 0/4332 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4935/4935 variables, and 4332 constraints, problems are : Problem set: 0 solved, 11 unsolved in 24255 ms.
Refiners :[Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2683/2683 constraints, ReadFeed: 548/548 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/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 1498/1633 variables, 641/641 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 17:11:45] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 2 ms to minimize.
[2024-06-01 17:11:45] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
[2024-06-01 17:11:45] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2024-06-01 17:11:45] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
[2024-06-01 17:11:45] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-06-01 17:11:45] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-06-01 17:11:45] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-06-01 17:11:45] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-06-01 17:11:45] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-06-01 17:11:45] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-06-01 17:11:45] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 2 ms to minimize.
[2024-06-01 17:11:46] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2024-06-01 17:11:46] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 17:11:46] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-06-01 17:11:46] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-06-01 17:11:46] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2024-06-01 17:11:46] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 17:11:46] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-06-01 17:11:46] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1633 variables, 19/660 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 17:11:47] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 2 ms to minimize.
[2024-06-01 17:11:47] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1633 variables, 2/662 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1633 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 855/2488 variables, 374/1036 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 17:11:48] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-06-01 17:11:48] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-06-01 17:11:48] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 2 ms to minimize.
[2024-06-01 17:11:48] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-06-01 17:11:48] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
[2024-06-01 17:11:48] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2024-06-01 17:11:48] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-06-01 17:11:48] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-06-01 17:11:49] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-06-01 17:11:49] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 17:11:49] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2488 variables, 11/1047 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 17:11:49] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-06-01 17:11:50] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2488 variables, 2/1049 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2488 variables, 0/1049 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2110/4598 variables, 2488/3537 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4598 variables, 548/4085 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4598 variables, 8/4093 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 17:11:56] [INFO ] Deduced a trap composed of 7 places in 276 ms of which 4 ms to minimize.
[2024-06-01 17:11:57] [INFO ] Deduced a trap composed of 9 places in 258 ms of which 4 ms to minimize.
[2024-06-01 17:11:57] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 4 ms to minimize.
[2024-06-01 17:11:57] [INFO ] Deduced a trap composed of 9 places in 237 ms of which 5 ms to minimize.
[2024-06-01 17:11:58] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 4 ms to minimize.
[2024-06-01 17:11:58] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 5 ms to minimize.
[2024-06-01 17:11:58] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 4 ms to minimize.
[2024-06-01 17:11:59] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 4 ms to minimize.
[2024-06-01 17:11:59] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 5 ms to minimize.
[2024-06-01 17:11:59] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 4 ms to minimize.
[2024-06-01 17:12:00] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 4 ms to minimize.
[2024-06-01 17:12:00] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 5 ms to minimize.
[2024-06-01 17:12:00] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 5 ms to minimize.
[2024-06-01 17:12:01] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 4 ms to minimize.
[2024-06-01 17:12:02] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 4 ms to minimize.
[2024-06-01 17:12:03] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 4 ms to minimize.
[2024-06-01 17:12:03] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 3 ms to minimize.
[2024-06-01 17:12:03] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 4 ms to minimize.
[2024-06-01 17:12:04] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/4598 variables, 19/4112 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 17:12:06] [INFO ] Deduced a trap composed of 8 places in 190 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/4598 variables, 1/4113 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4598 variables, 0/4113 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 98/4696 variables, 54/4167 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4696 variables, 19/4186 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4696 variables, 3/4189 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 17:12:14] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 4 ms to minimize.
[2024-06-01 17:12:14] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 3 ms to minimize.
[2024-06-01 17:12:15] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 3 ms to minimize.
[2024-06-01 17:12:15] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 3 ms to minimize.
[2024-06-01 17:12:15] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 2 ms to minimize.
[2024-06-01 17:12:15] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 3 ms to minimize.
[2024-06-01 17:12:16] [INFO ] Deduced a trap composed of 7 places in 142 ms of which 3 ms to minimize.
[2024-06-01 17:12:16] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 3 ms to minimize.
[2024-06-01 17:12:17] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 3 ms to minimize.
[2024-06-01 17:12:17] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 3 ms to minimize.
[2024-06-01 17:12:17] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 3 ms to minimize.
[2024-06-01 17:12:18] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/4696 variables, 12/4201 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 17:12:21] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/4696 variables, 1/4202 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4696 variables, 0/4202 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 6/4702 variables, 6/4208 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4702 variables, 6/4214 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/4702 variables, 0/4214 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 24 (OVERLAPS) 12/4714 variables, 6/4220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/4714 variables, 0/4220 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 26 (OVERLAPS) 82/4796 variables, 52/4272 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/4796 variables, 14/4286 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/4796 variables, 0/4286 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 29 (OVERLAPS) 4/4800 variables, 5/4291 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/4800 variables, 4/4295 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/4800 variables, 0/4295 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 32 (OVERLAPS) 6/4806 variables, 3/4298 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/4806 variables, 0/4298 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 34 (OVERLAPS) 70/4876 variables, 41/4339 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/4876 variables, 13/4352 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/4876 variables, 0/4352 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 37 (OVERLAPS) 4/4880 variables, 4/4356 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/4880 variables, 4/4360 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/4880 variables, 0/4360 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 40 (OVERLAPS) 8/4888 variables, 4/4364 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/4888 variables, 0/4364 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SMT process timed out in 99364ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 135 out of 2683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2683/2683 places, 2252/2252 transitions.
Applied a total of 0 rules in 142 ms. Remains 2683 /2683 variables (removed 0) and now considering 2252/2252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 2683/2683 places, 2252/2252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2683/2683 places, 2252/2252 transitions.
Applied a total of 0 rules in 153 ms. Remains 2683 /2683 variables (removed 0) and now considering 2252/2252 (removed 0) transitions.
[2024-06-01 17:12:59] [INFO ] Invariant cache hit.
[2024-06-01 17:13:01] [INFO ] Implicit Places using invariants in 1557 ms returned []
[2024-06-01 17:13:01] [INFO ] Invariant cache hit.
[2024-06-01 17:13:02] [INFO ] State equation strengthened by 548 read => feed constraints.
[2024-06-01 17:13:22] [INFO ] Implicit Places using invariants and state equation in 20853 ms returned []
Implicit Place search using SMT with State Equation took 22421 ms to find 0 implicit places.
[2024-06-01 17:13:22] [INFO ] Redundant transitions in 108 ms returned []
Running 2245 sub problems to find dead transitions.
[2024-06-01 17:13:22] [INFO ] Invariant cache hit.
[2024-06-01 17:13:22] [INFO ] State equation strengthened by 548 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2678 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 2245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2678/4935 variables, and 89 constraints, problems are : Problem set: 0 solved, 2245 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 89/1101 constraints, State Equation: 0/2683 constraints, ReadFeed: 0/548 constraints, PredecessorRefiner: 2245/2245 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2678 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 2245 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2678/4935 variables, and 89 constraints, problems are : Problem set: 0 solved, 2245 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 89/1101 constraints, State Equation: 0/2683 constraints, ReadFeed: 0/548 constraints, PredecessorRefiner: 0/2245 constraints, Known Traps: 0/0 constraints]
After SMT, in 61055ms problems are : Problem set: 0 solved, 2245 unsolved
Search for dead transitions found 0 dead transitions in 61080ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83786 ms. Remains : 2683/2683 places, 2252/2252 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 589 times.
Drop transitions (Partial Free agglomeration) removed 589 transitions
Iterating global reduction 0 with 589 rules applied. Total rules applied 589 place count 2683 transition count 2252
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 592 place count 2683 transition count 2249
Applied a total of 592 rules in 369 ms. Remains 2683 /2683 variables (removed 0) and now considering 2249/2252 (removed 3) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 2249 rows 2683 cols
[2024-06-01 17:14:23] [INFO ] Computed 1101 invariants in 15 ms
[2024-06-01 17:14:24] [INFO ] [Real]Absence check using 1101 positive place invariants in 184 ms returned sat
[2024-06-01 17:14:25] [INFO ] After 1006ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-06-01 17:14:25] [INFO ] [Nat]Absence check using 1101 positive place invariants in 187 ms returned sat
[2024-06-01 17:14:28] [INFO ] After 2317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-06-01 17:14:28] [INFO ] State equation strengthened by 553 read => feed constraints.
[2024-06-01 17:14:40] [INFO ] After 11393ms SMT Verify possible using 553 Read/Feed constraints in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2024-06-01 17:14:41] [INFO ] Deduced a trap composed of 8 places in 612 ms of which 10 ms to minimize.
[2024-06-01 17:14:41] [INFO ] Deduced a trap composed of 9 places in 644 ms of which 9 ms to minimize.
[2024-06-01 17:14:42] [INFO ] Deduced a trap composed of 6 places in 632 ms of which 9 ms to minimize.
[2024-06-01 17:14:43] [INFO ] Deduced a trap composed of 5 places in 619 ms of which 9 ms to minimize.
[2024-06-01 17:14:44] [INFO ] Deduced a trap composed of 7 places in 608 ms of which 9 ms to minimize.
[2024-06-01 17:14:44] [INFO ] Deduced a trap composed of 9 places in 602 ms of which 9 ms to minimize.
[2024-06-01 17:14:45] [INFO ] Deduced a trap composed of 8 places in 592 ms of which 9 ms to minimize.
[2024-06-01 17:14:46] [INFO ] Deduced a trap composed of 8 places in 603 ms of which 8 ms to minimize.
[2024-06-01 17:14:46] [INFO ] Deduced a trap composed of 6 places in 583 ms of which 9 ms to minimize.
[2024-06-01 17:14:47] [INFO ] Deduced a trap composed of 9 places in 624 ms of which 8 ms to minimize.
[2024-06-01 17:14:48] [INFO ] Deduced a trap composed of 8 places in 624 ms of which 9 ms to minimize.
[2024-06-01 17:14:49] [INFO ] Deduced a trap composed of 10 places in 606 ms of which 9 ms to minimize.
[2024-06-01 17:14:49] [INFO ] Deduced a trap composed of 8 places in 561 ms of which 8 ms to minimize.
[2024-06-01 17:14:50] [INFO ] Deduced a trap composed of 6 places in 578 ms of which 8 ms to minimize.
[2024-06-01 17:14:51] [INFO ] Deduced a trap composed of 6 places in 567 ms of which 8 ms to minimize.
[2024-06-01 17:14:51] [INFO ] Deduced a trap composed of 10 places in 556 ms of which 8 ms to minimize.
[2024-06-01 17:14:52] [INFO ] Deduced a trap composed of 6 places in 587 ms of which 8 ms to minimize.
[2024-06-01 17:14:53] [INFO ] Deduced a trap composed of 11 places in 570 ms of which 8 ms to minimize.
[2024-06-01 17:14:53] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 13488 ms
[2024-06-01 17:14:54] [INFO ] Deduced a trap composed of 12 places in 591 ms of which 9 ms to minimize.
[2024-06-01 17:14:55] [INFO ] Deduced a trap composed of 8 places in 592 ms of which 9 ms to minimize.
[2024-06-01 17:14:56] [INFO ] Deduced a trap composed of 11 places in 594 ms of which 8 ms to minimize.
[2024-06-01 17:14:57] [INFO ] Deduced a trap composed of 9 places in 565 ms of which 9 ms to minimize.
[2024-06-01 17:14:57] [INFO ] Deduced a trap composed of 8 places in 588 ms of which 9 ms to minimize.
[2024-06-01 17:14:58] [INFO ] Deduced a trap composed of 10 places in 593 ms of which 9 ms to minimize.
[2024-06-01 17:14:59] [INFO ] Deduced a trap composed of 6 places in 582 ms of which 8 ms to minimize.
[2024-06-01 17:14:59] [INFO ] Deduced a trap composed of 10 places in 557 ms of which 8 ms to minimize.
[2024-06-01 17:15:00] [INFO ] Deduced a trap composed of 9 places in 559 ms of which 8 ms to minimize.
[2024-06-01 17:15:01] [INFO ] Deduced a trap composed of 13 places in 559 ms of which 8 ms to minimize.
[2024-06-01 17:15:01] [INFO ] Deduced a trap composed of 8 places in 534 ms of which 8 ms to minimize.
[2024-06-01 17:15:02] [INFO ] Deduced a trap composed of 8 places in 525 ms of which 8 ms to minimize.
[2024-06-01 17:15:03] [INFO ] Deduced a trap composed of 10 places in 526 ms of which 8 ms to minimize.
[2024-06-01 17:15:03] [INFO ] Deduced a trap composed of 12 places in 525 ms of which 8 ms to minimize.
[2024-06-01 17:15:04] [INFO ] Deduced a trap composed of 10 places in 520 ms of which 9 ms to minimize.
[2024-06-01 17:15:04] [INFO ] Deduced a trap composed of 9 places in 536 ms of which 9 ms to minimize.
[2024-06-01 17:15:05] [INFO ] Deduced a trap composed of 8 places in 543 ms of which 8 ms to minimize.
[2024-06-01 17:15:06] [INFO ] Deduced a trap composed of 9 places in 529 ms of which 7 ms to minimize.
[2024-06-01 17:15:06] [INFO ] Deduced a trap composed of 9 places in 530 ms of which 8 ms to minimize.
[2024-06-01 17:15:07] [INFO ] Deduced a trap composed of 10 places in 525 ms of which 9 ms to minimize.
[2024-06-01 17:15:08] [INFO ] Deduced a trap composed of 8 places in 530 ms of which 7 ms to minimize.
[2024-06-01 17:15:08] [INFO ] Deduced a trap composed of 10 places in 543 ms of which 8 ms to minimize.
[2024-06-01 17:15:09] [INFO ] Deduced a trap composed of 6 places in 516 ms of which 8 ms to minimize.
[2024-06-01 17:15:10] [INFO ] Deduced a trap composed of 10 places in 510 ms of which 8 ms to minimize.
[2024-06-01 17:15:10] [INFO ] Deduced a trap composed of 8 places in 512 ms of which 8 ms to minimize.
[2024-06-01 17:15:11] [INFO ] Deduced a trap composed of 10 places in 523 ms of which 8 ms to minimize.
[2024-06-01 17:15:11] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 17071 ms
[2024-06-01 17:15:13] [INFO ] Deduced a trap composed of 6 places in 821 ms of which 11 ms to minimize.
[2024-06-01 17:15:14] [INFO ] Deduced a trap composed of 6 places in 867 ms of which 11 ms to minimize.
[2024-06-01 17:15:15] [INFO ] Deduced a trap composed of 10 places in 786 ms of which 9 ms to minimize.
[2024-06-01 17:15:16] [INFO ] Deduced a trap composed of 4 places in 820 ms of which 10 ms to minimize.
[2024-06-01 17:15:17] [INFO ] Deduced a trap composed of 8 places in 806 ms of which 10 ms to minimize.
[2024-06-01 17:15:18] [INFO ] Deduced a trap composed of 7 places in 860 ms of which 11 ms to minimize.
[2024-06-01 17:15:19] [INFO ] Deduced a trap composed of 17 places in 768 ms of which 11 ms to minimize.
[2024-06-01 17:15:19] [INFO ] Deduced a trap composed of 7 places in 772 ms of which 10 ms to minimize.
[2024-06-01 17:15:20] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 7478 ms
[2024-06-01 17:15:21] [INFO ] Deduced a trap composed of 8 places in 786 ms of which 10 ms to minimize.
[2024-06-01 17:15:22] [INFO ] Deduced a trap composed of 7 places in 799 ms of which 11 ms to minimize.
[2024-06-01 17:15:22] [INFO ] Deduced a trap composed of 10 places in 759 ms of which 10 ms to minimize.
[2024-06-01 17:15:23] [INFO ] Deduced a trap composed of 11 places in 754 ms of which 10 ms to minimize.
[2024-06-01 17:15:24] [INFO ] Deduced a trap composed of 8 places in 788 ms of which 11 ms to minimize.
[2024-06-01 17:15:25] [INFO ] Deduced a trap composed of 10 places in 758 ms of which 11 ms to minimize.
[2024-06-01 17:15:26] [INFO ] Deduced a trap composed of 7 places in 795 ms of which 11 ms to minimize.
[2024-06-01 17:15:27] [INFO ] Deduced a trap composed of 9 places in 788 ms of which 10 ms to minimize.
[2024-06-01 17:15:28] [INFO ] Deduced a trap composed of 16 places in 802 ms of which 10 ms to minimize.
[2024-06-01 17:15:29] [INFO ] Deduced a trap composed of 11 places in 784 ms of which 10 ms to minimize.
[2024-06-01 17:15:29] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 9038 ms
[2024-06-01 17:15:34] [INFO ] Deduced a trap composed of 6 places in 744 ms of which 10 ms to minimize.
[2024-06-01 17:15:35] [INFO ] Deduced a trap composed of 6 places in 746 ms of which 11 ms to minimize.
[2024-06-01 17:15:36] [INFO ] Deduced a trap composed of 6 places in 747 ms of which 11 ms to minimize.
[2024-06-01 17:15:37] [INFO ] Deduced a trap composed of 6 places in 732 ms of which 9 ms to minimize.
[2024-06-01 17:15:38] [INFO ] Deduced a trap composed of 8 places in 727 ms of which 9 ms to minimize.
[2024-06-01 17:15:39] [INFO ] Deduced a trap composed of 6 places in 716 ms of which 10 ms to minimize.
[2024-06-01 17:15:40] [INFO ] Deduced a trap composed of 8 places in 707 ms of which 10 ms to minimize.
[2024-06-01 17:15:40] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 6084 ms
[2024-06-01 17:15:41] [INFO ] Deduced a trap composed of 4 places in 720 ms of which 10 ms to minimize.
[2024-06-01 17:15:42] [INFO ] Deduced a trap composed of 8 places in 720 ms of which 11 ms to minimize.
[2024-06-01 17:15:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1753 ms
[2024-06-01 17:15:43] [INFO ] Deduced a trap composed of 6 places in 680 ms of which 10 ms to minimize.
[2024-06-01 17:15:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 890 ms
[2024-06-01 17:15:50] [INFO ] Deduced a trap composed of 6 places in 630 ms of which 11 ms to minimize.
[2024-06-01 17:15:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 847 ms
[2024-06-01 17:15:51] [INFO ] Deduced a trap composed of 9 places in 666 ms of which 9 ms to minimize.
[2024-06-01 17:15:52] [INFO ] Deduced a trap composed of 11 places in 619 ms of which 9 ms to minimize.
[2024-06-01 17:15:52] [INFO ] Deduced a trap composed of 10 places in 630 ms of which 9 ms to minimize.
[2024-06-01 17:15:53] [INFO ] Deduced a trap composed of 12 places in 622 ms of which 10 ms to minimize.
[2024-06-01 17:15:54] [INFO ] Deduced a trap composed of 10 places in 658 ms of which 10 ms to minimize.
[2024-06-01 17:15:55] [INFO ] Deduced a trap composed of 8 places in 672 ms of which 10 ms to minimize.
[2024-06-01 17:15:55] [INFO ] Deduced a trap composed of 8 places in 658 ms of which 9 ms to minimize.
[2024-06-01 17:15:56] [INFO ] Deduced a trap composed of 10 places in 656 ms of which 10 ms to minimize.
[2024-06-01 17:15:57] [INFO ] Deduced a trap composed of 11 places in 662 ms of which 9 ms to minimize.
[2024-06-01 17:15:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 6998 ms
[2024-06-01 17:15:58] [INFO ] Deduced a trap composed of 12 places in 665 ms of which 9 ms to minimize.
[2024-06-01 17:15:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 856 ms
[2024-06-01 17:16:00] [INFO ] Deduced a trap composed of 7 places in 651 ms of which 8 ms to minimize.
[2024-06-01 17:16:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 855 ms
TRAPS : Iteration 1
[2024-06-01 17:16:02] [INFO ] Deduced a trap composed of 7 places in 558 ms of which 8 ms to minimize.
[2024-06-01 17:16:03] [INFO ] Deduced a trap composed of 6 places in 535 ms of which 8 ms to minimize.
[2024-06-01 17:16:03] [INFO ] Deduced a trap composed of 11 places in 539 ms of which 9 ms to minimize.
[2024-06-01 17:16:04] [INFO ] Deduced a trap composed of 9 places in 523 ms of which 8 ms to minimize.
[2024-06-01 17:16:05] [INFO ] Deduced a trap composed of 8 places in 556 ms of which 9 ms to minimize.
[2024-06-01 17:16:05] [INFO ] Deduced a trap composed of 10 places in 506 ms of which 8 ms to minimize.
[2024-06-01 17:16:06] [INFO ] Deduced a trap composed of 11 places in 520 ms of which 7 ms to minimize.
[2024-06-01 17:16:06] [INFO ] Deduced a trap composed of 11 places in 520 ms of which 8 ms to minimize.
[2024-06-01 17:16:07] [INFO ] Deduced a trap composed of 8 places in 527 ms of which 8 ms to minimize.
[2024-06-01 17:16:08] [INFO ] Deduced a trap composed of 10 places in 503 ms of which 7 ms to minimize.
[2024-06-01 17:16:08] [INFO ] Deduced a trap composed of 11 places in 498 ms of which 7 ms to minimize.
[2024-06-01 17:16:09] [INFO ] Deduced a trap composed of 7 places in 533 ms of which 7 ms to minimize.
[2024-06-01 17:16:10] [INFO ] Deduced a trap composed of 5 places in 497 ms of which 7 ms to minimize.
[2024-06-01 17:16:10] [INFO ] Deduced a trap composed of 12 places in 472 ms of which 7 ms to minimize.
[2024-06-01 17:16:11] [INFO ] Deduced a trap composed of 7 places in 455 ms of which 7 ms to minimize.
[2024-06-01 17:16:11] [INFO ] Deduced a trap composed of 7 places in 486 ms of which 7 ms to minimize.
[2024-06-01 17:16:12] [INFO ] Deduced a trap composed of 10 places in 511 ms of which 7 ms to minimize.
[2024-06-01 17:16:12] [INFO ] Deduced a trap composed of 6 places in 470 ms of which 7 ms to minimize.
[2024-06-01 17:16:13] [INFO ] Deduced a trap composed of 13 places in 479 ms of which 7 ms to minimize.
[2024-06-01 17:16:14] [INFO ] Deduced a trap composed of 8 places in 469 ms of which 8 ms to minimize.
[2024-06-01 17:16:14] [INFO ] Deduced a trap composed of 10 places in 462 ms of which 7 ms to minimize.
[2024-06-01 17:16:15] [INFO ] Deduced a trap composed of 12 places in 460 ms of which 8 ms to minimize.
[2024-06-01 17:16:15] [INFO ] Deduced a trap composed of 6 places in 470 ms of which 7 ms to minimize.
[2024-06-01 17:16:16] [INFO ] Deduced a trap composed of 10 places in 469 ms of which 8 ms to minimize.
[2024-06-01 17:16:17] [INFO ] Deduced a trap composed of 12 places in 463 ms of which 6 ms to minimize.
[2024-06-01 17:16:17] [INFO ] Deduced a trap composed of 10 places in 443 ms of which 7 ms to minimize.
[2024-06-01 17:16:18] [INFO ] Deduced a trap composed of 8 places in 449 ms of which 7 ms to minimize.
[2024-06-01 17:16:18] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 16542 ms
[2024-06-01 17:16:19] [INFO ] Deduced a trap composed of 6 places in 424 ms of which 7 ms to minimize.
[2024-06-01 17:16:20] [INFO ] Deduced a trap composed of 8 places in 441 ms of which 10 ms to minimize.
[2024-06-01 17:16:20] [INFO ] Deduced a trap composed of 9 places in 421 ms of which 6 ms to minimize.
[2024-06-01 17:16:21] [INFO ] Deduced a trap composed of 8 places in 450 ms of which 7 ms to minimize.
[2024-06-01 17:16:21] [INFO ] Deduced a trap composed of 7 places in 460 ms of which 6 ms to minimize.
[2024-06-01 17:16:22] [INFO ] Deduced a trap composed of 8 places in 487 ms of which 7 ms to minimize.
[2024-06-01 17:16:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3430 ms
[2024-06-01 17:16:30] [INFO ] Deduced a trap composed of 8 places in 1149 ms of which 13 ms to minimize.
[2024-06-01 17:16:31] [INFO ] Deduced a trap composed of 6 places in 1156 ms of which 13 ms to minimize.
[2024-06-01 17:16:33] [INFO ] Deduced a trap composed of 6 places in 1134 ms of which 13 ms to minimize.
[2024-06-01 17:16:34] [INFO ] Deduced a trap composed of 14 places in 1132 ms of which 14 ms to minimize.
[2024-06-01 17:16:35] [INFO ] Deduced a trap composed of 6 places in 1181 ms of which 13 ms to minimize.
[2024-06-01 17:16:36] [INFO ] Deduced a trap composed of 8 places in 1167 ms of which 13 ms to minimize.
[2024-06-01 17:16:38] [INFO ] Deduced a trap composed of 6 places in 1188 ms of which 19 ms to minimize.
[2024-06-01 17:16:39] [INFO ] Deduced a trap composed of 7 places in 1170 ms of which 14 ms to minimize.
[2024-06-01 17:16:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 10229 ms
[2024-06-01 17:16:43] [INFO ] Deduced a trap composed of 5 places in 700 ms of which 10 ms to minimize.
[2024-06-01 17:16:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 912 ms
[2024-06-01 17:16:45] [INFO ] Deduced a trap composed of 10 places in 581 ms of which 9 ms to minimize.
[2024-06-01 17:16:45] [INFO ] Deduced a trap composed of 9 places in 590 ms of which 8 ms to minimize.
[2024-06-01 17:16:46] [INFO ] Deduced a trap composed of 7 places in 579 ms of which 8 ms to minimize.
[2024-06-01 17:16:47] [INFO ] Deduced a trap composed of 10 places in 574 ms of which 8 ms to minimize.
[2024-06-01 17:16:47] [INFO ] Deduced a trap composed of 9 places in 579 ms of which 9 ms to minimize.
[2024-06-01 17:16:48] [INFO ] Deduced a trap composed of 8 places in 555 ms of which 8 ms to minimize.
[2024-06-01 17:16:49] [INFO ] Deduced a trap composed of 8 places in 568 ms of which 8 ms to minimize.
[2024-06-01 17:16:49] [INFO ] Deduced a trap composed of 6 places in 563 ms of which 8 ms to minimize.
[2024-06-01 17:16:50] [INFO ] Deduced a trap composed of 10 places in 569 ms of which 7 ms to minimize.
[2024-06-01 17:16:50] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 6175 ms
[2024-06-01 17:16:53] [INFO ] Deduced a trap composed of 5 places in 574 ms of which 8 ms to minimize.
[2024-06-01 17:16:54] [INFO ] Deduced a trap composed of 8 places in 599 ms of which 8 ms to minimize.
[2024-06-01 17:16:54] [INFO ] Deduced a trap composed of 8 places in 600 ms of which 9 ms to minimize.
[2024-06-01 17:16:55] [INFO ] Deduced a trap composed of 6 places in 609 ms of which 9 ms to minimize.
[2024-06-01 17:16:56] [INFO ] Deduced a trap composed of 8 places in 601 ms of which 8 ms to minimize.
[2024-06-01 17:16:57] [INFO ] Deduced a trap composed of 6 places in 576 ms of which 8 ms to minimize.
[2024-06-01 17:16:57] [INFO ] Deduced a trap composed of 8 places in 583 ms of which 9 ms to minimize.
[2024-06-01 17:16:58] [INFO ] Deduced a trap composed of 6 places in 579 ms of which 9 ms to minimize.
[2024-06-01 17:16:59] [INFO ] Deduced a trap composed of 13 places in 551 ms of which 9 ms to minimize.
[2024-06-01 17:17:00] [INFO ] Deduced a trap composed of 6 places in 574 ms of which 8 ms to minimize.
[2024-06-01 17:17:00] [INFO ] Deduced a trap composed of 6 places in 557 ms of which 8 ms to minimize.
[2024-06-01 17:17:01] [INFO ] Deduced a trap composed of 9 places in 546 ms of which 8 ms to minimize.
[2024-06-01 17:17:02] [INFO ] Deduced a trap composed of 12 places in 513 ms of which 8 ms to minimize.
[2024-06-01 17:17:02] [INFO ] Deduced a trap composed of 10 places in 516 ms of which 8 ms to minimize.
[2024-06-01 17:17:03] [INFO ] Deduced a trap composed of 8 places in 547 ms of which 8 ms to minimize.
[2024-06-01 17:17:04] [INFO ] Deduced a trap composed of 10 places in 555 ms of which 8 ms to minimize.
[2024-06-01 17:17:04] [INFO ] Deduced a trap composed of 8 places in 548 ms of which 8 ms to minimize.
[2024-06-01 17:17:05] [INFO ] Deduced a trap composed of 8 places in 560 ms of which 9 ms to minimize.
[2024-06-01 17:17:05] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 12705 ms
TRAPS : Iteration 2
[2024-06-01 17:17:06] [INFO ] Deduced a trap composed of 5 places in 509 ms of which 7 ms to minimize.
[2024-06-01 17:17:07] [INFO ] Deduced a trap composed of 8 places in 528 ms of which 8 ms to minimize.
[2024-06-01 17:17:08] [INFO ] Deduced a trap composed of 8 places in 491 ms of which 7 ms to minimize.
[2024-06-01 17:17:08] [INFO ] Deduced a trap composed of 10 places in 492 ms of which 8 ms to minimize.
[2024-06-01 17:17:09] [INFO ] Deduced a trap composed of 8 places in 486 ms of which 7 ms to minimize.
[2024-06-01 17:17:09] [INFO ] Deduced a trap composed of 12 places in 485 ms of which 7 ms to minimize.
[2024-06-01 17:17:10] [INFO ] Deduced a trap composed of 12 places in 491 ms of which 7 ms to minimize.
[2024-06-01 17:17:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4372 ms
[2024-06-01 17:17:11] [INFO ] Deduced a trap composed of 11 places in 476 ms of which 7 ms to minimize.
[2024-06-01 17:17:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 695 ms
[2024-06-01 17:17:31] [INFO ] Deduced a trap composed of 7 places in 837 ms of which 11 ms to minimize.
[2024-06-01 17:17:32] [INFO ] Deduced a trap composed of 6 places in 792 ms of which 11 ms to minimize.
[2024-06-01 17:17:33] [INFO ] Deduced a trap composed of 6 places in 797 ms of which 10 ms to minimize.
[2024-06-01 17:17:34] [INFO ] Deduced a trap composed of 9 places in 775 ms of which 10 ms to minimize.
[2024-06-01 17:17:35] [INFO ] Deduced a trap composed of 8 places in 791 ms of which 10 ms to minimize.
[2024-06-01 17:17:36] [INFO ] Deduced a trap composed of 6 places in 758 ms of which 12 ms to minimize.
[2024-06-01 17:17:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5579 ms
[2024-06-01 17:17:47] [INFO ] Deduced a trap composed of 9 places in 618 ms of which 9 ms to minimize.
[2024-06-01 17:17:47] [INFO ] Deduced a trap composed of 4 places in 608 ms of which 9 ms to minimize.
[2024-06-01 17:17:48] [INFO ] Deduced a trap composed of 8 places in 597 ms of which 10 ms to minimize.
[2024-06-01 17:17:49] [INFO ] Deduced a trap composed of 5 places in 601 ms of which 9 ms to minimize.
[2024-06-01 17:17:50] [INFO ] Deduced a trap composed of 7 places in 599 ms of which 9 ms to minimize.
[2024-06-01 17:17:50] [INFO ] Deduced a trap composed of 8 places in 599 ms of which 8 ms to minimize.
[2024-06-01 17:17:51] [INFO ] Deduced a trap composed of 8 places in 563 ms of which 8 ms to minimize.
[2024-06-01 17:17:52] [INFO ] Deduced a trap composed of 6 places in 559 ms of which 9 ms to minimize.
[2024-06-01 17:17:52] [INFO ] Deduced a trap composed of 8 places in 555 ms of which 7 ms to minimize.
[2024-06-01 17:17:53] [INFO ] Deduced a trap composed of 10 places in 568 ms of which 9 ms to minimize.
[2024-06-01 17:17:54] [INFO ] Deduced a trap composed of 11 places in 559 ms of which 8 ms to minimize.
[2024-06-01 17:17:54] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 8120 ms
[2024-06-01 17:17:55] [INFO ] Deduced a trap composed of 6 places in 569 ms of which 8 ms to minimize.
[2024-06-01 17:17:56] [INFO ] Deduced a trap composed of 6 places in 575 ms of which 9 ms to minimize.
[2024-06-01 17:17:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1455 ms
[2024-06-01 17:17:57] [INFO ] Deduced a trap composed of 6 places in 622 ms of which 9 ms to minimize.
[2024-06-01 17:17:58] [INFO ] Deduced a trap composed of 10 places in 634 ms of which 9 ms to minimize.
[2024-06-01 17:17:59] [INFO ] Deduced a trap composed of 6 places in 587 ms of which 9 ms to minimize.
[2024-06-01 17:18:00] [INFO ] Deduced a trap composed of 8 places in 613 ms of which 8 ms to minimize.
[2024-06-01 17:18:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3024 ms
TRAPS : Iteration 3
[2024-06-01 17:18:01] [INFO ] Deduced a trap composed of 6 places in 600 ms of which 8 ms to minimize.
[2024-06-01 17:18:01] [INFO ] Deduced a trap composed of 6 places in 577 ms of which 8 ms to minimize.
[2024-06-01 17:18:02] [INFO ] Deduced a trap composed of 10 places in 593 ms of which 8 ms to minimize.
[2024-06-01 17:18:03] [INFO ] Deduced a trap composed of 8 places in 584 ms of which 9 ms to minimize.
[2024-06-01 17:18:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2877 ms
[2024-06-01 17:18:04] [INFO ] Deduced a trap composed of 8 places in 555 ms of which 9 ms to minimize.
[2024-06-01 17:18:05] [INFO ] Deduced a trap composed of 10 places in 561 ms of which 8 ms to minimize.
[2024-06-01 17:18:05] [INFO ] Deduced a trap composed of 11 places in 538 ms of which 8 ms to minimize.
[2024-06-01 17:18:06] [INFO ] Deduced a trap composed of 10 places in 538 ms of which 8 ms to minimize.
[2024-06-01 17:18:06] [INFO ] Deduced a trap composed of 9 places in 549 ms of which 9 ms to minimize.
[2024-06-01 17:18:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3352 ms
[2024-06-01 17:18:08] [INFO ] Deduced a trap composed of 8 places in 500 ms of which 7 ms to minimize.
[2024-06-01 17:18:09] [INFO ] Deduced a trap composed of 8 places in 498 ms of which 8 ms to minimize.
[2024-06-01 17:18:09] [INFO ] Deduced a trap composed of 8 places in 484 ms of which 7 ms to minimize.
[2024-06-01 17:18:10] [INFO ] Deduced a trap composed of 9 places in 485 ms of which 7 ms to minimize.
[2024-06-01 17:18:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2479 ms
[2024-06-01 17:18:14] [INFO ] Deduced a trap composed of 7 places in 1384 ms of which 15 ms to minimize.
[2024-06-01 17:18:16] [INFO ] Deduced a trap composed of 7 places in 1363 ms of which 15 ms to minimize.
[2024-06-01 17:18:17] [INFO ] Deduced a trap composed of 7 places in 1370 ms of which 15 ms to minimize.
[2024-06-01 17:18:19] [INFO ] Deduced a trap composed of 10 places in 1340 ms of which 14 ms to minimize.
[2024-06-01 17:18:20] [INFO ] Deduced a trap composed of 12 places in 1296 ms of which 13 ms to minimize.
[2024-06-01 17:18:22] [INFO ] Deduced a trap composed of 6 places in 1352 ms of which 15 ms to minimize.
[2024-06-01 17:18:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 9077 ms
[2024-06-01 17:18:24] [INFO ] Deduced a trap composed of 6 places in 798 ms of which 10 ms to minimize.
[2024-06-01 17:18:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1003 ms
[2024-06-01 17:18:30] [INFO ] Deduced a trap composed of 13 places in 640 ms of which 9 ms to minimize.
[2024-06-01 17:18:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 849 ms
[2024-06-01 17:18:31] [INFO ] Deduced a trap composed of 13 places in 617 ms of which 9 ms to minimize.
[2024-06-01 17:18:32] [INFO ] Deduced a trap composed of 10 places in 610 ms of which 9 ms to minimize.
[2024-06-01 17:18:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1522 ms
[2024-06-01 17:18:34] [INFO ] Deduced a trap composed of 8 places in 507 ms of which 8 ms to minimize.
[2024-06-01 17:18:35] [INFO ] Deduced a trap composed of 6 places in 494 ms of which 7 ms to minimize.
[2024-06-01 17:18:35] [INFO ] Deduced a trap composed of 7 places in 511 ms of which 8 ms to minimize.
[2024-06-01 17:18:36] [INFO ] Deduced a trap composed of 6 places in 484 ms of which 8 ms to minimize.
[2024-06-01 17:18:37] [INFO ] Deduced a trap composed of 7 places in 504 ms of which 8 ms to minimize.
[2024-06-01 17:18:37] [INFO ] Deduced a trap composed of 9 places in 499 ms of which 7 ms to minimize.
[2024-06-01 17:18:38] [INFO ] Deduced a trap composed of 7 places in 466 ms of which 8 ms to minimize.
[2024-06-01 17:18:38] [INFO ] Deduced a trap composed of 6 places in 466 ms of which 7 ms to minimize.
[2024-06-01 17:18:39] [INFO ] Deduced a trap composed of 8 places in 464 ms of which 7 ms to minimize.
[2024-06-01 17:18:40] [INFO ] Deduced a trap composed of 6 places in 462 ms of which 7 ms to minimize.
[2024-06-01 17:18:40] [INFO ] Deduced a trap composed of 6 places in 441 ms of which 7 ms to minimize.
[2024-06-01 17:18:41] [INFO ] Deduced a trap composed of 12 places in 441 ms of which 7 ms to minimize.
[2024-06-01 17:18:41] [INFO ] Deduced a trap composed of 12 places in 455 ms of which 7 ms to minimize.
[2024-06-01 17:18:42] [INFO ] Deduced a trap composed of 10 places in 444 ms of which 7 ms to minimize.
[2024-06-01 17:18:42] [INFO ] Deduced a trap composed of 11 places in 466 ms of which 6 ms to minimize.
[2024-06-01 17:18:43] [INFO ] Deduced a trap composed of 15 places in 471 ms of which 8 ms to minimize.
[2024-06-01 17:18:44] [INFO ] Deduced a trap composed of 13 places in 458 ms of which 7 ms to minimize.
[2024-06-01 17:18:44] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 10041 ms
TRAPS : Iteration 4
[2024-06-01 17:18:45] [INFO ] Deduced a trap composed of 6 places in 439 ms of which 7 ms to minimize.
[2024-06-01 17:18:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 637 ms
[2024-06-01 17:18:49] [INFO ] Deduced a trap composed of 8 places in 1323 ms of which 14 ms to minimize.
[2024-06-01 17:18:50] [INFO ] Deduced a trap composed of 6 places in 1326 ms of which 14 ms to minimize.
[2024-06-01 17:18:52] [INFO ] Deduced a trap composed of 6 places in 1359 ms of which 16 ms to minimize.
[2024-06-01 17:18:53] [INFO ] Deduced a trap composed of 8 places in 1300 ms of which 14 ms to minimize.
[2024-06-01 17:18:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 5909 ms
[2024-06-01 17:18:59] [INFO ] Deduced a trap composed of 8 places in 552 ms of which 8 ms to minimize.
[2024-06-01 17:18:59] [INFO ] Deduced a trap composed of 12 places in 547 ms of which 8 ms to minimize.
[2024-06-01 17:19:00] [INFO ] Deduced a trap composed of 11 places in 564 ms of which 8 ms to minimize.
[2024-06-01 17:19:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2129 ms
[2024-06-01 17:19:01] [INFO ] Deduced a trap composed of 8 places in 540 ms of which 8 ms to minimize.
[2024-06-01 17:19:02] [INFO ] Deduced a trap composed of 8 places in 546 ms of which 8 ms to minimize.
[2024-06-01 17:19:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1381 ms
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 9 places in 524 ms of which 8 ms to minimize.
[2024-06-01 17:19:04] [INFO ] Deduced a trap composed of 11 places in 570 ms of which 7 ms to minimize.
[2024-06-01 17:19:05] [INFO ] Deduced a trap composed of 7 places in 539 ms of which 8 ms to minimize.
[2024-06-01 17:19:06] [INFO ] Deduced a trap composed of 9 places in 536 ms of which 8 ms to minimize.
[2024-06-01 17:19:06] [INFO ] Deduced a trap composed of 8 places in 499 ms of which 7 ms to minimize.
[2024-06-01 17:19:07] [INFO ] Deduced a trap composed of 11 places in 500 ms of which 8 ms to minimize.
[2024-06-01 17:19:08] [INFO ] Deduced a trap composed of 11 places in 523 ms of which 8 ms to minimize.
[2024-06-01 17:19:08] [INFO ] Deduced a trap composed of 6 places in 476 ms of which 7 ms to minimize.
[2024-06-01 17:19:08] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5237 ms
TRAPS : Iteration 5
[2024-06-01 17:19:10] [INFO ] Deduced a trap composed of 9 places in 517 ms of which 7 ms to minimize.
[2024-06-01 17:19:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 729 ms
[2024-06-01 17:19:17] [INFO ] Deduced a trap composed of 10 places in 794 ms of which 11 ms to minimize.
[2024-06-01 17:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1005 ms
[2024-06-01 17:19:25] [INFO ] Deduced a trap composed of 9 places in 536 ms of which 8 ms to minimize.
[2024-06-01 17:19:25] [INFO ] Deduced a trap composed of 9 places in 509 ms of which 8 ms to minimize.
[2024-06-01 17:19:26] [INFO ] Deduced a trap composed of 8 places in 505 ms of which 7 ms to minimize.
[2024-06-01 17:19:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2054 ms
[2024-06-01 17:19:28] [INFO ] Deduced a trap composed of 10 places in 504 ms of which 8 ms to minimize.
[2024-06-01 17:19:29] [INFO ] Deduced a trap composed of 10 places in 518 ms of which 7 ms to minimize.
[2024-06-01 17:19:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1343 ms
TRAPS : Iteration 6
[2024-06-01 17:19:30] [INFO ] Deduced a trap composed of 11 places in 529 ms of which 8 ms to minimize.
[2024-06-01 17:19:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 724 ms
[2024-06-01 17:19:33] [INFO ] Deduced a trap composed of 8 places in 788 ms of which 9 ms to minimize.
[2024-06-01 17:19:34] [INFO ] Deduced a trap composed of 6 places in 835 ms of which 10 ms to minimize.
[2024-06-01 17:19:35] [INFO ] Deduced a trap composed of 8 places in 801 ms of which 11 ms to minimize.
[2024-06-01 17:19:35] [INFO ] Deduced a trap composed of 6 places in 817 ms of which 11 ms to minimize.
[2024-06-01 17:19:36] [INFO ] Deduced a trap composed of 10 places in 793 ms of which 10 ms to minimize.
[2024-06-01 17:19:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4781 ms
[2024-06-01 17:19:45] [INFO ] Deduced a trap composed of 9 places in 719 ms of which 9 ms to minimize.
[2024-06-01 17:19:46] [INFO ] Deduced a trap composed of 9 places in 681 ms of which 9 ms to minimize.
[2024-06-01 17:19:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1744 ms
[2024-06-01 17:19:48] [INFO ] Deduced a trap composed of 8 places in 645 ms of which 9 ms to minimize.
[2024-06-01 17:19:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 854 ms
[2024-06-01 17:19:56] [INFO ] Deduced a trap composed of 8 places in 647 ms of which 8 ms to minimize.
[2024-06-01 17:19:57] [INFO ] Deduced a trap composed of 12 places in 636 ms of which 9 ms to minimize.
[2024-06-01 17:19:58] [INFO ] Deduced a trap composed of 6 places in 619 ms of which 10 ms to minimize.
[2024-06-01 17:19:58] [INFO ] Deduced a trap composed of 6 places in 613 ms of which 8 ms to minimize.
[2024-06-01 17:19:59] [INFO ] Deduced a trap composed of 11 places in 626 ms of which 8 ms to minimize.
[2024-06-01 17:20:00] [INFO ] Deduced a trap composed of 8 places in 613 ms of which 8 ms to minimize.
[2024-06-01 17:20:01] [INFO ] Deduced a trap composed of 8 places in 618 ms of which 9 ms to minimize.
[2024-06-01 17:20:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5426 ms
[2024-06-01 17:20:03] [INFO ] Deduced a trap composed of 9 places in 574 ms of which 8 ms to minimize.
[2024-06-01 17:20:03] [INFO ] Deduced a trap composed of 8 places in 577 ms of which 8 ms to minimize.
[2024-06-01 17:20:04] [INFO ] Deduced a trap composed of 12 places in 578 ms of which 8 ms to minimize.
[2024-06-01 17:20:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2177 ms
[2024-06-01 17:20:06] [INFO ] Deduced a trap composed of 9 places in 513 ms of which 8 ms to minimize.
[2024-06-01 17:20:07] [INFO ] Deduced a trap composed of 7 places in 497 ms of which 7 ms to minimize.
[2024-06-01 17:20:07] [INFO ] Deduced a trap composed of 10 places in 518 ms of which 7 ms to minimize.
[2024-06-01 17:20:08] [INFO ] Deduced a trap composed of 9 places in 507 ms of which 9 ms to minimize.
[2024-06-01 17:20:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2604 ms
TRAPS : Iteration 7
[2024-06-01 17:20:10] [INFO ] Deduced a trap composed of 9 places in 431 ms of which 7 ms to minimize.
[2024-06-01 17:20:11] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 7 ms to minimize.
[2024-06-01 17:20:11] [INFO ] Deduced a trap composed of 13 places in 423 ms of which 7 ms to minimize.
[2024-06-01 17:20:12] [INFO ] Deduced a trap composed of 15 places in 427 ms of which 6 ms to minimize.
[2024-06-01 17:20:12] [INFO ] Deduced a trap composed of 8 places in 425 ms of which 6 ms to minimize.
[2024-06-01 17:20:13] [INFO ] Deduced a trap composed of 10 places in 430 ms of which 6 ms to minimize.
[2024-06-01 17:20:13] [INFO ] Deduced a trap composed of 8 places in 411 ms of which 7 ms to minimize.
[2024-06-01 17:20:14] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4094 ms
[2024-06-01 17:20:14] [INFO ] Deduced a trap composed of 8 places in 412 ms of which 6 ms to minimize.
[2024-06-01 17:20:15] [INFO ] Deduced a trap composed of 13 places in 366 ms of which 6 ms to minimize.
[2024-06-01 17:20:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1079 ms
[2024-06-01 17:20:22] [INFO ] Deduced a trap composed of 6 places in 1182 ms of which 13 ms to minimize.
[2024-06-01 17:20:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1379 ms
[2024-06-01 17:20:28] [INFO ] Deduced a trap composed of 8 places in 617 ms of which 9 ms to minimize.
[2024-06-01 17:20:28] [INFO ] Deduced a trap composed of 8 places in 627 ms of which 8 ms to minimize.
[2024-06-01 17:20:29] [INFO ] Deduced a trap composed of 6 places in 583 ms of which 8 ms to minimize.
[2024-06-01 17:20:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2223 ms
[2024-06-01 17:20:31] [INFO ] Deduced a trap composed of 8 places in 585 ms of which 9 ms to minimize.
[2024-06-01 17:20:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 791 ms
TRAPS : Iteration 8
[2024-06-01 17:20:33] [INFO ] Deduced a trap composed of 14 places in 558 ms of which 8 ms to minimize.
[2024-06-01 17:20:33] [INFO ] Deduced a trap composed of 8 places in 537 ms of which 9 ms to minimize.
[2024-06-01 17:20:34] [INFO ] Deduced a trap composed of 9 places in 534 ms of which 8 ms to minimize.
[2024-06-01 17:20:35] [INFO ] Deduced a trap composed of 9 places in 519 ms of which 9 ms to minimize.
[2024-06-01 17:20:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2722 ms
[2024-06-01 17:20:39] [INFO ] Deduced a trap composed of 7 places in 1298 ms of which 14 ms to minimize.
[2024-06-01 17:20:41] [INFO ] Deduced a trap composed of 5 places in 1386 ms of which 14 ms to minimize.
[2024-06-01 17:20:42] [INFO ] Deduced a trap composed of 6 places in 1306 ms of which 13 ms to minimize.
[2024-06-01 17:20:44] [INFO ] Deduced a trap composed of 7 places in 1328 ms of which 14 ms to minimize.
[2024-06-01 17:20:45] [INFO ] Deduced a trap composed of 10 places in 1225 ms of which 13 ms to minimize.
[2024-06-01 17:20:46] [INFO ] Deduced a trap composed of 5 places in 1292 ms of which 13 ms to minimize.
[2024-06-01 17:20:48] [INFO ] Deduced a trap composed of 6 places in 1279 ms of which 13 ms to minimize.
[2024-06-01 17:20:49] [INFO ] Deduced a trap composed of 3 places in 1261 ms of which 14 ms to minimize.
[2024-06-01 17:20:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 11300 ms
[2024-06-01 17:20:51] [INFO ] Deduced a trap composed of 6 places in 1015 ms of which 12 ms to minimize.
[2024-06-01 17:20:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1287 ms
[2024-06-01 17:20:58] [INFO ] Deduced a trap composed of 8 places in 511 ms of which 8 ms to minimize.
[2024-06-01 17:20:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 731 ms
[2024-06-01 17:20:59] [INFO ] Deduced a trap composed of 13 places in 497 ms of which 8 ms to minimize.
[2024-06-01 17:21:00] [INFO ] Deduced a trap composed of 17 places in 495 ms of which 9 ms to minimize.
[2024-06-01 17:21:01] [INFO ] Deduced a trap composed of 10 places in 514 ms of which 8 ms to minimize.
[2024-06-01 17:21:01] [INFO ] Deduced a trap composed of 8 places in 507 ms of which 7 ms to minimize.
[2024-06-01 17:21:02] [INFO ] Deduced a trap composed of 10 places in 509 ms of which 8 ms to minimize.
[2024-06-01 17:21:03] [INFO ] Deduced a trap composed of 9 places in 519 ms of which 8 ms to minimize.
[2024-06-01 17:21:03] [INFO ] Deduced a trap composed of 8 places in 493 ms of which 8 ms to minimize.
[2024-06-01 17:21:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4556 ms
TRAPS : Iteration 9
[2024-06-01 17:21:08] [INFO ] Deduced a trap composed of 14 places in 493 ms of which 8 ms to minimize.
[2024-06-01 17:21:08] [INFO ] Deduced a trap composed of 8 places in 477 ms of which 7 ms to minimize.
[2024-06-01 17:21:09] [INFO ] Deduced a trap composed of 12 places in 487 ms of which 7 ms to minimize.
[2024-06-01 17:21:09] [INFO ] Deduced a trap composed of 10 places in 471 ms of which 7 ms to minimize.
[2024-06-01 17:21:10] [INFO ] Deduced a trap composed of 17 places in 472 ms of which 7 ms to minimize.
[2024-06-01 17:21:11] [INFO ] Deduced a trap composed of 11 places in 470 ms of which 7 ms to minimize.
[2024-06-01 17:21:11] [INFO ] Deduced a trap composed of 10 places in 468 ms of which 7 ms to minimize.
[2024-06-01 17:21:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4396 ms
[2024-06-01 17:21:13] [INFO ] Deduced a trap composed of 8 places in 483 ms of which 8 ms to minimize.
[2024-06-01 17:21:14] [INFO ] Deduced a trap composed of 7 places in 481 ms of which 7 ms to minimize.
[2024-06-01 17:21:14] [INFO ] Deduced a trap composed of 7 places in 467 ms of which 8 ms to minimize.
[2024-06-01 17:21:15] [INFO ] Deduced a trap composed of 8 places in 476 ms of which 8 ms to minimize.
[2024-06-01 17:21:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2492 ms
[2024-06-01 17:21:17] [INFO ] Deduced a trap composed of 6 places in 714 ms of which 10 ms to minimize.
[2024-06-01 17:21:18] [INFO ] Deduced a trap composed of 12 places in 1329 ms of which 14 ms to minimize.
[2024-06-01 17:21:20] [INFO ] Deduced a trap composed of 18 places in 1315 ms of which 14 ms to minimize.
[2024-06-01 17:21:21] [INFO ] Deduced a trap composed of 7 places in 1314 ms of which 13 ms to minimize.
[2024-06-01 17:21:23] [INFO ] Deduced a trap composed of 6 places in 1313 ms of which 13 ms to minimize.
[2024-06-01 17:21:24] [INFO ] Deduced a trap composed of 6 places in 1289 ms of which 13 ms to minimize.
[2024-06-01 17:21:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 8109 ms
[2024-06-01 17:21:36] [INFO ] Deduced a trap composed of 5 places in 778 ms of which 10 ms to minimize.
[2024-06-01 17:21:37] [INFO ] Deduced a trap composed of 11 places in 797 ms of which 10 ms to minimize.
[2024-06-01 17:21:37] [INFO ] Deduced a trap composed of 6 places in 762 ms of which 10 ms to minimize.
[2024-06-01 17:21:38] [INFO ] Deduced a trap composed of 5 places in 785 ms of which 10 ms to minimize.
[2024-06-01 17:21:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3679 ms
[2024-06-01 17:21:40] [INFO ] Deduced a trap composed of 6 places in 756 ms of which 10 ms to minimize.
[2024-06-01 17:21:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 939 ms
[2024-06-01 17:21:48] [INFO ] Deduced a trap composed of 6 places in 557 ms of which 8 ms to minimize.
[2024-06-01 17:21:49] [INFO ] Deduced a trap composed of 6 places in 565 ms of which 8 ms to minimize.
[2024-06-01 17:21:50] [INFO ] Deduced a trap composed of 10 places in 562 ms of which 8 ms to minimize.
[2024-06-01 17:21:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2172 ms
[2024-06-01 17:21:51] [INFO ] Deduced a trap composed of 8 places in 418 ms of which 8 ms to minimize.
[2024-06-01 17:21:51] [INFO ] Deduced a trap composed of 10 places in 463 ms of which 7 ms to minimize.
[2024-06-01 17:21:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1186 ms
TRAPS : Iteration 10
[2024-06-01 17:21:55] [INFO ] After 446343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-06-01 17:21:55] [INFO ] After 450035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 451469 ms.
[2024-06-01 17:21:55] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-06-01 17:21:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2683 places, 2252 transitions and 10120 arcs took 18 ms.
[2024-06-01 17:21:55] [INFO ] Flatten gal took : 266 ms
Total runtime 731237 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityFireability-2023-00
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityFireability-2024-03
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityFireability-2024-05
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityFireability-2024-06
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityFireability-2024-08
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityFireability-2024-09
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityFireability-2024-10
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityFireability-2024-11
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityFireability-2024-12
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityFireability-2024-13
Could not compute solution for formula : ShieldPPPt-PT-100B-ReachabilityFireability-2024-15

BK_STOP 1717262515943

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
mcc2024
rfs formula name ShieldPPPt-PT-100B-ReachabilityFireability-2023-00
rfs formula type EF
rfs formula formula --invariant=/tmp/1999/inv_0_
rfs formula name ShieldPPPt-PT-100B-ReachabilityFireability-2024-03
rfs formula type EF
rfs formula formula --invariant=/tmp/1999/inv_1_
rfs formula name ShieldPPPt-PT-100B-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/1999/inv_2_
rfs formula name ShieldPPPt-PT-100B-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/1999/inv_3_
rfs formula name ShieldPPPt-PT-100B-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/1999/inv_4_
rfs formula name ShieldPPPt-PT-100B-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/1999/inv_5_
rfs formula name ShieldPPPt-PT-100B-ReachabilityFireability-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/1999/inv_6_
rfs formula name ShieldPPPt-PT-100B-ReachabilityFireability-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/1999/inv_7_
rfs formula name ShieldPPPt-PT-100B-ReachabilityFireability-2024-12
rfs formula type AG
rfs formula formula --invariant=/tmp/1999/inv_8_
rfs formula name ShieldPPPt-PT-100B-ReachabilityFireability-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/1999/inv_9_
rfs formula name ShieldPPPt-PT-100B-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/1999/inv_10_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-100B, 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 r528-tall-171683761700703"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;