About the Execution of ITS-Tools for ShieldRVt-PT-050B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
9941.228 | 840695.00 | 2183464.00 | 1824.90 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r365-tall-171683779800648.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 itstools
Input is ShieldRVt-PT-050B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r365-tall-171683779800648
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 11 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 21:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 614K 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
FORMULA_NAME StableMarking
=== Now, execution of the tool begins
BK_START 1716917503917
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-28 17:31:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-28 17:31:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:31:45] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2024-05-28 17:31:45] [INFO ] Transformed 2503 places.
[2024-05-28 17:31:45] [INFO ] Transformed 2503 transitions.
[2024-05-28 17:31:45] [INFO ] Found NUPN structural information;
[2024-05-28 17:31:45] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 367 ms.
Structural test allowed to assert that 1001 places are NOT stable. Took 23 ms.
[2024-05-28 17:31:46] [INFO ] Flatten gal took : 341 ms
[2024-05-28 17:31:46] [INFO ] Flatten gal took : 237 ms
[2024-05-28 17:31:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1823112289729405019.gal : 79 ms
[2024-05-28 17:31:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4763063519964884794.prop : 22 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1823112289729405019.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4763063519964884794.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4763063519964884794.prop.
RANDOM walk for 40000 steps (8 resets) in 8427 ms. (4 steps per ms) remains 1167/1502 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 21 ms. (5 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 20 ms. (5 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 121 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 19 ms. (6 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 12 ms. (9 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 121 steps (8 resets) in 7 ms. (15 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 16 ms. (7 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1167/1167 properties
// Phase 1: matrix 2503 rows 2503 cols
[2024-05-28 17:31:48] [INFO ] Computed 201 invariants in 27 ms
SDD proceeding with computation,1502 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1502 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1502 properties remain. new max is 16
SDD size :10 after 19
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1167 variables, 1167/1167 constraints. Problems are: Problem set: 0 solved, 1167 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1167/5006 variables, and 1167 constraints, problems are : Problem set: 0 solved, 1167 unsolved in 5115 ms.
Refiners :[Domain max(s): 1167/2503 constraints, Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/2503 constraints, PredecessorRefiner: 1167/1167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1167 variables, 1167/1167 constraints. Problems are: Problem set: 0 solved, 1167 unsolved
SDD proceeding with computation,1502 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1502 properties remain. new max is 64
SDD size :36 after 114
SDD proceeding with computation,1502 properties remain. new max is 128
SDD size :114 after 43939
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1167/5006 variables, and 1167 constraints, problems are : Problem set: 0 solved, 1167 unsolved in 5041 ms.
Refiners :[Domain max(s): 1167/2503 constraints, Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/2503 constraints, PredecessorRefiner: 0/1167 constraints, Known Traps: 0/0 constraints]
After SMT, in 10663ms problems are : Problem set: 0 solved, 1167 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1167 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 491 transitions
Trivial Post-agglo rules discarded 491 transitions
Performed 491 trivial Post agglomeration. Transition count delta: 491
Iterating post reduction 0 with 491 rules applied. Total rules applied 491 place count 2503 transition count 2012
Reduce places removed 491 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 493 rules applied. Total rules applied 984 place count 2012 transition count 2010
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 985 place count 2011 transition count 2010
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 985 place count 2011 transition count 1963
Deduced a syphon composed of 47 places in 16 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1079 place count 1964 transition count 1963
Discarding 73 places :
Symmetric choice reduction at 3 with 73 rule applications. Total rules 1152 place count 1891 transition count 1890
Iterating global reduction 3 with 73 rules applied. Total rules applied 1225 place count 1891 transition count 1890
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 1225 place count 1891 transition count 1861
Deduced a syphon composed of 29 places in 23 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1283 place count 1862 transition count 1861
Performed 415 Post agglomeration using F-continuation condition.Transition count delta: 415
Deduced a syphon composed of 415 places in 21 ms
Reduce places removed 415 places and 0 transitions.
Iterating global reduction 3 with 830 rules applied. Total rules applied 2113 place count 1447 transition count 1446
Renaming transitions due to excessive name length > 1024 char.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 30 places in 15 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 2173 place count 1417 transition count 1473
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2174 place count 1417 transition count 1472
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2176 place count 1417 transition count 1470
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2178 place count 1415 transition count 1470
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2179 place count 1415 transition count 1469
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2180 place count 1415 transition count 1469
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2181 place count 1415 transition count 1468
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2182 place count 1414 transition count 1467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2183 place count 1413 transition count 1467
Applied a total of 2183 rules in 706 ms. Remains 1413 /2503 variables (removed 1090) and now considering 1467/2503 (removed 1036) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 727 ms. Remains : 1413/2503 places, 1467/2503 transitions.
SDD proceeding with computation,1502 properties remain. new max is 256
SDD size :43939 after 4.00695e+11
SDD proceeding with computation,1502 properties remain. new max is 512
SDD size :4.00695e+11 after 3.33958e+25
SDD proceeding with computation,1502 properties remain. new max is 1024
SDD size :3.33958e+25 after 2.31978e+53
SDD proceeding with computation,1502 properties remain. new max is 2048
SDD size :2.31978e+53 after 7.53287e+113
Invariant property smplace_2500 does not hold.
Invariant property smplace_2488 does not hold.
Invariant property smplace_2487 does not hold.
Invariant property smplace_2486 does not hold.
Invariant property smplace_2485 does not hold.
Invariant property smplace_2484 does not hold.
Invariant property smplace_2483 does not hold.
Invariant property smplace_2451 does not hold.
Invariant property smplace_2439 does not hold.
Invariant property smplace_2438 does not hold.
Invariant property smplace_2437 does not hold.
Invariant property smplace_2436 does not hold.
Invariant property smplace_2435 does not hold.
Invariant property smplace_2434 does not hold.
Invariant property smplace_2402 does not hold.
Invariant property smplace_2390 does not hold.
Invariant property smplace_2389 does not hold.
Invariant property smplace_2388 does not hold.
Invariant property smplace_2387 does not hold.
Invariant property smplace_2386 does not hold.
Invariant property smplace_2385 does not hold.
Invariant property smplace_2353 does not hold.
Invariant property smplace_2341 does not hold.
Invariant property smplace_2340 does not hold.
Invariant property smplace_2339 does not hold.
Invariant property smplace_2338 does not hold.
Invariant property smplace_2337 does not hold.
Invariant property smplace_2336 does not hold.
Invariant property smplace_2304 does not hold.
Invariant property smplace_2292 does not hold.
Invariant property smplace_2291 does not hold.
Invariant property smplace_2290 does not hold.
Invariant property smplace_2289 does not hold.
Invariant property smplace_2288 does not hold.
Invariant property smplace_2287 does not hold.
Invariant property smplace_2255 does not hold.
Invariant property smplace_2243 does not hold.
Invariant property smplace_2242 does not hold.
Invariant property smplace_2241 does not hold.
Invariant property smplace_2240 does not hold.
Invariant property smplace_2239 does not hold.
Invariant property smplace_2238 does not hold.
Invariant property smplace_2206 does not hold.
Invariant property smplace_2194 does not hold.
Invariant property smplace_2193 does not hold.
Invariant property smplace_2192 does not hold.
Invariant property smplace_2191 does not hold.
Invariant property smplace_2190 does not hold.
Invariant property smplace_2189 does not hold.
Invariant property smplace_2157 does not hold.
Invariant property smplace_2145 does not hold.
Invariant property smplace_2144 does not hold.
Invariant property smplace_2143 does not hold.
Invariant property smplace_2142 does not hold.
Invariant property smplace_2141 does not hold.
Invariant property smplace_2140 does not hold.
Invariant property smplace_2108 does not hold.
Invariant property smplace_2096 does not hold.
Invariant property smplace_2095 does not hold.
Invariant property smplace_2094 does not hold.
Invariant property smplace_2093 does not hold.
Invariant property smplace_2092 does not hold.
Invariant property smplace_2091 does not hold.
Invariant property smplace_2059 does not hold.
Invariant property smplace_2047 does not hold.
Invariant property smplace_2046 does not hold.
Invariant property smplace_2045 does not hold.
Invariant property smplace_2044 does not hold.
Invariant property smplace_2043 does not hold.
Invariant property smplace_2042 does not hold.
Invariant property smplace_2010 does not hold.
Invariant property smplace_1998 does not hold.
Invariant property smplace_1997 does not hold.
Invariant property smplace_1996 does not hold.
Invariant property smplace_1995 does not hold.
Invariant property smplace_1994 does not hold.
Invariant property smplace_1993 does not hold.
Invariant property smplace_1961 does not hold.
Invariant property smplace_1949 does not hold.
Invariant property smplace_1948 does not hold.
Invariant property smplace_1947 does not hold.
Invariant property smplace_1946 does not hold.
Invariant property smplace_1945 does not hold.
Invariant property smplace_1944 does not hold.
Invariant property smplace_1912 does not hold.
Invariant property smplace_1900 does not hold.
Invariant property smplace_1899 does not hold.
Invariant property smplace_1898 does not hold.
Invariant property smplace_1897 does not hold.
Invariant property smplace_1896 does not hold.
Invariant property smplace_1895 does not hold.
Invariant property smplace_1863 does not hold.
Invariant property smplace_1851 does not hold.
Invariant property smplace_1850 does not hold.
Invariant property smplace_1849 does not hold.
Invariant property smplace_1848 does not hold.
Invariant property smplace_1847 does not hold.
Invariant property smplace_1846 does not hold.
Invariant property smplace_1814 does not hold.
Invariant property smplace_1802 does not hold.
Invariant property smplace_1801 does not hold.
Invariant property smplace_1800 does not hold.
Invariant property smplace_1799 does not hold.
Invariant property smplace_1798 does not hold.
Invariant property smplace_1797 does not hold.
Invariant property smplace_1765 does not hold.
Invariant property smplace_1753 does not hold.
Invariant property smplace_1752 does not hold.
Invariant property smplace_1751 does not hold.
Invariant property smplace_1750 does not hold.
Invariant property smplace_1749 does not hold.
Invariant property smplace_1748 does not hold.
Invariant property smplace_1716 does not hold.
Invariant property smplace_1704 does not hold.
Invariant property smplace_1703 does not hold.
Invariant property smplace_1702 does not hold.
Invariant property smplace_1701 does not hold.
Invariant property smplace_1700 does not hold.
Invariant property smplace_1699 does not hold.
Invariant property smplace_1667 does not hold.
Invariant property smplace_1655 does not hold.
Invariant property smplace_1654 does not hold.
Invariant property smplace_1653 does not hold.
Invariant property smplace_1652 does not hold.
Invariant property smplace_1651 does not hold.
Invariant property smplace_1650 does not hold.
Invariant property smplace_1618 does not hold.
Invariant property smplace_1606 does not hold.
Invariant property smplace_1605 does not hold.
Invariant property smplace_1604 does not hold.
Invariant property smplace_1603 does not hold.
Invariant property smplace_1602 does not hold.
Invariant property smplace_1601 does not hold.
Invariant property smplace_1569 does not hold.
Invariant property smplace_1557 does not hold.
Invariant property smplace_1556 does not hold.
Invariant property smplace_1555 does not hold.
Invariant property smplace_1554 does not hold.
Invariant property smplace_1553 does not hold.
Invariant property smplace_1552 does not hold.
Invariant property smplace_1520 does not hold.
Invariant property smplace_1508 does not hold.
Invariant property smplace_1507 does not hold.
Invariant property smplace_1506 does not hold.
Invariant property smplace_1505 does not hold.
Invariant property smplace_1504 does not hold.
Invariant property smplace_1503 does not hold.
Invariant property smplace_1471 does not hold.
Invariant property smplace_1459 does not hold.
Invariant property smplace_1458 does not hold.
Invariant property smplace_1457 does not hold.
Invariant property smplace_1456 does not hold.
Invariant property smplace_1455 does not hold.
Invariant property smplace_1454 does not hold.
Invariant property smplace_1422 does not hold.
Invariant property smplace_1410 does not hold.
Invariant property smplace_1409 does not hold.
Invariant property smplace_1408 does not hold.
Invariant property smplace_1407 does not hold.
Invariant property smplace_1406 does not hold.
Invariant property smplace_1405 does not hold.
Invariant property smplace_1373 does not hold.
Invariant property smplace_1361 does not hold.
Invariant property smplace_1360 does not hold.
Invariant property smplace_1359 does not hold.
Invariant property smplace_1358 does not hold.
Invariant property smplace_1357 does not hold.
Invariant property smplace_1356 does not hold.
Invariant property smplace_1324 does not hold.
Invariant property smplace_1312 does not hold.
Invariant property smplace_1311 does not hold.
Invariant property smplace_1310 does not hold.
Invariant property smplace_1309 does not hold.
Invariant property smplace_1308 does not hold.
Invariant property smplace_1307 does not hold.
Invariant property smplace_1275 does not hold.
Invariant property smplace_1263 does not hold.
Invariant property smplace_1262 does not hold.
Invariant property smplace_1261 does not hold.
Invariant property smplace_1260 does not hold.
Invariant property smplace_1259 does not hold.
Invariant property smplace_1258 does not hold.
Invariant property smplace_1226 does not hold.
Invariant property smplace_1214 does not hold.
Invariant property smplace_1213 does not hold.
Invariant property smplace_1212 does not hold.
Invariant property smplace_1211 does not hold.
Invariant property smplace_1210 does not hold.
Invariant property smplace_1209 does not hold.
Invariant property smplace_1177 does not hold.
Invariant property smplace_1165 does not hold.
Invariant property smplace_1164 does not hold.
Invariant property smplace_1163 does not hold.
Invariant property smplace_1162 does not hold.
Invariant property smplace_1161 does not hold.
Invariant property smplace_1160 does not hold.
Invariant property smplace_1128 does not hold.
Invariant property smplace_1116 does not hold.
Invariant property smplace_1115 does not hold.
Invariant property smplace_1114 does not hold.
Invariant property smplace_1113 does not hold.
Invariant property smplace_1112 does not hold.
Invariant property smplace_1111 does not hold.
Invariant property smplace_1079 does not hold.
Invariant property smplace_1067 does not hold.
Invariant property smplace_1066 does not hold.
Invariant property smplace_1065 does not hold.
Invariant property smplace_1064 does not hold.
Invariant property smplace_1063 does not hold.
Invariant property smplace_1062 does not hold.
Invariant property smplace_1030 does not hold.
Invariant property smplace_1018 does not hold.
Invariant property smplace_1017 does not hold.
Invariant property smplace_1016 does not hold.
Invariant property smplace_1015 does not hold.
Invariant property smplace_1014 does not hold.
Invariant property smplace_1013 does not hold.
Invariant property smplace_981 does not hold.
Invariant property smplace_969 does not hold.
Invariant property smplace_968 does not hold.
Invariant property smplace_967 does not hold.
Invariant property smplace_966 does not hold.
Invariant property smplace_965 does not hold.
Invariant property smplace_964 does not hold.
Invariant property smplace_932 does not hold.
Invariant property smplace_920 does not hold.
Invariant property smplace_919 does not hold.
Invariant property smplace_918 does not hold.
Invariant property smplace_917 does not hold.
Invariant property smplace_916 does not hold.
Invariant property smplace_915 does not hold.
Invariant property smplace_883 does not hold.
Invariant property smplace_871 does not hold.
Invariant property smplace_870 does not hold.
Invariant property smplace_869 does not hold.
Invariant property smplace_868 does not hold.
Invariant property smplace_867 does not hold.
Invariant property smplace_866 does not hold.
Invariant property smplace_834 does not hold.
Invariant property smplace_822 does not hold.
Invariant property smplace_821 does not hold.
Invariant property smplace_820 does not hold.
Invariant property smplace_819 does not hold.
Invariant property smplace_818 does not hold.
Invariant property smplace_817 does not hold.
Invariant property smplace_785 does not hold.
Invariant property smplace_773 does not hold.
Invariant property smplace_772 does not hold.
Invariant property smplace_771 does not hold.
Invariant property smplace_770 does not hold.
Invariant property smplace_769 does not hold.
Invariant property smplace_768 does not hold.
Invariant property smplace_736 does not hold.
Invariant property smplace_724 does not hold.
Invariant property smplace_723 does not hold.
Invariant property smplace_722 does not hold.
Invariant property smplace_721 does not hold.
Invariant property smplace_720 does not hold.
Invariant property smplace_719 does not hold.
Invariant property smplace_687 does not hold.
Invariant property smplace_675 does not hold.
Invariant property smplace_674 does not hold.
Invariant property smplace_673 does not hold.
Invariant property smplace_672 does not hold.
Invariant property smplace_671 does not hold.
Invariant property smplace_670 does not hold.
Invariant property smplace_638 does not hold.
Invariant property smplace_626 does not hold.
Invariant property smplace_625 does not hold.
Invariant property smplace_624 does not hold.
Invariant property smplace_623 does not hold.
Invariant property smplace_622 does not hold.
Invariant property smplace_621 does not hold.
Invariant property smplace_589 does not hold.
Invariant property smplace_577 does not hold.
Invariant property smplace_576 does not hold.
Invariant property smplace_575 does not hold.
Invariant property smplace_574 does not hold.
Invariant property smplace_573 does not hold.
Invariant property smplace_572 does not hold.
Invariant property smplace_540 does not hold.
Invariant property smplace_528 does not hold.
Invariant property smplace_527 does not hold.
Invariant property smplace_526 does not hold.
Invariant property smplace_525 does not hold.
Invariant property smplace_524 does not hold.
Invariant property smplace_523 does not hold.
Invariant property smplace_491 does not hold.
Invariant property smplace_479 does not hold.
Invariant property smplace_478 does not hold.
Invariant property smplace_477 does not hold.
Invariant property smplace_476 does not hold.
Invariant property smplace_475 does not hold.
Invariant property smplace_474 does not hold.
Invariant property smplace_442 does not hold.
Invariant property smplace_430 does not hold.
Invariant property smplace_429 does not hold.
Invariant property smplace_428 does not hold.
Invariant property smplace_427 does not hold.
Invariant property smplace_426 does not hold.
Invariant property smplace_425 does not hold.
Invariant property smplace_393 does not hold.
Invariant property smplace_381 does not hold.
Invariant property smplace_380 does not hold.
Invariant property smplace_379 does not hold.
Invariant property smplace_378 does not hold.
Invariant property smplace_377 does not hold.
Invariant property smplace_376 does not hold.
Invariant property smplace_344 does not hold.
Invariant property smplace_332 does not hold.
Invariant property smplace_331 does not hold.
Invariant property smplace_330 does not hold.
Invariant property smplace_329 does not hold.
Invariant property smplace_328 does not hold.
Invariant property smplace_327 does not hold.
Invariant property smplace_295 does not hold.
Invariant property smplace_283 does not hold.
Invariant property smplace_282 does not hold.
Invariant property smplace_281 does not hold.
Invariant property smplace_280 does not hold.
Invariant property smplace_279 does not hold.
Invariant property smplace_278 does not hold.
Invariant property smplace_246 does not hold.
Invariant property smplace_234 does not hold.
Invariant property smplace_233 does not hold.
Invariant property smplace_232 does not hold.
Invariant property smplace_231 does not hold.
Invariant property smplace_230 does not hold.
Invariant property smplace_229 does not hold.
Invariant property smplace_197 does not hold.
Invariant property smplace_185 does not hold.
Invariant property smplace_184 does not hold.
Invariant property smplace_183 does not hold.
Invariant property smplace_182 does not hold.
Invariant property smplace_181 does not hold.
Invariant property smplace_180 does not hold.
Invariant property smplace_148 does not hold.
Invariant property smplace_147 does not hold.
Invariant property smplace_146 does not hold.
Invariant property smplace_145 does not hold.
Invariant property smplace_144 does not hold.
Invariant property smplace_143 does not hold.
Invariant property smplace_142 does not hold.
Invariant property smplace_141 does not hold.
Invariant property smplace_136 does not hold.
Invariant property smplace_135 does not hold.
Invariant property smplace_134 does not hold.
Invariant property smplace_133 does not hold.
Invariant property smplace_132 does not hold.
Invariant property smplace_131 does not hold.
Invariant property smplace_130 does not hold.
Invariant property smplace_129 does not hold.
Invariant property smplace_124 does not hold.
Invariant property smplace_123 does not hold.
Invariant property smplace_122 does not hold.
RANDOM walk for 1575911 steps (376 resets) in 120005 ms. (13 steps per ms) remains 715/1167 properties
Invariant property smplace_121 does not hold.
Invariant property smplace_120 does not hold.
Invariant property smplace_119 does not hold.
Invariant property smplace_114 does not hold.
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 715/715 properties
Invariant property smplace_113 does not hold.
Invariant property smplace_112 does not hold.
Invariant property smplace_111 does not hold.
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 715/715 properties
Invariant property smplace_108 does not hold.
Invariant property smplace_107 does not hold.
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 715/715 properties
Invariant property smplace_99 does not hold.
Invariant property smplace_98 does not hold.
Invariant property smplace_97 does not hold.
Invariant property smplace_96 does not hold.
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 715/715 properties
Invariant property smplace_95 does not hold.
Invariant property smplace_94 does not hold.
Invariant property smplace_93 does not hold.
Invariant property smplace_92 does not hold.
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 715/715 properties
Invariant property smplace_87 does not hold.
Invariant property smplace_86 does not hold.
Invariant property smplace_85 does not hold.
Invariant property smplace_84 does not hold.
Invariant property smplace_83 does not hold.
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 715/715 properties
Invariant property smplace_82 does not hold.
Invariant property smplace_81 does not hold.
Invariant property smplace_80 does not hold.
Invariant property smplace_75 does not hold.
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 715/715 properties
Invariant property smplace_74 does not hold.
Invariant property smplace_73 does not hold.
Invariant property smplace_72 does not hold.
Invariant property smplace_71 does not hold.
Invariant property smplace_70 does not hold.
Invariant property smplace_65 does not hold.
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 715/715 properties
Invariant property smplace_64 does not hold.
Invariant property smplace_63 does not hold.
Invariant property smplace_62 does not hold.
Invariant property smplace_61 does not hold.
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 715/715 properties
Invariant property smplace_60 does not hold.
Invariant property smplace_59 does not hold.
Invariant property smplace_58 does not hold.
Invariant property smplace_52 does not hold.
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 715/715 properties
Invariant property smplace_51 does not hold.
SDD proceeding with computation,1106 properties remain. new max is 2048
SDD size :7.53287e+113 after 1.03748e+116
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 715/715 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 715/715 properties
// Phase 1: matrix 1467 rows 1413 cols
[2024-05-28 17:32:31] [INFO ] Computed 200 invariants in 9 ms
Invariant property smplace_196 does not hold.
Invariant property smplace_195 does not hold.
Invariant property smplace_191 does not hold.
Invariant property smplace_190 does not hold.
Invariant property smplace_179 does not hold.
Invariant property smplace_163 does not hold.
Invariant property smplace_110 does not hold.
Invariant property smplace_109 does not hold.
SDD proceeding with computation,1098 properties remain. new max is 2048
SDD size :1.03748e+116 after 1.03748e+116
Invariant property smplace_194 does not hold.
Invariant property smplace_193 does not hold.
Invariant property smplace_192 does not hold.
Invariant property smplace_178 does not hold.
Invariant property smplace_173 does not hold.
Invariant property smplace_172 does not hold.
Invariant property smplace_171 does not hold.
Invariant property smplace_170 does not hold.
Invariant property smplace_169 does not hold.
Invariant property smplace_168 does not hold.
Invariant property smplace_162 does not hold.
Invariant property smplace_161 does not hold.
Invariant property smplace_160 does not hold.
Invariant property smplace_157 does not hold.
Invariant property smplace_156 does not hold.
SDD proceeding with computation,1083 properties remain. new max is 2048
SDD size :1.03748e+116 after 1.03748e+116
SDD proceeding with computation,1083 properties remain. new max is 4096
SDD size :1.03748e+116 after 1.03748e+116
SDD proceeding with computation,1083 properties remain. new max is 8192
SDD size :1.03748e+116 after 1.03748e+116
Invariant property smplace_245 does not hold.
Invariant property smplace_244 does not hold.
Invariant property smplace_243 does not hold.
Invariant property smplace_242 does not hold.
Invariant property smplace_241 does not hold.
Invariant property smplace_240 does not hold.
Invariant property smplace_239 does not hold.
Invariant property smplace_228 does not hold.
Invariant property smplace_227 does not hold.
Invariant property smplace_222 does not hold.
Invariant property smplace_221 does not hold.
Invariant property smplace_220 does not hold.
Invariant property smplace_219 does not hold.
Invariant property smplace_218 does not hold.
Invariant property smplace_217 does not hold.
Invariant property smplace_212 does not hold.
Invariant property smplace_211 does not hold.
Invariant property smplace_210 does not hold.
Invariant property smplace_206 does not hold.
Invariant property smplace_205 does not hold.
Invariant property smplace_159 does not hold.
Invariant property smplace_158 does not hold.
SDD proceeding with computation,1061 properties remain. new max is 8192
SDD size :1.03748e+116 after 1.03748e+116
SDD proceeding with computation,1061 properties remain. new max is 16384
SDD size :1.03748e+116 after 1.03748e+116
Invariant property smplace_294 does not hold.
Invariant property smplace_293 does not hold.
Invariant property smplace_292 does not hold.
Invariant property smplace_291 does not hold.
Invariant property smplace_290 does not hold.
Invariant property smplace_289 does not hold.
Invariant property smplace_288 does not hold.
Invariant property smplace_277 does not hold.
Invariant property smplace_276 does not hold.
Invariant property smplace_271 does not hold.
Invariant property smplace_270 does not hold.
Invariant property smplace_269 does not hold.
Invariant property smplace_268 does not hold.
Invariant property smplace_267 does not hold.
Invariant property smplace_266 does not hold.
Invariant property smplace_261 does not hold.
Invariant property smplace_260 does not hold.
Invariant property smplace_259 does not hold.
Invariant property smplace_255 does not hold.
Invariant property smplace_254 does not hold.
Invariant property smplace_209 does not hold.
Invariant property smplace_208 does not hold.
Invariant property smplace_207 does not hold.
SDD proceeding with computation,1038 properties remain. new max is 16384
SDD size :1.03748e+116 after 1.03748e+116
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/505 variables, 0/0 constraints. Problems are: Problem set: 41 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 288/793 variables, 93/93 constraints. Problems are: Problem set: 68 solved, 437 unsolved
SDD proceeding with computation,1038 properties remain. new max is 32768
SDD size :1.03748e+116 after 1.03748e+116
At refinement iteration 2 (INCLUDED_ONLY) 0/793 variables, 0/93 constraints. Problems are: Problem set: 68 solved, 437 unsolved
At refinement iteration 3 (OVERLAPS) 800/1593 variables, 793/886 constraints. Problems are: Problem set: 68 solved, 437 unsolved
Invariant property smplace_343 does not hold.
Invariant property smplace_342 does not hold.
Invariant property smplace_341 does not hold.
Invariant property smplace_340 does not hold.
Invariant property smplace_339 does not hold.
Invariant property smplace_338 does not hold.
Invariant property smplace_337 does not hold.
Invariant property smplace_326 does not hold.
Invariant property smplace_325 does not hold.
Invariant property smplace_320 does not hold.
Invariant property smplace_319 does not hold.
Invariant property smplace_318 does not hold.
Invariant property smplace_317 does not hold.
Invariant property smplace_316 does not hold.
Invariant property smplace_315 does not hold.
Invariant property smplace_310 does not hold.
Invariant property smplace_309 does not hold.
Invariant property smplace_308 does not hold.
Invariant property smplace_304 does not hold.
Invariant property smplace_303 does not hold.
Invariant property smplace_258 does not hold.
Invariant property smplace_257 does not hold.
Invariant property smplace_256 does not hold.
SDD proceeding with computation,1015 properties remain. new max is 32768
SDD size :1.03748e+116 after 1.03748e+116
Invariant property smplace_392 does not hold.
Invariant property smplace_391 does not hold.
Invariant property smplace_390 does not hold.
Invariant property smplace_389 does not hold.
Invariant property smplace_388 does not hold.
Invariant property smplace_387 does not hold.
Invariant property smplace_386 does not hold.
Invariant property smplace_375 does not hold.
Invariant property smplace_374 does not hold.
Invariant property smplace_369 does not hold.
Invariant property smplace_368 does not hold.
Invariant property smplace_367 does not hold.
Invariant property smplace_366 does not hold.
Invariant property smplace_365 does not hold.
Invariant property smplace_364 does not hold.
Invariant property smplace_359 does not hold.
Invariant property smplace_358 does not hold.
Invariant property smplace_357 does not hold.
Invariant property smplace_353 does not hold.
Invariant property smplace_352 does not hold.
Invariant property smplace_307 does not hold.
Invariant property smplace_306 does not hold.
Invariant property smplace_305 does not hold.
SDD proceeding with computation,992 properties remain. new max is 32768
SDD size :1.03748e+116 after 1.03748e+116
At refinement iteration 4 (INCLUDED_ONLY) 0/1593 variables, 0/886 constraints. Problems are: Problem set: 114 solved, 391 unsolved
Invariant property smplace_441 does not hold.
Invariant property smplace_440 does not hold.
Invariant property smplace_439 does not hold.
Invariant property smplace_438 does not hold.
Invariant property smplace_437 does not hold.
Invariant property smplace_436 does not hold.
Invariant property smplace_435 does not hold.
Invariant property smplace_424 does not hold.
Invariant property smplace_423 does not hold.
Invariant property smplace_418 does not hold.
Invariant property smplace_417 does not hold.
Invariant property smplace_416 does not hold.
Invariant property smplace_415 does not hold.
Invariant property smplace_414 does not hold.
Invariant property smplace_413 does not hold.
Invariant property smplace_408 does not hold.
Invariant property smplace_407 does not hold.
Invariant property smplace_406 does not hold.
Invariant property smplace_402 does not hold.
Invariant property smplace_401 does not hold.
Invariant property smplace_356 does not hold.
Invariant property smplace_355 does not hold.
Invariant property smplace_354 does not hold.
SDD proceeding with computation,969 properties remain. new max is 32768
SDD size :1.03748e+116 after 1.03748e+116
SDD proceeding with computation,969 properties remain. new max is 65536
SDD size :1.03748e+116 after 1.03748e+116
At refinement iteration 5 (OVERLAPS) 74/1667 variables, 34/920 constraints. Problems are: Problem set: 137 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1667/2880 variables, and 920 constraints, problems are : Problem set: 137 solved, 368 unsolved in 45028 ms.
Refiners :[Positive P Invariants (semi-flows): 93/200 constraints, State Equation: 827/1413 constraints, PredecessorRefiner: 505/505 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 137 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 0/0 constraints. Problems are: Problem set: 137 solved, 368 unsolved
At refinement iteration 1 (OVERLAPS) 221/589 variables, 69/69 constraints. Problems are: Problem set: 137 solved, 368 unsolved
[2024-05-28 17:33:18] [INFO ] Deduced a trap composed of 154 places in 215 ms of which 46 ms to minimize.
[2024-05-28 17:33:18] [INFO ] Deduced a trap composed of 154 places in 174 ms of which 3 ms to minimize.
[2024-05-28 17:33:19] [INFO ] Deduced a trap composed of 148 places in 144 ms of which 3 ms to minimize.
[2024-05-28 17:33:19] [INFO ] Deduced a trap composed of 160 places in 147 ms of which 3 ms to minimize.
[2024-05-28 17:33:19] [INFO ] Deduced a trap composed of 156 places in 144 ms of which 3 ms to minimize.
[2024-05-28 17:33:19] [INFO ] Deduced a trap composed of 154 places in 147 ms of which 3 ms to minimize.
[2024-05-28 17:33:19] [INFO ] Deduced a trap composed of 152 places in 131 ms of which 2 ms to minimize.
[2024-05-28 17:33:19] [INFO ] Deduced a trap composed of 160 places in 139 ms of which 3 ms to minimize.
[2024-05-28 17:33:19] [INFO ] Deduced a trap composed of 150 places in 145 ms of which 3 ms to minimize.
[2024-05-28 17:33:20] [INFO ] Deduced a trap composed of 162 places in 120 ms of which 2 ms to minimize.
[2024-05-28 17:33:20] [INFO ] Deduced a trap composed of 150 places in 130 ms of which 3 ms to minimize.
[2024-05-28 17:33:20] [INFO ] Deduced a trap composed of 146 places in 112 ms of which 3 ms to minimize.
[2024-05-28 17:33:20] [INFO ] Deduced a trap composed of 158 places in 128 ms of which 2 ms to minimize.
[2024-05-28 17:33:20] [INFO ] Deduced a trap composed of 154 places in 130 ms of which 3 ms to minimize.
[2024-05-28 17:33:20] [INFO ] Deduced a trap composed of 152 places in 152 ms of which 3 ms to minimize.
[2024-05-28 17:33:20] [INFO ] Deduced a trap composed of 156 places in 118 ms of which 3 ms to minimize.
[2024-05-28 17:33:21] [INFO ] Deduced a trap composed of 148 places in 127 ms of which 3 ms to minimize.
[2024-05-28 17:33:21] [INFO ] Deduced a trap composed of 150 places in 115 ms of which 3 ms to minimize.
[2024-05-28 17:33:21] [INFO ] Deduced a trap composed of 150 places in 133 ms of which 3 ms to minimize.
[2024-05-28 17:33:21] [INFO ] Deduced a trap composed of 148 places in 131 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 20/89 constraints. Problems are: Problem set: 137 solved, 368 unsolved
[2024-05-28 17:33:21] [INFO ] Deduced a trap composed of 150 places in 141 ms of which 3 ms to minimize.
[2024-05-28 17:33:21] [INFO ] Deduced a trap composed of 160 places in 136 ms of which 3 ms to minimize.
[2024-05-28 17:33:22] [INFO ] Deduced a trap composed of 154 places in 130 ms of which 2 ms to minimize.
[2024-05-28 17:33:22] [INFO ] Deduced a trap composed of 150 places in 134 ms of which 3 ms to minimize.
[2024-05-28 17:33:22] [INFO ] Deduced a trap composed of 148 places in 151 ms of which 3 ms to minimize.
[2024-05-28 17:33:22] [INFO ] Deduced a trap composed of 160 places in 135 ms of which 3 ms to minimize.
[2024-05-28 17:33:22] [INFO ] Deduced a trap composed of 166 places in 128 ms of which 3 ms to minimize.
[2024-05-28 17:33:22] [INFO ] Deduced a trap composed of 154 places in 133 ms of which 2 ms to minimize.
[2024-05-28 17:33:22] [INFO ] Deduced a trap composed of 164 places in 132 ms of which 3 ms to minimize.
[2024-05-28 17:33:23] [INFO ] Deduced a trap composed of 160 places in 141 ms of which 2 ms to minimize.
[2024-05-28 17:33:23] [INFO ] Deduced a trap composed of 158 places in 132 ms of which 3 ms to minimize.
[2024-05-28 17:33:23] [INFO ] Deduced a trap composed of 154 places in 136 ms of which 3 ms to minimize.
[2024-05-28 17:33:23] [INFO ] Deduced a trap composed of 152 places in 133 ms of which 5 ms to minimize.
Invariant property smplace_490 does not hold.
Invariant property smplace_489 does not hold.
Invariant property smplace_488 does not hold.
Invariant property smplace_487 does not hold.
Invariant property smplace_486 does not hold.
Invariant property smplace_485 does not hold.
Invariant property smplace_484 does not hold.
Invariant property smplace_473 does not hold.
Invariant property smplace_472 does not hold.
Invariant property smplace_467 does not hold.
Invariant property smplace_466 does not hold.
Invariant property smplace_465 does not hold.
Invariant property smplace_464 does not hold.
Invariant property smplace_463 does not hold.
Invariant property smplace_462 does not hold.
Invariant property smplace_457 does not hold.
Invariant property smplace_456 does not hold.
[2024-05-28 17:33:23] [INFO ] Deduced a trap composed of 156 places in 142 ms of which 7 ms to minimize.
Invariant property smplace_455 does not hold.
Invariant property smplace_451 does not hold.
Invariant property smplace_450 does not hold.
Invariant property smplace_405 does not hold.
Invariant property smplace_404 does not hold.
Invariant property smplace_403 does not hold.
SDD proceeding with computation,946 properties remain. new max is 65536
SDD size :1.03748e+116 after 1.03748e+116
[2024-05-28 17:33:23] [INFO ] Deduced a trap composed of 154 places in 130 ms of which 3 ms to minimize.
[2024-05-28 17:33:24] [INFO ] Deduced a trap composed of 158 places in 137 ms of which 2 ms to minimize.
[2024-05-28 17:33:24] [INFO ] Deduced a trap composed of 156 places in 133 ms of which 2 ms to minimize.
[2024-05-28 17:33:24] [INFO ] Deduced a trap composed of 158 places in 135 ms of which 3 ms to minimize.
[2024-05-28 17:33:24] [INFO ] Deduced a trap composed of 160 places in 133 ms of which 3 ms to minimize.
[2024-05-28 17:33:24] [INFO ] Deduced a trap composed of 152 places in 134 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/589 variables, 20/109 constraints. Problems are: Problem set: 160 solved, 345 unsolved
[2024-05-28 17:33:24] [INFO ] Deduced a trap composed of 146 places in 137 ms of which 3 ms to minimize.
[2024-05-28 17:33:25] [INFO ] Deduced a trap composed of 152 places in 136 ms of which 3 ms to minimize.
[2024-05-28 17:33:25] [INFO ] Deduced a trap composed of 156 places in 124 ms of which 2 ms to minimize.
[2024-05-28 17:33:25] [INFO ] Deduced a trap composed of 148 places in 128 ms of which 3 ms to minimize.
[2024-05-28 17:33:25] [INFO ] Deduced a trap composed of 140 places in 122 ms of which 3 ms to minimize.
[2024-05-28 17:33:25] [INFO ] Deduced a trap composed of 152 places in 119 ms of which 3 ms to minimize.
[2024-05-28 17:33:25] [INFO ] Deduced a trap composed of 150 places in 127 ms of which 2 ms to minimize.
[2024-05-28 17:33:25] [INFO ] Deduced a trap composed of 138 places in 127 ms of which 2 ms to minimize.
[2024-05-28 17:33:25] [INFO ] Deduced a trap composed of 154 places in 125 ms of which 2 ms to minimize.
[2024-05-28 17:33:26] [INFO ] Deduced a trap composed of 134 places in 123 ms of which 2 ms to minimize.
[2024-05-28 17:33:26] [INFO ] Deduced a trap composed of 150 places in 122 ms of which 4 ms to minimize.
[2024-05-28 17:33:26] [INFO ] Deduced a trap composed of 146 places in 124 ms of which 2 ms to minimize.
[2024-05-28 17:33:26] [INFO ] Deduced a trap composed of 146 places in 121 ms of which 2 ms to minimize.
[2024-05-28 17:33:26] [INFO ] Deduced a trap composed of 144 places in 125 ms of which 3 ms to minimize.
[2024-05-28 17:33:27] [INFO ] Deduced a trap composed of 144 places in 127 ms of which 3 ms to minimize.
[2024-05-28 17:33:27] [INFO ] Deduced a trap composed of 150 places in 132 ms of which 10 ms to minimize.
[2024-05-28 17:33:27] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:33:27] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:33:27] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:33:27] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/589 variables, 20/129 constraints. Problems are: Problem set: 160 solved, 345 unsolved
[2024-05-28 17:33:28] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
[2024-05-28 17:33:28] [INFO ] Deduced a trap composed of 136 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:33:29] [INFO ] Deduced a trap composed of 130 places in 118 ms of which 3 ms to minimize.
[2024-05-28 17:33:29] [INFO ] Deduced a trap composed of 120 places in 116 ms of which 3 ms to minimize.
[2024-05-28 17:33:29] [INFO ] Deduced a trap composed of 118 places in 107 ms of which 2 ms to minimize.
[2024-05-28 17:33:29] [INFO ] Deduced a trap composed of 128 places in 107 ms of which 2 ms to minimize.
[2024-05-28 17:33:29] [INFO ] Deduced a trap composed of 128 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:33:29] [INFO ] Deduced a trap composed of 124 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:33:29] [INFO ] Deduced a trap composed of 132 places in 109 ms of which 2 ms to minimize.
[2024-05-28 17:33:29] [INFO ] Deduced a trap composed of 128 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:33:30] [INFO ] Deduced a trap composed of 122 places in 116 ms of which 3 ms to minimize.
[2024-05-28 17:33:30] [INFO ] Deduced a trap composed of 128 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:33:30] [INFO ] Deduced a trap composed of 130 places in 109 ms of which 2 ms to minimize.
[2024-05-28 17:33:30] [INFO ] Deduced a trap composed of 126 places in 109 ms of which 3 ms to minimize.
[2024-05-28 17:33:30] [INFO ] Deduced a trap composed of 130 places in 110 ms of which 3 ms to minimize.
[2024-05-28 17:33:30] [INFO ] Deduced a trap composed of 130 places in 111 ms of which 2 ms to minimize.
[2024-05-28 17:33:31] [INFO ] Deduced a trap composed of 116 places in 113 ms of which 3 ms to minimize.
[2024-05-28 17:33:31] [INFO ] Deduced a trap composed of 118 places in 104 ms of which 3 ms to minimize.
[2024-05-28 17:33:31] [INFO ] Deduced a trap composed of 126 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:33:31] [INFO ] Deduced a trap composed of 116 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 20/149 constraints. Problems are: Problem set: 160 solved, 345 unsolved
[2024-05-28 17:33:31] [INFO ] Deduced a trap composed of 152 places in 134 ms of which 3 ms to minimize.
[2024-05-28 17:33:31] [INFO ] Deduced a trap composed of 142 places in 130 ms of which 3 ms to minimize.
[2024-05-28 17:33:32] [INFO ] Deduced a trap composed of 142 places in 130 ms of which 3 ms to minimize.
[2024-05-28 17:33:32] [INFO ] Deduced a trap composed of 148 places in 126 ms of which 2 ms to minimize.
[2024-05-28 17:33:32] [INFO ] Deduced a trap composed of 148 places in 126 ms of which 2 ms to minimize.
[2024-05-28 17:33:32] [INFO ] Deduced a trap composed of 146 places in 127 ms of which 3 ms to minimize.
[2024-05-28 17:33:32] [INFO ] Deduced a trap composed of 144 places in 128 ms of which 3 ms to minimize.
[2024-05-28 17:33:32] [INFO ] Deduced a trap composed of 148 places in 125 ms of which 3 ms to minimize.
[2024-05-28 17:33:32] [INFO ] Deduced a trap composed of 146 places in 128 ms of which 2 ms to minimize.
[2024-05-28 17:33:32] [INFO ] Deduced a trap composed of 146 places in 132 ms of which 3 ms to minimize.
[2024-05-28 17:33:33] [INFO ] Deduced a trap composed of 152 places in 131 ms of which 2 ms to minimize.
[2024-05-28 17:33:33] [INFO ] Deduced a trap composed of 148 places in 127 ms of which 2 ms to minimize.
[2024-05-28 17:33:33] [INFO ] Deduced a trap composed of 150 places in 124 ms of which 2 ms to minimize.
[2024-05-28 17:33:33] [INFO ] Deduced a trap composed of 148 places in 128 ms of which 2 ms to minimize.
[2024-05-28 17:33:33] [INFO ] Deduced a trap composed of 152 places in 121 ms of which 3 ms to minimize.
[2024-05-28 17:33:33] [INFO ] Deduced a trap composed of 154 places in 125 ms of which 3 ms to minimize.
[2024-05-28 17:33:33] [INFO ] Deduced a trap composed of 150 places in 124 ms of which 3 ms to minimize.
[2024-05-28 17:33:34] [INFO ] Deduced a trap composed of 140 places in 130 ms of which 2 ms to minimize.
[2024-05-28 17:33:34] [INFO ] Deduced a trap composed of 150 places in 133 ms of which 2 ms to minimize.
[2024-05-28 17:33:34] [INFO ] Deduced a trap composed of 144 places in 135 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 20/169 constraints. Problems are: Problem set: 160 solved, 345 unsolved
[2024-05-28 17:33:35] [INFO ] Deduced a trap composed of 128 places in 128 ms of which 3 ms to minimize.
[2024-05-28 17:33:35] [INFO ] Deduced a trap composed of 130 places in 127 ms of which 2 ms to minimize.
[2024-05-28 17:33:35] [INFO ] Deduced a trap composed of 126 places in 125 ms of which 3 ms to minimize.
[2024-05-28 17:33:35] [INFO ] Deduced a trap composed of 132 places in 124 ms of which 2 ms to minimize.
[2024-05-28 17:33:35] [INFO ] Deduced a trap composed of 130 places in 124 ms of which 3 ms to minimize.
[2024-05-28 17:33:36] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 2 ms to minimize.
[2024-05-28 17:33:36] [INFO ] Deduced a trap composed of 134 places in 119 ms of which 3 ms to minimize.
[2024-05-28 17:33:36] [INFO ] Deduced a trap composed of 130 places in 120 ms of which 3 ms to minimize.
[2024-05-28 17:33:36] [INFO ] Deduced a trap composed of 128 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:33:36] [INFO ] Deduced a trap composed of 130 places in 115 ms of which 2 ms to minimize.
[2024-05-28 17:33:36] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2024-05-28 17:33:36] [INFO ] Deduced a trap composed of 130 places in 116 ms of which 2 ms to minimize.
[2024-05-28 17:33:37] [INFO ] Deduced a trap composed of 132 places in 117 ms of which 2 ms to minimize.
[2024-05-28 17:33:37] [INFO ] Deduced a trap composed of 136 places in 122 ms of which 3 ms to minimize.
[2024-05-28 17:33:37] [INFO ] Deduced a trap composed of 136 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:33:37] [INFO ] Deduced a trap composed of 122 places in 119 ms of which 3 ms to minimize.
[2024-05-28 17:33:37] [INFO ] Deduced a trap composed of 128 places in 122 ms of which 3 ms to minimize.
[2024-05-28 17:33:37] [INFO ] Deduced a trap composed of 132 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:33:37] [INFO ] Deduced a trap composed of 126 places in 122 ms of which 3 ms to minimize.
[2024-05-28 17:33:37] [INFO ] Deduced a trap composed of 126 places in 124 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/589 variables, 20/189 constraints. Problems are: Problem set: 160 solved, 345 unsolved
[2024-05-28 17:33:39] [INFO ] Deduced a trap composed of 96 places in 138 ms of which 2 ms to minimize.
[2024-05-28 17:33:39] [INFO ] Deduced a trap composed of 126 places in 128 ms of which 3 ms to minimize.
[2024-05-28 17:33:39] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 3 ms to minimize.
[2024-05-28 17:33:39] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 3 ms to minimize.
[2024-05-28 17:33:39] [INFO ] Deduced a trap composed of 18 places in 128 ms of which 3 ms to minimize.
[2024-05-28 17:33:39] [INFO ] Deduced a trap composed of 146 places in 130 ms of which 2 ms to minimize.
[2024-05-28 17:33:39] [INFO ] Deduced a trap composed of 142 places in 120 ms of which 3 ms to minimize.
[2024-05-28 17:33:40] [INFO ] Deduced a trap composed of 138 places in 127 ms of which 2 ms to minimize.
[2024-05-28 17:33:40] [INFO ] Deduced a trap composed of 142 places in 122 ms of which 2 ms to minimize.
[2024-05-28 17:33:40] [INFO ] Deduced a trap composed of 148 places in 124 ms of which 2 ms to minimize.
[2024-05-28 17:33:40] [INFO ] Deduced a trap composed of 146 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:33:40] [INFO ] Deduced a trap composed of 152 places in 118 ms of which 3 ms to minimize.
[2024-05-28 17:33:40] [INFO ] Deduced a trap composed of 148 places in 122 ms of which 3 ms to minimize.
[2024-05-28 17:33:40] [INFO ] Deduced a trap composed of 150 places in 123 ms of which 2 ms to minimize.
[2024-05-28 17:33:40] [INFO ] Deduced a trap composed of 144 places in 125 ms of which 2 ms to minimize.
[2024-05-28 17:33:41] [INFO ] Deduced a trap composed of 146 places in 145 ms of which 2 ms to minimize.
[2024-05-28 17:33:41] [INFO ] Deduced a trap composed of 154 places in 125 ms of which 2 ms to minimize.
[2024-05-28 17:33:41] [INFO ] Deduced a trap composed of 104 places in 124 ms of which 2 ms to minimize.
[2024-05-28 17:33:41] [INFO ] Deduced a trap composed of 148 places in 125 ms of which 2 ms to minimize.
[2024-05-28 17:33:41] [INFO ] Deduced a trap composed of 108 places in 122 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/589 variables, 20/209 constraints. Problems are: Problem set: 160 solved, 345 unsolved
[2024-05-28 17:33:42] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 3 ms to minimize.
[2024-05-28 17:33:42] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 4 ms to minimize.
[2024-05-28 17:33:43] [INFO ] Deduced a trap composed of 128 places in 114 ms of which 3 ms to minimize.
[2024-05-28 17:33:43] [INFO ] Deduced a trap composed of 128 places in 113 ms of which 2 ms to minimize.
[2024-05-28 17:33:43] [INFO ] Deduced a trap composed of 130 places in 115 ms of which 2 ms to minimize.
[2024-05-28 17:33:43] [INFO ] Deduced a trap composed of 132 places in 123 ms of which 2 ms to minimize.
[2024-05-28 17:33:43] [INFO ] Deduced a trap composed of 130 places in 121 ms of which 3 ms to minimize.
[2024-05-28 17:33:43] [INFO ] Deduced a trap composed of 128 places in 115 ms of which 3 ms to minimize.
[2024-05-28 17:33:44] [INFO ] Deduced a trap composed of 112 places in 107 ms of which 2 ms to minimize.
[2024-05-28 17:33:44] [INFO ] Deduced a trap composed of 124 places in 105 ms of which 3 ms to minimize.
[2024-05-28 17:33:44] [INFO ] Deduced a trap composed of 120 places in 107 ms of which 2 ms to minimize.
[2024-05-28 17:33:44] [INFO ] Deduced a trap composed of 124 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:33:44] [INFO ] Deduced a trap composed of 118 places in 106 ms of which 2 ms to minimize.
[2024-05-28 17:33:44] [INFO ] Deduced a trap composed of 118 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:33:44] [INFO ] Deduced a trap composed of 124 places in 102 ms of which 2 ms to minimize.
[2024-05-28 17:33:45] [INFO ] Deduced a trap composed of 118 places in 108 ms of which 2 ms to minimize.
[2024-05-28 17:33:45] [INFO ] Deduced a trap composed of 120 places in 101 ms of which 2 ms to minimize.
[2024-05-28 17:33:45] [INFO ] Deduced a trap composed of 122 places in 105 ms of which 2 ms to minimize.
[2024-05-28 17:33:45] [INFO ] Deduced a trap composed of 124 places in 101 ms of which 3 ms to minimize.
[2024-05-28 17:33:45] [INFO ] Deduced a trap composed of 120 places in 112 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 20/229 constraints. Problems are: Problem set: 160 solved, 345 unsolved
[2024-05-28 17:33:45] [INFO ] Deduced a trap composed of 136 places in 130 ms of which 2 ms to minimize.
[2024-05-28 17:33:46] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2024-05-28 17:33:46] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-28 17:33:47] [INFO ] Deduced a trap composed of 124 places in 127 ms of which 2 ms to minimize.
[2024-05-28 17:33:47] [INFO ] Deduced a trap composed of 124 places in 121 ms of which 2 ms to minimize.
[2024-05-28 17:33:47] [INFO ] Deduced a trap composed of 128 places in 123 ms of which 2 ms to minimize.
[2024-05-28 17:33:47] [INFO ] Deduced a trap composed of 134 places in 123 ms of which 3 ms to minimize.
[2024-05-28 17:33:47] [INFO ] Deduced a trap composed of 126 places in 120 ms of which 3 ms to minimize.
[2024-05-28 17:33:47] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-05-28 17:33:48] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 3 ms to minimize.
[2024-05-28 17:33:49] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 3 ms to minimize.
[2024-05-28 17:33:49] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:33:49] [INFO ] Deduced a trap composed of 42 places in 68 ms of which 1 ms to minimize.
[2024-05-28 17:33:49] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 2 ms to minimize.
[2024-05-28 17:33:49] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:33:50] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-05-28 17:33:50] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 17/246 constraints. Problems are: Problem set: 160 solved, 345 unsolved
[2024-05-28 17:33:56] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:33:56] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
[2024-05-28 17:33:56] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-05-28 17:33:57] [INFO ] Deduced a trap composed of 76 places in 70 ms of which 2 ms to minimize.
[2024-05-28 17:33:57] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 2 ms to minimize.
[2024-05-28 17:33:57] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:33:57] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-05-28 17:33:57] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 1 ms to minimize.
[2024-05-28 17:33:58] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-05-28 17:33:58] [INFO ] Deduced a trap composed of 98 places in 91 ms of which 1 ms to minimize.
[2024-05-28 17:33:58] [INFO ] Deduced a trap composed of 94 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:33:58] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 1 ms to minimize.
[2024-05-28 17:33:59] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 2 ms to minimize.
[2024-05-28 17:33:59] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 14/260 constraints. Problems are: Problem set: 160 solved, 345 unsolved
Error getting values : (error "ParserException while parsing response: ((s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 1)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 1)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 0)
(s292 1)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 1)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 1)
(s324 0)
(s325 0)
(s326 1)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 1)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 1)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 1)
(s358 0)
(s359 0)
(s360 1)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 1)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 1)
(s392 0)
(s393 0)
(s394 1)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 1)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 1)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 1)
(s426 0)
(s427 0)
(s428 1)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 1)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 1)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 1)
(s459 0)
(s460 0)
(s461 0)
(s462 1)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 1)
(s494 0)
(s495 0)
(s496 1)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 1)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 1)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 1)
(s528 0)
(s529 0)
(s530 1)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 1)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 589/2880 variables, and 260 constraints, problems are : Problem set: 160 solved, 345 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 69/200 constraints, State Equation: 0/1413 constraints, PredecessorRefiner: 0/505 constraints, Known Traps: 191/191 constraints]
After SMT, in 90182ms problems are : Problem set: 160 solved, 345 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 345 out of 1413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1413/1413 places, 1467/1467 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 208 rules applied. Total rules applied 208 place count 1413 transition count 1259
Reduce places removed 208 places and 0 transitions.
Iterating post reduction 1 with 208 rules applied. Total rules applied 416 place count 1205 transition count 1259
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 416 place count 1205 transition count 1148
Deduced a syphon composed of 111 places in 1 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 638 place count 1094 transition count 1148
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 704 place count 1028 transition count 1082
Iterating global reduction 2 with 66 rules applied. Total rules applied 770 place count 1028 transition count 1082
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 770 place count 1028 transition count 1016
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 902 place count 962 transition count 1016
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Deduced a syphon composed of 160 places in 1 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 1222 place count 802 transition count 856
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 1366 place count 730 transition count 924
Free-agglomeration rule applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1380 place count 730 transition count 910
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 1394 place count 716 transition count 910
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1395 place count 716 transition count 909
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 1396 place count 716 transition count 909
Applied a total of 1396 rules in 196 ms. Remains 716 /1413 variables (removed 697) and now considering 909/1467 (removed 558) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 716/1413 places, 909/1467 transitions.
RANDOM walk for 3788013 steps (994 resets) in 120005 ms. (31 steps per ms) remains 252/345 properties
BEST_FIRST walk for 40004 steps (10 resets) in 272 ms. (146 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 396 ms. (100 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (8 resets) in 383 ms. (104 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40002 steps (8 resets) in 354 ms. (112 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (8 resets) in 379 ms. (105 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (9 resets) in 374 ms. (106 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (9 resets) in 383 ms. (104 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40002 steps (8 resets) in 314 ms. (126 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (10 resets) in 355 ms. (112 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (11 resets) in 341 ms. (116 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 417 ms. (95 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (10 resets) in 379 ms. (105 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40002 steps (8 resets) in 352 ms. (113 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (8 resets) in 390 ms. (102 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40002 steps (8 resets) in 402 ms. (99 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 397 ms. (100 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (8 resets) in 375 ms. (106 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40002 steps (10 resets) in 366 ms. (108 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (8 resets) in 398 ms. (100 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (9 resets) in 389 ms. (102 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (10 resets) in 315 ms. (126 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (9 resets) in 353 ms. (113 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (9 resets) in 328 ms. (121 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (8 resets) in 351 ms. (113 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (8 resets) in 331 ms. (120 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (10 resets) in 382 ms. (104 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (10 resets) in 335 ms. (119 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (9 resets) in 412 ms. (96 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40003 steps (8 resets) in 390 ms. (102 steps per ms) remains 252/252 properties
BEST_FIRST walk for 40004 steps (8 resets) in 384 ms. (103 steps per ms) remains 252/252 properties
// Phase 1: matrix 909 rows 716 cols
[2024-05-28 17:34:37] [INFO ] Computed 200 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 117/369 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/369 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 381/750 variables, 369/419 constraints. Problems are: Problem set: 0 solved, 252 unsolved
SDD proceeding with computation,946 properties remain. new max is 131072
SDD size :1.03748e+116 after 1.03748e+116
At refinement iteration 4 (INCLUDED_ONLY) 0/750 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 81/831 variables, 35/454 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/831 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/831 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 30/861 variables, 10/468 constraints. Problems are: Problem set: 0 solved, 252 unsolved
SDD proceeding with computation,946 properties remain. new max is 262144
SDD size :1.03748e+116 after 1.03748e+116
At refinement iteration 9 (INCLUDED_ONLY) 0/861 variables, 5/473 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/861 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 11 (OVERLAPS) 55/916 variables, 39/512 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/916 variables, 5/517 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 14 (OVERLAPS) 1/917 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/917 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/917 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 17 (OVERLAPS) 47/964 variables, 18/537 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/964 variables, 7/544 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/964 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 20 (OVERLAPS) 3/967 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Invariant property smplace_588 does not hold.
Invariant property smplace_587 does not hold.
Invariant property smplace_586 does not hold.
Invariant property smplace_585 does not hold.
Invariant property smplace_584 does not hold.
Invariant property smplace_583 does not hold.
Invariant property smplace_582 does not hold.
Invariant property smplace_571 does not hold.
Invariant property smplace_570 does not hold.
Invariant property smplace_565 does not hold.
Invariant property smplace_564 does not hold.
Invariant property smplace_563 does not hold.
Invariant property smplace_562 does not hold.
Invariant property smplace_561 does not hold.
Invariant property smplace_560 does not hold.
Invariant property smplace_555 does not hold.
Invariant property smplace_554 does not hold.
Invariant property smplace_553 does not hold.
Invariant property smplace_549 does not hold.
Invariant property smplace_548 does not hold.
Invariant property smplace_539 does not hold.
Invariant property smplace_538 does not hold.
Invariant property smplace_537 does not hold.
Invariant property smplace_536 does not hold.
Invariant property smplace_535 does not hold.
Invariant property smplace_534 does not hold.
Invariant property smplace_533 does not hold.
Invariant property smplace_522 does not hold.
Invariant property smplace_521 does not hold.
Invariant property smplace_516 does not hold.
Invariant property smplace_515 does not hold.
Invariant property smplace_514 does not hold.
Invariant property smplace_513 does not hold.
Invariant property smplace_512 does not hold.
Invariant property smplace_511 does not hold.
Invariant property smplace_506 does not hold.
Invariant property smplace_505 does not hold.
Invariant property smplace_504 does not hold.
Invariant property smplace_503 does not hold.
Invariant property smplace_502 does not hold.
Invariant property smplace_501 does not hold.
Invariant property smplace_500 does not hold.
Invariant property smplace_499 does not hold.
Invariant property smplace_454 does not hold.
Invariant property smplace_453 does not hold.
Invariant property smplace_452 does not hold.
SDD proceeding with computation,900 properties remain. new max is 262144
SDD size :1.03748e+116 after 1.03748e+116
At refinement iteration 21 (INCLUDED_ONLY) 0/967 variables, 0/545 constraints. Problems are: Problem set: 46 solved, 206 unsolved
At refinement iteration 22 (OVERLAPS) 50/1017 variables, 19/564 constraints. Problems are: Problem set: 46 solved, 206 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1017 variables, 6/570 constraints. Problems are: Problem set: 46 solved, 206 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1017 variables, 0/570 constraints. Problems are: Problem set: 46 solved, 206 unsolved
At refinement iteration 25 (OVERLAPS) 2/1019 variables, 2/572 constraints. Problems are: Problem set: 46 solved, 206 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1019 variables, 2/574 constraints. Problems are: Problem set: 46 solved, 206 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1019/1625 variables, and 574 constraints, problems are : Problem set: 46 solved, 206 unsolved in 75029 ms.
Refiners :[Positive P Invariants (semi-flows): 86/200 constraints, State Equation: 488/716 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 206 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 46 solved, 206 unsolved
At refinement iteration 1 (OVERLAPS) 109/315 variables, 42/42 constraints. Problems are: Problem set: 46 solved, 206 unsolved
[2024-05-28 17:35:53] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 2 ms to minimize.
[2024-05-28 17:35:53] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:35:53] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:35:53] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:35:53] [INFO ] Deduced a trap composed of 73 places in 81 ms of which 1 ms to minimize.
[2024-05-28 17:35:53] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:35:53] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:35:53] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-28 17:35:53] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-28 17:35:54] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:35:54] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 1 ms to minimize.
[2024-05-28 17:35:54] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-28 17:35:54] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-28 17:35:54] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-28 17:35:54] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-28 17:35:54] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-28 17:35:54] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:35:54] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 2 ms to minimize.
[2024-05-28 17:35:54] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:35:54] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/315 variables, 20/62 constraints. Problems are: Problem set: 46 solved, 206 unsolved
[2024-05-28 17:35:55] [INFO ] Deduced a trap composed of 62 places in 69 ms of which 1 ms to minimize.
[2024-05-28 17:35:55] [INFO ] Deduced a trap composed of 54 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:35:55] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
[2024-05-28 17:35:55] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 2 ms to minimize.
[2024-05-28 17:35:55] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 3 ms to minimize.
[2024-05-28 17:35:55] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:35:55] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:35:55] [INFO ] Deduced a trap composed of 55 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:35:55] [INFO ] Deduced a trap composed of 53 places in 53 ms of which 2 ms to minimize.
[2024-05-28 17:35:56] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-28 17:35:56] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:35:56] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 2 ms to minimize.
[2024-05-28 17:35:56] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:35:56] [INFO ] Deduced a trap composed of 37 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:35:56] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:35:56] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:35:56] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-28 17:35:56] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-28 17:35:57] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 19/81 constraints. Problems are: Problem set: 46 solved, 206 unsolved
[2024-05-28 17:35:57] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 4 ms to minimize.
[2024-05-28 17:35:58] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 2 ms to minimize.
[2024-05-28 17:35:58] [INFO ] Deduced a trap composed of 48 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:35:58] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2024-05-28 17:35:58] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:35:58] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2024-05-28 17:35:59] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 2 ms to minimize.
[2024-05-28 17:35:59] [INFO ] Deduced a trap composed of 66 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 8/89 constraints. Problems are: Problem set: 46 solved, 206 unsolved
[2024-05-28 17:35:59] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 1/90 constraints. Problems are: Problem set: 46 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/90 constraints. Problems are: Problem set: 46 solved, 206 unsolved
At refinement iteration 7 (OVERLAPS) 323/638 variables, 315/405 constraints. Problems are: Problem set: 46 solved, 206 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/638 variables, 206/611 constraints. Problems are: Problem set: 46 solved, 206 unsolved
[2024-05-28 17:36:05] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:36:05] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 17:36:05] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-28 17:36:05] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-28 17:36:06] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 17:36:06] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:36:07] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:36:07] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 17:36:07] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/638 variables, 9/620 constraints. Problems are: Problem set: 46 solved, 206 unsolved
[2024-05-28 17:36:12] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 17:36:13] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:36:13] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:36:13] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:36:13] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:36:14] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-28 17:36:14] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:36:14] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/638 variables, 8/628 constraints. Problems are: Problem set: 46 solved, 206 unsolved
[2024-05-28 17:36:22] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/638 variables, 1/629 constraints. Problems are: Problem set: 46 solved, 206 unsolved
Invariant property smplace_686 does not hold.
Invariant property smplace_685 does not hold.
Invariant property smplace_684 does not hold.
Invariant property smplace_683 does not hold.
Invariant property smplace_682 does not hold.
Invariant property smplace_681 does not hold.
Invariant property smplace_680 does not hold.
Invariant property smplace_669 does not hold.
Invariant property smplace_668 does not hold.
Invariant property smplace_663 does not hold.
Invariant property smplace_662 does not hold.
Invariant property smplace_661 does not hold.
Invariant property smplace_660 does not hold.
Invariant property smplace_659 does not hold.
Invariant property smplace_658 does not hold.
Invariant property smplace_653 does not hold.
Invariant property smplace_652 does not hold.
Invariant property smplace_651 does not hold.
Invariant property smplace_647 does not hold.
Invariant property smplace_646 does not hold.
Invariant property smplace_637 does not hold.
Invariant property smplace_636 does not hold.
Invariant property smplace_635 does not hold.
Invariant property smplace_634 does not hold.
Invariant property smplace_633 does not hold.
Invariant property smplace_632 does not hold.
Invariant property smplace_631 does not hold.
Invariant property smplace_620 does not hold.
Invariant property smplace_619 does not hold.
Invariant property smplace_614 does not hold.
Invariant property smplace_613 does not hold.
Invariant property smplace_612 does not hold.
Invariant property smplace_611 does not hold.
Invariant property smplace_610 does not hold.
Invariant property smplace_609 does not hold.
Invariant property smplace_604 does not hold.
Invariant property smplace_603 does not hold.
Invariant property smplace_602 does not hold.
Invariant property smplace_601 does not hold.
Invariant property smplace_600 does not hold.
Invariant property smplace_599 does not hold.
Invariant property smplace_598 does not hold.
Invariant property smplace_597 does not hold.
Invariant property smplace_552 does not hold.
Invariant property smplace_551 does not hold.
Invariant property smplace_550 does not hold.
SDD proceeding with computation,854 properties remain. new max is 262144
SDD size :1.03748e+116 after 1.03748e+116
[2024-05-28 17:36:30] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:36:30] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/638 variables, 2/631 constraints. Problems are: Problem set: 92 solved, 160 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/638 variables, 0/631 constraints. Problems are: Problem set: 92 solved, 160 unsolved
At refinement iteration 14 (OVERLAPS) 85/723 variables, 37/668 constraints. Problems are: Problem set: 92 solved, 160 unsolved
[2024-05-28 17:36:45] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/723 variables, 1/669 constraints. Problems are: Problem set: 92 solved, 160 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/723 variables, 0/669 constraints. Problems are: Problem set: 92 solved, 160 unsolved
At refinement iteration 17 (OVERLAPS) 49/772 variables, 14/683 constraints. Problems are: Problem set: 92 solved, 160 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/772 variables, 6/689 constraints. Problems are: Problem set: 92 solved, 160 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/772 variables, 0/689 constraints. Problems are: Problem set: 92 solved, 160 unsolved
SMT process timed out in 150140ms, After SMT, problems are : Problem set: 92 solved, 160 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 160 out of 716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 909/909 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 716 transition count 854
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 661 transition count 854
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 110 place count 661 transition count 828
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 162 place count 635 transition count 828
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 173 place count 624 transition count 817
Iterating global reduction 2 with 11 rules applied. Total rules applied 184 place count 624 transition count 817
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 184 place count 624 transition count 806
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 206 place count 613 transition count 806
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 304 place count 564 transition count 757
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 15 places in 7 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 334 place count 549 transition count 766
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 336 place count 549 transition count 764
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 338 place count 547 transition count 764
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 339 place count 547 transition count 764
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 340 place count 547 transition count 763
Applied a total of 340 rules in 90 ms. Remains 547 /716 variables (removed 169) and now considering 763/909 (removed 146) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 547/716 places, 763/909 transitions.
RANDOM walk for 4000000 steps (1008 resets) in 79448 ms. (50 steps per ms) remains 142/160 properties
BEST_FIRST walk for 40004 steps (9 resets) in 275 ms. (144 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (8 resets) in 327 ms. (121 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (8 resets) in 300 ms. (132 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (10 resets) in 367 ms. (108 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (8 resets) in 283 ms. (140 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (9 resets) in 275 ms. (144 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 142/142 properties
SDD proceeding with computation,854 properties remain. new max is 524288
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (10 resets) in 317 ms. (125 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (9 resets) in 289 ms. (137 steps per ms) remains 142/142 properties
SDD size :1.03748e+116 after 1.03748e+116
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (9 resets) in 318 ms. (125 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 303 ms. (131 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (8 resets) in 277 ms. (143 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (9 resets) in 350 ms. (113 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (9 resets) in 278 ms. (143 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (9 resets) in 339 ms. (117 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (8 resets) in 286 ms. (139 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (9 resets) in 316 ms. (126 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (9 resets) in 298 ms. (133 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (9 resets) in 345 ms. (115 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (10 resets) in 337 ms. (118 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (10 resets) in 266 ms. (149 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (9 resets) in 302 ms. (132 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (8 resets) in 288 ms. (138 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40003 steps (8 resets) in 296 ms. (134 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40002 steps (8 resets) in 275 ms. (144 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 142/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 142/142 properties
// Phase 1: matrix 763 rows 547 cols
[2024-05-28 17:37:32] [INFO ] Computed 200 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 66/208 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 222/430 variables, 208/240 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 71/501 variables, 33/273 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (OVERLAPS) 2/503 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (OVERLAPS) 41/544 variables, 16/307 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 8/315 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 14 (OVERLAPS) 41/585 variables, 16/331 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/585 variables, 8/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/585 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 17 (OVERLAPS) 43/628 variables, 16/355 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/628 variables, 8/363 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/628 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 20 (OVERLAPS) 44/672 variables, 16/379 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/672 variables, 8/387 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/672 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 23 (OVERLAPS) 44/716 variables, 16/403 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/716 variables, 8/411 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/716 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 26 (OVERLAPS) 44/760 variables, 16/427 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/760 variables, 8/435 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/760 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 29 (OVERLAPS) 44/804 variables, 16/451 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/804 variables, 8/459 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/804 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 32 (OVERLAPS) 44/848 variables, 16/475 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/848 variables, 8/483 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/848 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 35 (OVERLAPS) 44/892 variables, 16/499 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/892 variables, 8/507 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/892 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 38 (OVERLAPS) 44/936 variables, 16/523 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/936 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/936 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 41 (OVERLAPS) 44/980 variables, 16/547 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/980 variables, 8/555 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/980 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 44 (OVERLAPS) 37/1017 variables, 16/571 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1017 variables, 8/579 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1017 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 47 (OVERLAPS) 22/1039 variables, 8/587 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1039 variables, 4/591 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1039 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 50 (OVERLAPS) 20/1059 variables, 8/599 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1059 variables, 4/603 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1059 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 53 (OVERLAPS) 21/1080 variables, 8/611 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1080 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1080 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 56 (OVERLAPS) 19/1099 variables, 8/623 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1099 variables, 4/627 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1099 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 59 (OVERLAPS) 21/1120 variables, 8/635 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1120 variables, 4/639 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1120 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 62 (OVERLAPS) 21/1141 variables, 8/647 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1141 variables, 4/651 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1141 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 65 (OVERLAPS) 22/1163 variables, 8/659 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1163 variables, 4/663 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1163 variables, 0/663 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 68 (OVERLAPS) 22/1185 variables, 8/671 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1185 variables, 4/675 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1185 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 71 (OVERLAPS) 22/1207 variables, 8/683 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1207 variables, 4/687 constraints. Problems are: Problem set: 0 solved, 142 unsolved
SDD proceeding with computation,854 properties remain. new max is 1048576
SDD size :1.03748e+116 after 1.03748e+116
At refinement iteration 73 (INCLUDED_ONLY) 0/1207 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 74 (OVERLAPS) 22/1229 variables, 8/695 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1229 variables, 4/699 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1229 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 77 (OVERLAPS) 22/1251 variables, 8/707 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1251 variables, 4/711 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1251 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 80 (OVERLAPS) 22/1273 variables, 8/719 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1273 variables, 4/723 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1273 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 83 (OVERLAPS) 20/1293 variables, 8/731 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1293 variables, 4/735 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1293 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 86 (OVERLAPS) 14/1307 variables, 6/741 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1307 variables, 3/744 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1307 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 89 (OVERLAPS) 3/1310 variables, 2/746 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1310 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1310/1310 variables, and 747 constraints, problems are : Problem set: 0 solved, 142 unsolved in 90009 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 547/547 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 66/208 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-28 17:39:03] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 1 ms to minimize.
[2024-05-28 17:39:03] [INFO ] Deduced a trap composed of 49 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:39:03] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:39:03] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:39:03] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:39:03] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:39:03] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-28 17:39:04] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-28 17:39:04] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-28 17:39:04] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:39:04] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-28 17:39:04] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 0 ms to minimize.
[2024-05-28 17:39:04] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-28 17:39:04] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:39:04] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-28 17:39:04] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:39:04] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2024-05-28 17:39:04] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-28 17:39:04] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 19/51 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-28 17:39:05] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-28 17:39:05] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:39:06] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 17:39:06] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 222/430 variables, 208/263 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/430 variables, 142/405 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-28 17:39:07] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-28 17:39:08] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 17:39:08] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 17:39:08] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:39:08] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 2 ms to minimize.
[2024-05-28 17:39:09] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/430 variables, 6/411 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-28 17:39:11] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 17:39:11] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-28 17:39:11] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-28 17:39:11] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 4/415 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-28 17:39:14] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (OVERLAPS) 71/501 variables, 33/449 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/501 variables, 14/463 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/501 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 15 (OVERLAPS) 2/503 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/503 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/503 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 18 (OVERLAPS) 41/544 variables, 16/483 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/544 variables, 8/491 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/544 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 21 (OVERLAPS) 41/585 variables, 16/507 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/585 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/585 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 24 (OVERLAPS) 43/628 variables, 16/531 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/628 variables, 8/539 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/628 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 27 (OVERLAPS) 44/672 variables, 16/555 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/672 variables, 8/563 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/672 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 30 (OVERLAPS) 44/716 variables, 16/579 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/716 variables, 8/587 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/716 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 33 (OVERLAPS) 44/760 variables, 16/603 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/760 variables, 8/611 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/760 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 36 (OVERLAPS) 44/804 variables, 16/627 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/804 variables, 8/635 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/804 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 39 (OVERLAPS) 44/848 variables, 16/651 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/848 variables, 8/659 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/848 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 42 (OVERLAPS) 44/892 variables, 16/675 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/892 variables, 8/683 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/892 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 45 (OVERLAPS) 44/936 variables, 16/699 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/936 variables, 8/707 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/936 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 48 (OVERLAPS) 44/980 variables, 16/723 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/980 variables, 8/731 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-28 17:40:22] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:40:22] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-28 17:40:22] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/980 variables, 3/734 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/980 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 52 (OVERLAPS) 37/1017 variables, 16/750 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1017 variables, 8/758 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 1)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 0)
(s25 1)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 1)
(s58 0)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 1)
(s66 0)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 1)
(s84 0)
(s85 1)
(s86 0)
(s87 1)
(s88 0)
(s89 1)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 1)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 1)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 1)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 1)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1017/1310 variables, and 758 constraints, problems are : Problem set: 0 solved, 142 unsolved in 90015 ms.
Refiners :[Positive P Invariants (semi-flows): 144/200 constraints, State Equation: 435/547 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 37/37 constraints]
After SMT, in 180048ms problems are : Problem set: 0 solved, 142 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 142 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 763/763 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 547 transition count 759
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 543 transition count 759
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 543 transition count 757
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 541 transition count 757
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 26 place count 534 transition count 750
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 533 transition count 750
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 533 transition count 748
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 531 transition count 748
Applied a total of 32 rules in 57 ms. Remains 531 /547 variables (removed 16) and now considering 748/763 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 531/547 places, 748/763 transitions.
RANDOM walk for 4000000 steps (1066 resets) in 76811 ms. (52 steps per ms) remains 105/142 properties
BEST_FIRST walk for 40002 steps (8 resets) in 279 ms. (142 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (8 resets) in 286 ms. (139 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 351 ms. (113 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (8 resets) in 334 ms. (119 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (9 resets) in 320 ms. (124 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (9 resets) in 300 ms. (132 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (9 resets) in 344 ms. (115 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40002 steps (8 resets) in 322 ms. (123 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (8 resets) in 302 ms. (132 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (9 resets) in 322 ms. (123 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (9 resets) in 300 ms. (132 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (10 resets) in 296 ms. (134 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (9 resets) in 294 ms. (135 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (8 resets) in 365 ms. (109 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 318 ms. (125 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 325 ms. (122 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (8 resets) in 327 ms. (121 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (8 resets) in 324 ms. (123 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (8 resets) in 319 ms. (125 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (8 resets) in 317 ms. (125 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (9 resets) in 320 ms. (124 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (10 resets) in 345 ms. (115 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40001 steps (9 resets) in 285 ms. (139 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (9 resets) in 350 ms. (113 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 338 ms. (118 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (8 resets) in 344 ms. (115 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40002 steps (8 resets) in 349 ms. (114 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (10 resets) in 353 ms. (113 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (8 resets) in 354 ms. (112 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40003 steps (8 resets) in 318 ms. (125 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 336 ms. (118 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 105/105 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 105/105 properties
// Phase 1: matrix 748 rows 531 cols
[2024-05-28 17:40:58] [INFO ] Computed 200 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 61/166 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (OVERLAPS) 177/343 variables, 166/190 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 67/410 variables, 32/222 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 10/232 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 6/416 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 3/239 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 38/454 variables, 19/258 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 7/265 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/454 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (OVERLAPS) 1/455 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/455 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/455 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 17 (OVERLAPS) 43/498 variables, 18/285 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/498 variables, 8/293 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/498 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 20 (OVERLAPS) 43/541 variables, 16/309 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/541 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/541 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 23 (OVERLAPS) 44/585 variables, 16/333 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/585 variables, 8/341 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/585 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 26 (OVERLAPS) 44/629 variables, 16/357 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/629 variables, 8/365 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/629 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 29 (OVERLAPS) 44/673 variables, 16/381 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/673 variables, 8/389 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/673 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 32 (OVERLAPS) 44/717 variables, 16/405 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/717 variables, 8/413 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/717 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 35 (OVERLAPS) 44/761 variables, 16/429 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/761 variables, 8/437 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/761 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 38 (OVERLAPS) 44/805 variables, 16/453 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/805 variables, 8/461 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/805 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 41 (OVERLAPS) 44/849 variables, 16/477 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/849 variables, 8/485 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/849 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 44 (OVERLAPS) 44/893 variables, 16/501 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/893 variables, 8/509 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/893 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 47 (OVERLAPS) 37/930 variables, 16/525 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/930 variables, 8/533 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/930 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 50 (OVERLAPS) 22/952 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/952 variables, 4/545 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/952 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 53 (OVERLAPS) 22/974 variables, 8/553 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/974 variables, 4/557 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/974 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 56 (OVERLAPS) 22/996 variables, 8/565 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/996 variables, 4/569 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/996 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 59 (OVERLAPS) 22/1018 variables, 8/577 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1018 variables, 4/581 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1018 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 62 (OVERLAPS) 19/1037 variables, 8/589 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1037 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1037 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 65 (OVERLAPS) 21/1058 variables, 8/601 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1058 variables, 4/605 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1058 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 68 (OVERLAPS) 19/1077 variables, 8/613 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1077 variables, 4/617 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1077 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 71 (OVERLAPS) 21/1098 variables, 8/625 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/1098 variables, 4/629 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1098 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 74 (OVERLAPS) 22/1120 variables, 8/637 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1120 variables, 4/641 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1120 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 77 (OVERLAPS) 22/1142 variables, 8/649 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1142 variables, 4/653 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1142 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 80 (OVERLAPS) 22/1164 variables, 8/661 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1164 variables, 4/665 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1164 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 83 (OVERLAPS) 22/1186 variables, 8/673 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1186 variables, 4/677 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1186 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 86 (OVERLAPS) 22/1208 variables, 8/685 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1208 variables, 4/689 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1208 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 89 (OVERLAPS) 22/1230 variables, 8/697 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1230 variables, 4/701 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1230 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 92 (OVERLAPS) 22/1252 variables, 8/709 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1252 variables, 4/713 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Detected timeout of ITS tools.
[2024-05-28 17:41:47] [INFO ] Flatten gal took : 98 ms
[2024-05-28 17:41:47] [INFO ] Applying decomposition
[2024-05-28 17:41:47] [INFO ] Flatten gal took : 93 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6540684124137115926.txt' '-o' '/tmp/graph6540684124137115926.bin' '-w' '/tmp/graph6540684124137115926.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6540684124137115926.bin' '-l' '-1' '-v' '-w' '/tmp/graph6540684124137115926.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:41:48] [INFO ] Decomposing Gal with order
[2024-05-28 17:41:48] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 94 (INCLUDED_ONLY) 0/1252 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 95 (OVERLAPS) 19/1271 variables, 8/721 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/1271 variables, 4/725 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 17:41:48] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-28 17:41:49] [INFO ] Flatten gal took : 239 ms
[2024-05-28 17:41:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 22 ms.
[2024-05-28 17:41:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10458184070261974219.gal : 41 ms
[2024-05-28 17:41:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14013539174686001543.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10458184070261974219.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14013539174686001543.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality14013539174686001543.prop.
SDD proceeding with computation,105 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,105 properties remain. new max is 8
SDD size :1 after 210
SDD proceeding with computation,105 properties remain. new max is 16
SDD size :210 after 4.00695e+11
SDD proceeding with computation,105 properties remain. new max is 32
SDD size :4.00695e+11 after 2.75452e+117
At refinement iteration 97 (INCLUDED_ONLY) 0/1271 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 98 (OVERLAPS) 8/1279 variables, 4/729 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/1279 variables, 2/731 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1279 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 101 (OVERLAPS) 0/1279 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1279/1279 variables, and 731 constraints, problems are : Problem set: 0 solved, 105 unsolved in 58470 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 531/531 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 61/166 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 17:41:57] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:41:57] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-28 17:41:57] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-28 17:41:57] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:41:57] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:41:58] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-28 17:41:58] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 177/343 variables, 166/197 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 105/302 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 17:41:59] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 17:41:59] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 67/410 variables, 32/336 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 10/346 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-05-28 17:42:01] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 12 (OVERLAPS) 6/416 variables, 4/351 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/416 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/416 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 15 (OVERLAPS) 38/454 variables, 19/373 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/454 variables, 7/380 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/454 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 18 (OVERLAPS) 1/455 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/455 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/455 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 21 (OVERLAPS) 43/498 variables, 18/400 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/498 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/498 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 24 (OVERLAPS) 43/541 variables, 16/424 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/541 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/541 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 27 (OVERLAPS) 44/585 variables, 16/448 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/585 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/585 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 30 (OVERLAPS) 44/629 variables, 16/472 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/629 variables, 8/480 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/629 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 33 (OVERLAPS) 44/673 variables, 16/496 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/673 variables, 8/504 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/673 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 36 (OVERLAPS) 44/717 variables, 16/520 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/717 variables, 8/528 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/717 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 39 (OVERLAPS) 44/761 variables, 16/544 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/761 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/761 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 42 (OVERLAPS) 44/805 variables, 16/568 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/805 variables, 8/576 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/805 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 45 (OVERLAPS) 44/849 variables, 16/592 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/849 variables, 8/600 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/849 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 48 (OVERLAPS) 44/893 variables, 16/616 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/893 variables, 8/624 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/893 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 51 (OVERLAPS) 37/930 variables, 16/640 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/930 variables, 8/648 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/930 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 54 (OVERLAPS) 22/952 variables, 8/656 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/952 variables, 4/660 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/952 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 57 (OVERLAPS) 22/974 variables, 8/668 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/974 variables, 4/672 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/974 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 60 (OVERLAPS) 22/996 variables, 8/680 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/996 variables, 4/684 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/996 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 63 (OVERLAPS) 22/1018 variables, 8/692 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1018 variables, 4/696 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1018 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 66 (OVERLAPS) 19/1037 variables, 8/704 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1037 variables, 4/708 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1037 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 69 (OVERLAPS) 21/1058 variables, 8/716 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/1058 variables, 4/720 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/1058 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 72 (OVERLAPS) 19/1077 variables, 8/728 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/1077 variables, 4/732 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/1077 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 75 (OVERLAPS) 21/1098 variables, 8/740 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1098 variables, 4/744 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1098 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 78 (OVERLAPS) 22/1120 variables, 8/752 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1120 variables, 4/756 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1120 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 81 (OVERLAPS) 22/1142 variables, 8/764 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1142 variables, 4/768 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1142 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 84 (OVERLAPS) 22/1164 variables, 8/776 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1164 variables, 4/780 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1164 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 87 (OVERLAPS) 22/1186 variables, 8/788 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1186 variables, 4/792 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1186 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 90 (OVERLAPS) 22/1208 variables, 8/800 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1208 variables, 4/804 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1208 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 93 (OVERLAPS) 22/1230 variables, 8/812 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1230 variables, 4/816 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/1230 variables, 0/816 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 96 (OVERLAPS) 22/1252 variables, 8/824 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/1252 variables, 4/828 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/1252 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 99 (OVERLAPS) 19/1271 variables, 8/836 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/1271 variables, 4/840 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/1271 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 102 (OVERLAPS) 8/1279 variables, 4/844 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/1279 variables, 2/846 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/1279 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 105 (OVERLAPS) 0/1279 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1279/1279 variables, and 846 constraints, problems are : Problem set: 0 solved, 105 unsolved in 90906 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 531/531 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 10/10 constraints]
After SMT, in 149407ms problems are : Problem set: 0 solved, 105 unsolved
Fused 105 Parikh solutions to 100 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 105 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 748/748 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 531 transition count 735
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 518 transition count 735
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 26 place count 518 transition count 729
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 38 place count 512 transition count 729
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 62 place count 500 transition count 717
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 497 transition count 718
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 497 transition count 717
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 497 transition count 716
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 496 transition count 716
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 496 transition count 716
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 496 transition count 715
Applied a total of 73 rules in 50 ms. Remains 496 /531 variables (removed 35) and now considering 715/748 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 496/531 places, 715/748 transitions.
RANDOM walk for 4000000 steps (1072 resets) in 67168 ms. (59 steps per ms) remains 98/105 properties
BEST_FIRST walk for 400004 steps (15 resets) in 2953 ms. (135 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (13 resets) in 3125 ms. (127 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (12 resets) in 3019 ms. (132 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (13 resets) in 3021 ms. (132 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (14 resets) in 3428 ms. (116 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (17 resets) in 3138 ms. (127 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (12 resets) in 3093 ms. (129 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (15 resets) in 3196 ms. (125 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (13 resets) in 3188 ms. (125 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (12 resets) in 3127 ms. (127 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (11 resets) in 3492 ms. (114 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (14 resets) in 3066 ms. (130 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (13 resets) in 2874 ms. (139 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (11 resets) in 3306 ms. (120 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (13 resets) in 3485 ms. (114 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (14 resets) in 3275 ms. (122 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (14 resets) in 3348 ms. (119 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (16 resets) in 2712 ms. (147 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (13 resets) in 2946 ms. (135 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (19 resets) in 3143 ms. (127 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (11 resets) in 3593 ms. (111 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (9 resets) in 3247 ms. (123 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (17 resets) in 3344 ms. (119 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (11 resets) in 3256 ms. (122 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (12 resets) in 3254 ms. (122 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (15 resets) in 3473 ms. (115 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (16 resets) in 3144 ms. (127 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (11 resets) in 3488 ms. (114 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (19 resets) in 3038 ms. (131 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (12 resets) in 3329 ms. (120 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (18 resets) in 3343 ms. (119 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (10 resets) in 3231 ms. (123 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (14 resets) in 2850 ms. (140 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (12 resets) in 2717 ms. (147 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (14 resets) in 3356 ms. (119 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (20 resets) in 3228 ms. (123 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (11 resets) in 3305 ms. (120 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (15 resets) in 3302 ms. (121 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (16 resets) in 2957 ms. (135 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (14 resets) in 3057 ms. (130 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (21 resets) in 3142 ms. (127 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (16 resets) in 2888 ms. (138 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (18 resets) in 2903 ms. (137 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (12 resets) in 3384 ms. (118 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (14 resets) in 3193 ms. (125 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (10 resets) in 3216 ms. (124 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (19 resets) in 2993 ms. (133 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (11 resets) in 3116 ms. (128 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (11 resets) in 3065 ms. (130 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400002 steps (19 resets) in 3196 ms. (125 steps per ms) remains 98/98 properties
Finished probabilistic random walk after 3543184 steps, run visited all 98 properties in 72215 ms. (steps per millisecond=49 )
Probabilistic random walk after 3543184 steps, saw 2132964 distinct states, run finished after 72220 ms. (steps per millisecond=49 ) properties seen :98
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 1503 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL
Total runtime 839266 ms.
BK_STOP 1716918344612
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="ShieldRVt-PT-050B"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 itstools"
echo " Input is ShieldRVt-PT-050B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r365-tall-171683779800648"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-050B.tgz
mv ShieldRVt-PT-050B execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;