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-171683762000846.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 ShieldRVs-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762000846
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 17:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 498K 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 ShieldRVs-PT-040B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVs-PT-040B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717269815147

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:23:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:23:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:23:36] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2024-06-01 19:23:36] [INFO ] Transformed 1603 places.
[2024-06-01 19:23:36] [INFO ] Transformed 1803 transitions.
[2024-06-01 19:23:36] [INFO ] Found NUPN structural information;
[2024-06-01 19:23:36] [INFO ] Parsed PT model containing 1603 places and 1803 transitions and 5760 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (20 resets) in 1309 ms. (30 steps per ms) remains 6/14 properties
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 590 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 969 ms. (41 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
// Phase 1: matrix 1803 rows 1603 cols
[2024-06-01 19:23:37] [INFO ] Computed 161 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1058/1149 variables, 107/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1149 variables, 1058/1256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1149 variables, 0/1256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 454/1603 variables, 54/1310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1603 variables, 454/1764 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1603 variables, 0/1764 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1803/3406 variables, 1603/3367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3406 variables, 0/3367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/3406 variables, 0/3367 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3406/3406 variables, and 3367 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1999 ms.
Refiners :[Domain max(s): 1603/1603 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1603/1603 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 91/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1058/1149 variables, 107/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1149 variables, 1058/1256 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 19:23:40] [INFO ] Deduced a trap composed of 30 places in 357 ms of which 50 ms to minimize.
[2024-06-01 19:23:40] [INFO ] Deduced a trap composed of 20 places in 340 ms of which 9 ms to minimize.
[2024-06-01 19:23:41] [INFO ] Deduced a trap composed of 33 places in 344 ms of which 5 ms to minimize.
[2024-06-01 19:23:41] [INFO ] Deduced a trap composed of 29 places in 259 ms of which 5 ms to minimize.
[2024-06-01 19:23:41] [INFO ] Deduced a trap composed of 22 places in 289 ms of which 5 ms to minimize.
[2024-06-01 19:23:42] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 7 ms to minimize.
[2024-06-01 19:23:42] [INFO ] Deduced a trap composed of 36 places in 298 ms of which 6 ms to minimize.
[2024-06-01 19:23:42] [INFO ] Deduced a trap composed of 53 places in 277 ms of which 5 ms to minimize.
[2024-06-01 19:23:43] [INFO ] Deduced a trap composed of 36 places in 289 ms of which 5 ms to minimize.
[2024-06-01 19:23:43] [INFO ] Deduced a trap composed of 35 places in 272 ms of which 5 ms to minimize.
[2024-06-01 19:23:43] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 5 ms to minimize.
[2024-06-01 19:23:43] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 5 ms to minimize.
[2024-06-01 19:23:44] [INFO ] Deduced a trap composed of 56 places in 231 ms of which 5 ms to minimize.
[2024-06-01 19:23:44] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 4 ms to minimize.
[2024-06-01 19:23:44] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 4 ms to minimize.
[2024-06-01 19:23:44] [INFO ] Deduced a trap composed of 28 places in 231 ms of which 4 ms to minimize.
SMT process timed out in 7301ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 91 out of 1603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 1603 transition count 1672
Reduce places removed 131 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 140 rules applied. Total rules applied 271 place count 1472 transition count 1663
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 280 place count 1463 transition count 1663
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 280 place count 1463 transition count 1465
Deduced a syphon composed of 198 places in 2 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 676 place count 1265 transition count 1465
Discarding 242 places :
Symmetric choice reduction at 3 with 242 rule applications. Total rules 918 place count 1023 transition count 1223
Iterating global reduction 3 with 242 rules applied. Total rules applied 1160 place count 1023 transition count 1223
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 88 Pre rules applied. Total rules applied 1160 place count 1023 transition count 1135
Deduced a syphon composed of 88 places in 5 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1336 place count 935 transition count 1135
Performed 263 Post agglomeration using F-continuation condition.Transition count delta: 263
Deduced a syphon composed of 263 places in 3 ms
Reduce places removed 263 places and 0 transitions.
Iterating global reduction 3 with 526 rules applied. Total rules applied 1862 place count 672 transition count 872
Partial Free-agglomeration rule applied 73 times.
Drop transitions (Partial Free agglomeration) removed 73 transitions
Iterating global reduction 3 with 73 rules applied. Total rules applied 1935 place count 672 transition count 872
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1936 place count 671 transition count 871
Applied a total of 1936 rules in 465 ms. Remains 671 /1603 variables (removed 932) and now considering 871/1803 (removed 932) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 671/1603 places, 871/1803 transitions.
RANDOM walk for 40000 steps (64 resets) in 828 ms. (48 steps per ms) remains 5/6 properties
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 3/5 properties
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
// Phase 1: matrix 871 rows 671 cols
[2024-06-01 19:23:45] [INFO ] Computed 161 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 143/168 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 366/534 variables, 93/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 739/1273 variables, 534/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1273 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 200/1473 variables, 88/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1473 variables, 18/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1473 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 18/1491 variables, 8/773 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1491 variables, 10/783 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1491 variables, 0/783 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/1495 variables, 2/785 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1495 variables, 1/786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1495 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 41/1536 variables, 34/820 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1536 variables, 6/826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1536 variables, 0/826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 4/1540 variables, 2/828 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1540 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/1542 variables, 4/832 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1542 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/1542 variables, 0/832 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1542/1542 variables, and 832 constraints, problems are : Problem set: 0 solved, 3 unsolved in 834 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 671/671 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 143/168 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:23:46] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-06-01 19:23:46] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:23:47] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:23:47] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:23:47] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:23:47] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:23:47] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 366/534 variables, 93/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:23:47] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:23:47] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:23:47] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:23:47] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 3 ms to minimize.
[2024-06-01 19:23:47] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:23:48] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2024-06-01 19:23:48] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 2 ms to minimize.
[2024-06-01 19:23:48] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:23:48] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 2 ms to minimize.
[2024-06-01 19:23:48] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2024-06-01 19:23:48] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:23:48] [INFO ] Deduced a trap composed of 8 places in 96 ms of which 1 ms to minimize.
[2024-06-01 19:23:48] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-06-01 19:23:48] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 3 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:23:49] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 739/1273 variables, 534/691 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1273 variables, 2/693 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:23:50] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-06-01 19:23:50] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-06-01 19:23:50] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-06-01 19:23:50] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:23:50] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:23:50] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1273 variables, 6/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1273 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 200/1473 variables, 88/787 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1473 variables, 18/805 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1473 variables, 1/806 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:23:51] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 3 ms to minimize.
[2024-06-01 19:23:51] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 2 ms to minimize.
[2024-06-01 19:23:51] [INFO ] Deduced a trap composed of 14 places in 135 ms of which 3 ms to minimize.
[2024-06-01 19:23:51] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:23:51] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:23:52] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:23:52] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:23:52] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:23:52] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 2 ms to minimize.
[2024-06-01 19:23:52] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:23:52] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:23:53] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 2 ms to minimize.
[2024-06-01 19:23:53] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:23:53] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:23:53] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:23:53] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:23:53] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1473 variables, 17/823 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:23:53] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:23:53] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:23:54] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:23:54] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1473 variables, 4/827 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1473 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 18/1491 variables, 8/835 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1491 variables, 10/845 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1491 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 4/1495 variables, 2/847 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1495 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:23:54] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1495 variables, 1/849 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1495 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 41/1536 variables, 34/883 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1536 variables, 6/889 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:23:54] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1536 variables, 1/890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1536 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 4/1540 variables, 2/892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1540 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 2/1542 variables, 4/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1542 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 0/1542 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1542/1542 variables, and 896 constraints, problems are : Problem set: 0 solved, 3 unsolved in 8619 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 671/671 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 61/61 constraints]
After SMT, in 9492ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1223 ms.
Support contains 25 out of 671 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 671/671 places, 871/871 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 671 transition count 861
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 661 transition count 861
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 20 place count 661 transition count 849
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 44 place count 649 transition count 849
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 647 transition count 847
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 647 transition count 847
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 48 place count 647 transition count 846
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 646 transition count 846
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 146 place count 598 transition count 798
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 155 place count 598 transition count 798
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 159 place count 594 transition count 794
Applied a total of 159 rules in 229 ms. Remains 594 /671 variables (removed 77) and now considering 794/871 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 594/671 places, 794/871 transitions.
RANDOM walk for 40000 steps (76 resets) in 326 ms. (122 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 2/3 properties
FORMULA ShieldRVs-PT-040B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
// Phase 1: matrix 794 rows 594 cols
[2024-06-01 19:23:57] [INFO ] Computed 161 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/56 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 112/172 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 247/419 variables, 83/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 14/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 21/440 variables, 11/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/440 variables, 19/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/440 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/442 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/442 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 211/653 variables, 92/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/653 variables, 22/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/653 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 14/667 variables, 7/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/667 variables, 12/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/667 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 117/784 variables, 54/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/784 variables, 14/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/784 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 8/792 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/792 variables, 6/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/792 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 94/886 variables, 38/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/886 variables, 9/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/886 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 6/892 variables, 3/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/892 variables, 6/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/892 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 90/982 variables, 36/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/982 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/982 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 7/989 variables, 4/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/989 variables, 7/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/989 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 49/1038 variables, 24/550 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1038 variables, 7/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1038 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 4/1042 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1042 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1042 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 2/1044 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1044 variables, 1/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1044 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 31/1075 variables, 13/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1075 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1075 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 3/1078 variables, 2/578 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1078 variables, 3/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1078 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 31/1109 variables, 12/593 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1109 variables, 3/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1109 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 2/1111 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1111 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1111 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (OVERLAPS) 31/1142 variables, 12/611 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1142 variables, 3/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1142 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (OVERLAPS) 2/1144 variables, 1/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1144 variables, 2/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1144 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 33/1177 variables, 12/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1177 variables, 1/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1177 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (OVERLAPS) 4/1181 variables, 3/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1181 variables, 4/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1181 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (OVERLAPS) 2/1183 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1183 variables, 2/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1183 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (OVERLAPS) 29/1212 variables, 10/650 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1212 variables, 2/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1212 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 2/1214 variables, 1/653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1214 variables, 2/655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1214 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (OVERLAPS) 31/1245 variables, 12/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1245 variables, 3/670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1245 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (OVERLAPS) 2/1247 variables, 1/671 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1247 variables, 2/673 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1247 variables, 0/673 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (OVERLAPS) 32/1279 variables, 12/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1279 variables, 1/686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1279 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (OVERLAPS) 4/1283 variables, 3/689 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1283 variables, 2/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1283 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (OVERLAPS) 2/1285 variables, 1/692 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1285 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1285 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (OVERLAPS) 31/1316 variables, 12/706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1316 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1316 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (OVERLAPS) 4/1320 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1320 variables, 2/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1320 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (OVERLAPS) 32/1352 variables, 14/725 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1352 variables, 3/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1352 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (OVERLAPS) 2/1354 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1354 variables, 2/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1354 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (OVERLAPS) 28/1382 variables, 12/743 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1382 variables, 3/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/1382 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (OVERLAPS) 2/1384 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1384 variables, 2/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/1384 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (OVERLAPS) 4/1388 variables, 4/753 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1388 variables, 2/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/1388 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (OVERLAPS) 0/1388 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1388/1388 variables, and 755 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1305 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 594/594 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 51/56 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:23:58] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 112/172 variables, 60/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 247/419 variables, 83/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 14/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:23:58] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 21/440 variables, 11/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/440 variables, 19/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:23:58] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/440 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/440 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/442 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/442 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/442 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 211/653 variables, 92/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/653 variables, 22/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/653 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 14/667 variables, 7/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/667 variables, 12/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/667 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 117/784 variables, 54/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/784 variables, 14/410 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:23:58] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 0 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/784 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/784 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 8/792 variables, 4/415 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/792 variables, 6/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/792 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 94/886 variables, 38/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/886 variables, 9/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/886 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 6/892 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/892 variables, 6/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/892 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (OVERLAPS) 90/982 variables, 36/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/982 variables, 8/521 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:23:59] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/982 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/982 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 7/989 variables, 4/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/989 variables, 7/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/989 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 49/1038 variables, 24/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1038 variables, 7/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:23:59] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
At refinement iteration 48 (INCLUDED_ONLY) 0/1038 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:23:59] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/1038 variables, 1/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1038 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (OVERLAPS) 4/1042 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1042 variables, 2/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1042 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (OVERLAPS) 2/1044 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1044 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1044 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (OVERLAPS) 31/1075 variables, 13/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1075 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1075 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (OVERLAPS) 3/1078 variables, 2/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1078 variables, 3/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1078 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (OVERLAPS) 31/1109 variables, 12/602 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1109 variables, 3/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1109 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (OVERLAPS) 2/1111 variables, 1/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1111 variables, 2/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1111 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (OVERLAPS) 31/1142 variables, 12/620 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1142 variables, 3/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1142 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (OVERLAPS) 2/1144 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1144 variables, 2/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1144 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (OVERLAPS) 33/1177 variables, 12/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1177 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1177 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (OVERLAPS) 4/1181 variables, 3/642 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1181 variables, 4/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1181 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (OVERLAPS) 2/1183 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1183 variables, 2/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1183 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (OVERLAPS) 29/1212 variables, 10/659 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1212 variables, 2/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1212 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (OVERLAPS) 2/1214 variables, 1/662 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1214 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1214 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (OVERLAPS) 31/1245 variables, 12/676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1245 variables, 3/679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1245 variables, 0/679 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (OVERLAPS) 2/1247 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1247 variables, 2/682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1247 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (OVERLAPS) 32/1279 variables, 12/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1279 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1279 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (OVERLAPS) 4/1283 variables, 3/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1283 variables, 2/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1283 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (OVERLAPS) 2/1285 variables, 1/701 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1285 variables, 2/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1285 variables, 0/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (OVERLAPS) 31/1316 variables, 12/715 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/1316 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1316 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (OVERLAPS) 4/1320 variables, 2/718 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/1320 variables, 2/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1320 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 111 (OVERLAPS) 32/1352 variables, 14/734 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1352 variables, 3/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/1352 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 114 (OVERLAPS) 2/1354 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/1354 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/1354 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 117 (OVERLAPS) 28/1382 variables, 12/752 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/1382 variables, 3/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/1382 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 120 (OVERLAPS) 2/1384 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/1384 variables, 2/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/1384 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 123 (OVERLAPS) 4/1388 variables, 4/762 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/1388 variables, 2/764 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/1388 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 126 (OVERLAPS) 0/1388 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1388/1388 variables, and 764 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2339 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 594/594 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 3659ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 120 ms.
Support contains 5 out of 594 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 594/594 places, 794/794 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 594 transition count 791
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 591 transition count 791
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 6 place count 591 transition count 783
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 583 transition count 783
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 572 transition count 772
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 572 transition count 772
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 568 transition count 768
Applied a total of 52 rules in 75 ms. Remains 568 /594 variables (removed 26) and now considering 768/794 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 568/594 places, 768/794 transitions.
RANDOM walk for 40000 steps (82 resets) in 332 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 256309 steps, run timeout after 3002 ms. (steps per millisecond=85 ) properties seen :0 out of 2
Probabilistic random walk after 256309 steps, saw 250277 distinct states, run finished after 3005 ms. (steps per millisecond=85 ) properties seen :0
// Phase 1: matrix 768 rows 568 cols
[2024-06-01 19:24:04] [INFO ] Computed 161 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 109/166 variables, 57/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 239/405 variables, 82/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 18/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/419 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 14/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 210/629 variables, 91/283 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/629 variables, 24/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/629 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/641 variables, 6/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 12/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/641 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 114/755 variables, 52/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/755 variables, 15/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/755 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 6/761 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/761 variables, 6/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/761 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 93/854 variables, 36/437 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/854 variables, 9/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/854 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 6/860 variables, 3/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/860 variables, 6/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/860 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 89/949 variables, 36/491 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/949 variables, 9/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/949 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 6/955 variables, 3/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/955 variables, 6/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/955 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 48/1003 variables, 24/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1003 variables, 7/540 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1003 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (OVERLAPS) 2/1005 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1005 variables, 2/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1005 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 43 (OVERLAPS) 31/1036 variables, 12/555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1036 variables, 3/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1036 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (OVERLAPS) 2/1038 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1038 variables, 2/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1038 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 31/1069 variables, 12/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1069 variables, 3/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1069 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 2/1071 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1071 variables, 2/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1071 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 31/1102 variables, 12/591 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1102 variables, 3/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1102 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 2/1104 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1104 variables, 2/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1104 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (OVERLAPS) 31/1135 variables, 12/609 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1135 variables, 3/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1135 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (OVERLAPS) 2/1137 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1137 variables, 2/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1137 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 31/1168 variables, 12/627 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1168 variables, 3/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1168 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (OVERLAPS) 2/1170 variables, 1/631 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1170 variables, 2/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1170 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (OVERLAPS) 31/1201 variables, 12/645 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1201 variables, 3/648 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1201 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (OVERLAPS) 2/1203 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1203 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1203 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 31/1234 variables, 12/663 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1234 variables, 3/666 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1234 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (OVERLAPS) 2/1236 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1236 variables, 2/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1236 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (OVERLAPS) 31/1267 variables, 12/681 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1267 variables, 3/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1267 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (OVERLAPS) 2/1269 variables, 1/685 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1269 variables, 2/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1269 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (OVERLAPS) 31/1300 variables, 12/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1300 variables, 3/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1300 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (OVERLAPS) 2/1302 variables, 1/703 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1302 variables, 2/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1302 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (OVERLAPS) 28/1330 variables, 12/717 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1330 variables, 3/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1330 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (OVERLAPS) 2/1332 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1332 variables, 2/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1332 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (OVERLAPS) 4/1336 variables, 4/727 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1336 variables, 2/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1336 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (OVERLAPS) 0/1336 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 729 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1155 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 568/568 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/53 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/57 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:24:05] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 109/166 variables, 57/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 239/405 variables, 82/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 18/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 14/419 variables, 7/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 14/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:24:05] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/419 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 210/629 variables, 91/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/629 variables, 24/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/629 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 12/641 variables, 6/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/641 variables, 12/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/641 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 114/755 variables, 52/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/755 variables, 15/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/755 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 6/761 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/761 variables, 6/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/761 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 93/854 variables, 36/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/854 variables, 9/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/854 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 6/860 variables, 3/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/860 variables, 6/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/860 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 89/949 variables, 36/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/949 variables, 9/504 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:24:05] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/949 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/949 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 38 (OVERLAPS) 6/955 variables, 3/508 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/955 variables, 6/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/955 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 41 (OVERLAPS) 48/1003 variables, 24/538 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1003 variables, 7/545 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:24:06] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:24:06] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:24:06] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1003 variables, 3/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1003 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 45 (OVERLAPS) 2/1005 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1005 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:24:06] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/1005 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1005 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 49 (OVERLAPS) 31/1036 variables, 12/564 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1036 variables, 3/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1036 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 52 (OVERLAPS) 2/1038 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1038 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1038 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 55 (OVERLAPS) 31/1069 variables, 12/582 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1069 variables, 3/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1069 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 58 (OVERLAPS) 2/1071 variables, 1/586 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1071 variables, 2/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1071 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 61 (OVERLAPS) 31/1102 variables, 12/600 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1102 variables, 3/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1102 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 64 (OVERLAPS) 2/1104 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1104 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1104 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 67 (OVERLAPS) 31/1135 variables, 12/618 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1135 variables, 3/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1135 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 70 (OVERLAPS) 2/1137 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1137 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1137 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 73 (OVERLAPS) 31/1168 variables, 12/636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1168 variables, 3/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1168 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 76 (OVERLAPS) 2/1170 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1170 variables, 2/642 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1170 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 79 (OVERLAPS) 31/1201 variables, 12/654 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1201 variables, 3/657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1201 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 82 (OVERLAPS) 2/1203 variables, 1/658 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1203 variables, 2/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1203 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 85 (OVERLAPS) 31/1234 variables, 12/672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1234 variables, 3/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1234 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 88 (OVERLAPS) 2/1236 variables, 1/676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1236 variables, 2/678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1236 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 91 (OVERLAPS) 31/1267 variables, 12/690 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1267 variables, 3/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1267 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 94 (OVERLAPS) 2/1269 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1269 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1269 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 97 (OVERLAPS) 31/1300 variables, 12/708 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1300 variables, 3/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1300 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 100 (OVERLAPS) 2/1302 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1302 variables, 2/714 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/1302 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 103 (OVERLAPS) 28/1330 variables, 12/726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1330 variables, 3/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/1330 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 106 (OVERLAPS) 2/1332 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/1332 variables, 2/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/1332 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 109 (OVERLAPS) 4/1336 variables, 4/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/1336 variables, 2/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 19:24:07] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
At refinement iteration 111 (INCLUDED_ONLY) 0/1336 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/1336 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 113 (OVERLAPS) 0/1336 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 739 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2296 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 568/568 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 8/8 constraints]
After SMT, in 3467ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 159 ms.
Support contains 5 out of 568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 768/768 transitions.
Applied a total of 0 rules in 23 ms. Remains 568 /568 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 568/568 places, 768/768 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 568/568 places, 768/768 transitions.
Applied a total of 0 rules in 18 ms. Remains 568 /568 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-06-01 19:24:07] [INFO ] Invariant cache hit.
[2024-06-01 19:24:08] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-06-01 19:24:08] [INFO ] Invariant cache hit.
[2024-06-01 19:24:08] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
[2024-06-01 19:24:09] [INFO ] Redundant transitions in 104 ms returned []
Running 764 sub problems to find dead transitions.
[2024-06-01 19:24:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:24:15] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:24:15] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:24:15] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:24:15] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:24:15] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:24:15] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:24:15] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:24:15] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:24:15] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:24:16] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:24:16] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 2 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 1 ms to minimize.
[2024-06-01 19:24:17] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 2 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/565 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:24:18] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/565 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:24:19] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:24:20] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:24:20] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:24:20] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:24:20] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:24:20] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:24:20] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-06-01 19:24:20] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:24:20] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:24:21] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 4 ms to minimize.
[2024-06-01 19:24:21] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 2 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 2 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 2 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:24:22] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 2 ms to minimize.
[2024-06-01 19:24:23] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 2 ms to minimize.
[2024-06-01 19:24:23] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/565 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:24:29] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:24:29] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-01 19:24:29] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:24:29] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-06-01 19:24:29] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:24:29] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:24:29] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:24:30] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:24:30] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:24:30] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:24:30] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:24:30] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:24:30] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:24:30] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:24:30] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 19:24:31] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 19:24:31] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:24:31] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-01 19:24:31] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:24:31] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:24:32] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:24:32] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:24:33] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:24:33] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 2 ms to minimize.
[2024-06-01 19:24:33] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 2 ms to minimize.
[2024-06-01 19:24:34] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:24:34] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 2 ms to minimize.
[2024-06-01 19:24:34] [INFO ] Deduced a trap composed of 6 places in 126 ms of which 2 ms to minimize.
[2024-06-01 19:24:34] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:24:34] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:24:34] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 2 ms to minimize.
[2024-06-01 19:24:34] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 2 ms to minimize.
[2024-06-01 19:24:35] [INFO ] Deduced a trap composed of 6 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:24:35] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 2 ms to minimize.
[2024-06-01 19:24:35] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:24:35] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:24:35] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-06-01 19:24:35] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-06-01 19:24:35] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:24:35] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 20/249 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:24:36] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:24:36] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:24:36] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:24:36] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:24:37] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 3 ms to minimize.
[2024-06-01 19:24:37] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 2 ms to minimize.
[2024-06-01 19:24:38] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-06-01 19:24:38] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-06-01 19:24:38] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:24:38] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 19:24:38] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 19:24:38] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:24:38] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:24:38] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:24:38] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:24:38] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:24:38] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:24:38] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:24:39] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:24:39] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 timeout
0.0)
(s104 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 20/269 constraints. Problems are: Problem set: 0 solved, 764 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/1336 variables, and 269 constraints, problems are : Problem set: 0 solved, 764 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 149/161 constraints, State Equation: 0/568 constraints, PredecessorRefiner: 764/764 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 764 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/565 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 764 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/565 variables, 120/269 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:24:40] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:24:40] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:24:40] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:24:40] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:24:40] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:24:40] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:24:40] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:24:40] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:24:40] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:24:40] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:24:41] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:24:41] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:24:41] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:24:41] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:24:41] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:24:41] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:24:41] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:24:41] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:24:41] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:24:41] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/565 variables, 20/289 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:24:41] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:24:41] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:24:41] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:24:41] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 19:24:42] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:24:42] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:24:42] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:24:42] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:24:42] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:24:42] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:24:42] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:24:42] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:24:42] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:24:43] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:24:43] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:24:43] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:24:43] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:24:43] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:24:43] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:24:43] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/565 variables, 20/309 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:24:43] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:24:43] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:24:43] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:24:44] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:24:44] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:24:44] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:24:44] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:24:44] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:24:44] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:24:44] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:24:45] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:24:45] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:24:45] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:24:45] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2024-06-01 19:24:45] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:24:45] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-06-01 19:24:45] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-06-01 19:24:45] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:24:46] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:24:46] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 20/329 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:24:46] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:24:46] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-01 19:24:47] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:24:47] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:24:47] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:24:47] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 19:24:47] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:24:47] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:24:47] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:24:47] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:24:47] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:24:47] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-06-01 19:24:48] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-06-01 19:24:48] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-06-01 19:24:48] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-06-01 19:24:48] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:24:48] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-06-01 19:24:48] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-06-01 19:24:48] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 19:24:48] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 20/349 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:24:49] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:24:49] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:24:49] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:24:49] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:24:50] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-06-01 19:24:50] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:24:50] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-06-01 19:24:50] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:24:50] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-06-01 19:24:50] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:24:51] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:24:51] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-06-01 19:24:51] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:24:51] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 19:24:51] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-06-01 19:24:51] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:24:51] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:24:51] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:24:51] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:24:51] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 20/369 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:24:51] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:24:52] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:24:52] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:24:52] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:24:52] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:24:52] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:24:52] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2024-06-01 19:24:53] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:24:53] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:24:53] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:24:53] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:24:53] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:24:53] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-06-01 19:24:53] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:24:53] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-06-01 19:24:53] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-06-01 19:24:54] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-06-01 19:24:54] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-06-01 19:24:54] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 1 ms to minimize.
[2024-06-01 19:24:54] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 20/389 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:24:54] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 2 ms to minimize.
[2024-06-01 19:24:54] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 2 ms to minimize.
[2024-06-01 19:24:55] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-06-01 19:24:55] [INFO ] Deduced a trap composed of 6 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:24:55] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2024-06-01 19:24:55] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 2 ms to minimize.
[2024-06-01 19:24:55] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:24:55] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2024-06-01 19:24:55] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2024-06-01 19:24:55] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:24:55] [INFO ] Deduced a trap composed of 6 places in 88 ms of which 1 ms to minimize.
[2024-06-01 19:24:55] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:24:56] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:24:56] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:24:56] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:24:56] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:24:56] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:24:56] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:24:56] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:24:56] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 20/409 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:24:57] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-01 19:24:57] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-06-01 19:24:57] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-06-01 19:24:57] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2024-06-01 19:24:58] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-06-01 19:24:58] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2024-06-01 19:24:58] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:24:58] [INFO ] Deduced a trap composed of 44 places in 92 ms of which 1 ms to minimize.
[2024-06-01 19:24:58] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:24:58] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-06-01 19:24:58] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-06-01 19:24:58] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 1 ms to minimize.
[2024-06-01 19:24:58] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2024-06-01 19:24:59] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2024-06-01 19:24:59] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:24:59] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 19:24:59] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:24:59] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:24:59] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:24:59] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 20/429 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:25:00] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:25:00] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:25:00] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2024-06-01 19:25:00] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:25:00] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:25:00] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:25:01] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:25:01] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:25:01] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2024-06-01 19:25:01] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:25:01] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-01 19:25:01] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:25:01] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:25:01] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-06-01 19:25:01] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:25:01] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:25:01] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:25:01] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-06-01 19:25:01] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:25:01] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 20/449 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:25:02] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:25:02] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:25:02] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:25:02] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 19:25:02] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:25:02] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-06-01 19:25:02] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:25:02] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:25:02] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 19:25:03] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:25:03] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:25:03] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:25:03] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:25:03] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:25:03] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:25:03] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:25:03] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:25:03] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:25:03] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 19:25:03] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 20/469 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:25:04] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 0 ms to minimize.
[2024-06-01 19:25:04] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:25:04] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:25:04] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:25:04] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:25:04] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:25:04] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 19:25:04] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:25:04] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:25:04] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:25:04] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:25:04] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:25:04] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:25:04] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:25:05] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:25:05] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:25:05] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:25:05] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:25:05] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:25:05] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 20/489 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:25:05] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:25:05] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2024-06-01 19:25:06] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:25:06] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:25:06] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2024-06-01 19:25:06] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-06-01 19:25:06] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-06-01 19:25:06] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:25:06] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:25:06] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:25:06] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:25:07] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:25:07] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:25:07] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:25:07] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:25:07] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-06-01 19:25:07] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:25:07] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:25:07] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:25:07] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 20/509 constraints. Problems are: Problem set: 0 solved, 764 unsolved
[2024-06-01 19:25:08] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:25:08] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:25:08] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:25:08] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:25:08] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:25:08] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:25:08] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:25:08] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:25:09] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 0 ms to minimize.
[2024-06-01 19:25:09] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:25:09] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
SMT process timed out in 60429ms, After SMT, problems are : Problem set: 0 solved, 764 unsolved
Search for dead transitions found 0 dead transitions in 60439ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61564 ms. Remains : 568/568 places, 768/768 transitions.
[2024-06-01 19:25:09] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2024-06-01 19:25:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 568 places, 768 transitions and 3703 arcs took 8 ms.
[2024-06-01 19:25:09] [INFO ] Flatten gal took : 155 ms
Total runtime 93584 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 : ShieldRVs-PT-040B-ReachabilityCardinality-2024-02
Could not compute solution for formula : ShieldRVs-PT-040B-ReachabilityCardinality-2024-13

BK_STOP 1717269910120

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name ShieldRVs-PT-040B-ReachabilityCardinality-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/1945/inv_0_
rfs formula name ShieldRVs-PT-040B-ReachabilityCardinality-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/1945/inv_1_
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="ShieldRVs-PT-040B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldRVs-PT-040B, examination is ReachabilityCardinality"
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-171683762000846"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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