fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r013-smll-171620124300043
Last Updated
July 7, 2024

About the Execution of ITS-Tools for ASLink-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7012.491 1463809.00 3465571.00 2941.80 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.r013-smll-171620124300043.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 ASLink-PT-04b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-smll-171620124300043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 669K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716211365270

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-20 13:22:47] [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-20 13:22:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 13:22:47] [INFO ] Load time of PNML (sax parser for PT used): 414 ms
[2024-05-20 13:22:47] [INFO ] Transformed 2034 places.
[2024-05-20 13:22:47] [INFO ] Transformed 2567 transitions.
[2024-05-20 13:22:47] [INFO ] Found NUPN structural information;
[2024-05-20 13:22:47] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 747 ms.
Structural test allowed to assert that 246 places are NOT stable. Took 39 ms.
[2024-05-20 13:22:49] [INFO ] Flatten gal took : 762 ms
[2024-05-20 13:22:50] [INFO ] Flatten gal took : 288 ms
[2024-05-20 13:22:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18077719347438378420.gal : 149 ms
[2024-05-20 13:22:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9444358614265687237.prop : 23 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/ReachabilityCardinality18077719347438378420.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9444358614265687237.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 ...329
RANDOM walk for 40000 steps (92 resets) in 7099 ms. (5 steps per ms) remains 359/1788 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 359/359 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 359/359 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 359/359 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 359/359 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 359/359 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 359/359 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 359/359 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 359/359 properties
BEST_FIRST walk for 403 steps (8 resets) in 31 ms. (12 steps per ms) remains 359/359 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 359/359 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 359/359 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 359/359 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 359/359 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 359/359 properties
BEST_FIRST walk for 401 steps (8 resets) in 6 ms. (57 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 359/359 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 359/359 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 359/359 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 359/359 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 359/359 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 359/359 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 359/359 properties
Loading property file /tmp/ReachabilityCardinality9444358614265687237.prop.
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 359/359 properties
// Phase 1: matrix 2567 rows 2034 cols
[2024-05-20 13:22:51] [INFO ] Computed 199 invariants in 169 ms
Error getting values : (error "ParserException while parsing response: ((s8 (/ 1.0 2.0))
(s9 (/ 1.0 2.0))
(s10 (/ 1.0 2.0))
(s11 (/ 1.0 2.0))
(s12 (/ 1.0 2.0))
(s13 (/ 1.0 2.0))
(s14 (/ 1.0 2.0))
(s15 (/ 1.0 2.0))
(s16 (/ 1.0 2.0))
(s17 (/ 1.0 2.0))
(s18 (/ 1.0 2.0))
(s19 (/ 1.0 2.0))
(s20 (/ 1.0 2.0))
(s21 (/ 1.0 2.0))
(s22 (/ 1.0 2.0))
(s23 (/ 1.0 2.0))
(s24 (/ 1.0 2.0))
(s25 (/ 1.0 2.0))
(s26 (/ 1.0 2.0))
(s27 (/ 1.0 2.0))
(s28 (/ 1.0 2.0))
(s29 (/ 1.0 2.0))
(s30 (/ 1.0 2.0))
(s31 (/ 1.0 2.0))
(s32 (/ 1.0 2.0))
(s33 (/ 1.0 2.0))
(s34 (/ 1.0 2.0))
(s35 (/ 1.0 2.0))
(s36 (/ 1.0 2.0))
(s37 (/ 1.0 2.0))
(s38 (/ 1.0 2.0))
(s39 (/ 1.0 2.0))
(s40 (/ 1.0 2.0))
(s41 (/ 1.0 2.0))
(s42 (/ 1.0 2.0))
(s46 (/ 1.0 2.0))
(s47 (/ 1.0 2.0))
(s48 (/ 1.0 2.0))
(s49 (/ 1.0 2.0))
(s50 (/ 1.0 2.0))
(s51 (/ 1.0 2.0))
(s55 (/ 1.0 2.0))
(s56 (/ 1.0 2.0))
(s57 (/ 1.0 2.0))
(s58 (/ 1.0 2.0))
(s59 (/ 1.0 2.0))
(s60 (/ 1.0 2.0))
(s61 (/ 1.0 2.0))
(s62 (/ 1.0 2.0))
(s63 (/ 1.0 2.0))
(s64 (/ 1.0 2.0))
(s65 (/ 1.0 2.0))
(s66 (/ 1.0 2.0))
(s67 (/ 1.0 2.0))
(s68 (/ 1.0 2.0))
(s69 (/ 1.0 2.0))
(s70 (/ 1.0 2.0))
(s71 (/ 1.0 2.0))
(s72 (/ 1.0 2.0))
(s73 (/ 1.0 2.0))
(s74 (/ 1.0 2.0))
(s75 (/ 1.0 2.0))
(s76 (/ 1.0 2.0))
(s77 (/ 1.0 2.0))
(s78 (/ 1.0 2.0))
(s79 (/ 1.0 2.0))
(s89 (/ 1.0 2.0))
(s90 (/ 1.0 2.0))
(s91 (/ 1.0 2.0))
(s158 (/ 1.0 2.0))
(s159 (/ 1.0 2.0))
(s160 (/ 1.0 2.0))
(s161 (/ 1.0 2.0))
(s162 (/ 1.0 2.0))
(s163 (/ 1.0 2.0))
(s164 (/ 1.0 2.0))
(s165 (/ 1.0 2.0))
(s166 (/ 1.0 2.0))
(s167 (/ 1.0 2.0))
(s168 (/ 1.0 2.0))
(s169 (/ 1.0 2.0))
(s170 (/ 1.0 2.0))
(s171 (/ 1.0 2.0))
(s172 (/ 1.0 2.0))
(s173 (/ 1.0 2.0))
(s174 (/ 1.0 2.0))
(s175 (/ 1.0 2.0))
(s176 (/ 1.0 2.0))
(s177 (/ 1.0 2.0))
(s178 (/ 1.0 2.0))
(s179 (/ 1.0 2.0))
(s180 (/ 1.0 2.0))
(s181 (/ 1.0 2.0))
(s182 (/ 1.0 2.0))
(s183 (/ 1.0 2.0))
(s184 (/ 1.0 2.0))
(s186 (/ 1.0 2.0))
(s187 (/ 1.0 2.0))
(s200 (/ 1.0 2.0))
(s201 (/ 1.0 2.0))
(s202 (/ 1.0 2.0))
(s203 (/ 1.0 2.0))
(s204 (/ 1.0 2.0))
(s205 (/ 1.0 2.0))
(s206 (/ 1.0 2.0))
(s207 (/ 1.0 2.0))
(s208 (/ 1.0 2.0))
(s209 (/ 1.0 2.0))
(s210 (/ 1.0 2.0))
(s211 (/ 1.0 2.0))
(s212 (/ 1.0 2.0))
(s213 (/ 1.0 2.0))
(s214 (/ 1.0 2.0))
(s215 (/ 1.0 2.0))
(s216 (/ 1.0 2.0))
(s217 (/ 1.0 2.0))
(s218 (/ 1.0 2.0))
(s219 (/ 1.0 2.0))
(s220 (/ 1.0 2.0))
(s221 (/ 1.0 2.0))
(s235 (/ 1.0 2.0))
(s236 (/ 1.0 2.0))
(s237 (/ 1.0 2.0))
(s238 (/ 1.0 2.0))
(s239 (/ 1.0 2.0))
(s240 (/ 1.0 2.0))
(s241 (/ 1.0 2.0))
(s242 (/ 1.0 2.0))
(s243 (/ 1.0 2.0))
(s244 (/ 1.0 2.0))
(s245 (/ 1.0 2.0))
(s246 (/ 1.0 2.0))
(s247 (/ 1.0 2.0))
(s248 (/ 1.0 2.0))
(s249 (/ 1.0 2.0))
(s250 (/ 1.0 2.0))
(s251 (/ 1.0 2.0))
(s252 (/ 1.0 2.0))
(s253 (/ 1.0 2.0))
(s254 (/ 1.0 2.0))
(s255 (/ 1.0 2.0))
(s256 (/ 1.0 2.0))
(s257 (/ 1.0 2.0))
(s258 (/ 1.0 2.0))
(s259 (/ 1.0 2.0))
(s260 (/ 1.0 2.0))
(s261 (/ 1.0 2.0))
(s262 (/ 1.0 2.0))
(s263 (/ 1.0 2.0))
(s264 (/ 1.0 2.0))
(s265 (/ 1.0 2.0))
(s266 (/ 1.0 2.0))
(s267 (/ 1.0 2.0))
(s268 (/ 1.0 2.0))
(s269 (/ 1.0 2.0))
(s275 (/ 1.0 2.0))
(s276 (/ 1.0 2.0))
(s277 (/ 1.0 2.0))
(s278 (/ 1.0 2.0))
(s279 (/ 1.0 2.0))
(s280 (/ 1.0 2.0))
(s281 (/ 1.0 2.0))
(s282 (/ 1.0 2.0))
(s283 (/ 1.0 2.0))
(s284 (/ 1.0 2.0))
(s285 (/ 1.0 2.0))
(s286 (/ 1.0 2.0))
(s318 (/ 1.0 2.0))
(s319 (/ 1.0 2.0))
(s320 (/ 1.0 2.0))
(s355 (/ 1.0 2.0))
(s356 (/ 1.0 2.0))
(s357 (/ 1.0 2.0))
(s404 (/ 1.0 2.0))
(s405 (/ 1.0 2.0))
(s406 (/ 1.0 2.0))
(s407 (/ 1.0 2.0))
(s408 (/ 1.0 2.0))
(s409 (/ 1.0 2.0))
(s410 (/ 1.0 2.0))
(s411 (/ 1.0 2.0))
(s412 (/ 1.0 2.0))
(s414 (/ 1.0 2.0))
(s415 (/ 1.0 2.0))
(s416 (/ 1.0 2.0))
(s417 (/ 1.0 2.0))
(s418 (/ 1.0 2.0))
(s419 (/ 1.0 2.0))
(s420 (/ 1.0 2.0))
(s421 (/ 1.0 2.0))
(s422 (/ 1.0 2.0))
(s423 (/ 1.0 2.0))
(s424 (/ 1.0 2.0))
(s425 (/ 1.0 2.0))
(s427 (/ 1.0 2.0))
(s428 (/ 1.0 2.0))
(s429 (/ 1.0 2.0))
(s430 (/ 1.0 2.0))
(s431 (/ 1.0 2.0))
(s432 (/ 1.0 2.0))
(s446 (/ 1.0 2.0))
(s447 (/ 1.0 2.0))
(s448 (/ 1.0 2.0))
(s455 (/ 1.0 2.0))
(s456 (/ 1.0 2.0))
(s457 (/ 1.0 2.0))
(s458 (/ 1.0 2.0))
(s459 (/ 1.0 2.0))
(s460 (/ 1.0 2.0))
(s461 (/ 1.0 2.0))
(s462 (/ 1.0 2.0))
(s463 (/ 1.0 2.0))
(s581 (/ 1.0 2.0))
(s582 (/ 1.0 2.0))
(s598 (/ 1.0 2.0))
(s599 (/ 1.0 2.0))
(s600 (/ 1.0 2.0))
(s601 (/ 1.0 2.0))
(s602 (/ 1.0 2.0))
(s608 (/ 1.0 2.0))
(s609 (/ 1.0 2.0))
(s610 (/ 1.0 2.0))
(s611 (/ 1.0 2.0))
(s612 (/ 1.0 2.0))
(s630 (/ 1.0 2.0))
(s631 (/ 1.0 2.0))
(s632 (/ 1.0 2.0))
(s633 (/ 1.0 2.0))
(s634 (/ 1.0 2.0))
(s635 (/ 1.0 2.0))
(s636 (/ 1.0 2.0))
(s637 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 359/359 constraints. Problems are: Problem set: 0 solved, 359 unsolved
SMT process timed out in 5608ms, After SMT, problems are : Problem set: 0 solved, 359 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 359 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 381 transitions
Trivial Post-agglo rules discarded 381 transitions
Performed 381 trivial Post agglomeration. Transition count delta: 381
Iterating post reduction 0 with 381 rules applied. Total rules applied 381 place count 2034 transition count 2186
Reduce places removed 381 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 403 rules applied. Total rules applied 784 place count 1653 transition count 2164
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 790 place count 1647 transition count 2164
Performed 386 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 386 Pre rules applied. Total rules applied 790 place count 1647 transition count 1778
Deduced a syphon composed of 386 places in 7 ms
Ensure Unique test removed 35 places
Reduce places removed 421 places and 0 transitions.
Iterating global reduction 3 with 807 rules applied. Total rules applied 1597 place count 1226 transition count 1778
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 3 with 26 rules applied. Total rules applied 1623 place count 1223 transition count 1755
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 1646 place count 1200 transition count 1755
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1646 place count 1200 transition count 1742
Deduced a syphon composed of 13 places in 13 ms
Ensure Unique test removed 13 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 39 rules applied. Total rules applied 1685 place count 1174 transition count 1742
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 1685 place count 1174 transition count 1729
Deduced a syphon composed of 13 places in 12 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 1711 place count 1161 transition count 1729
Discarding 51 places :
Symmetric choice reduction at 5 with 51 rule applications. Total rules 1762 place count 1110 transition count 1678
Iterating global reduction 5 with 51 rules applied. Total rules applied 1813 place count 1110 transition count 1678
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1814 place count 1110 transition count 1677
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 16 Pre rules applied. Total rules applied 1814 place count 1110 transition count 1661
Deduced a syphon composed of 16 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 33 rules applied. Total rules applied 1847 place count 1093 transition count 1661
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1847 place count 1093 transition count 1660
Deduced a syphon composed of 1 places in 12 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1850 place count 1091 transition count 1660
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 1854 place count 1087 transition count 1633
Iterating global reduction 6 with 4 rules applied. Total rules applied 1858 place count 1087 transition count 1633
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 1858 place count 1087 transition count 1631
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1862 place count 1085 transition count 1631
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1863 place count 1084 transition count 1623
Iterating global reduction 6 with 1 rules applied. Total rules applied 1864 place count 1084 transition count 1623
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1865 place count 1083 transition count 1615
Iterating global reduction 6 with 1 rules applied. Total rules applied 1866 place count 1083 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1867 place count 1082 transition count 1607
Iterating global reduction 6 with 1 rules applied. Total rules applied 1868 place count 1082 transition count 1607
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1869 place count 1081 transition count 1599
Iterating global reduction 6 with 1 rules applied. Total rules applied 1870 place count 1081 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1871 place count 1080 transition count 1591
Iterating global reduction 6 with 1 rules applied. Total rules applied 1872 place count 1080 transition count 1591
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1873 place count 1079 transition count 1583
Iterating global reduction 6 with 1 rules applied. Total rules applied 1874 place count 1079 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1875 place count 1078 transition count 1575
Iterating global reduction 6 with 1 rules applied. Total rules applied 1876 place count 1078 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1877 place count 1077 transition count 1567
Iterating global reduction 6 with 1 rules applied. Total rules applied 1878 place count 1077 transition count 1567
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1879 place count 1076 transition count 1559
Iterating global reduction 6 with 1 rules applied. Total rules applied 1880 place count 1076 transition count 1559
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1881 place count 1075 transition count 1551
Iterating global reduction 6 with 1 rules applied. Total rules applied 1882 place count 1075 transition count 1551
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1883 place count 1074 transition count 1543
Iterating global reduction 6 with 1 rules applied. Total rules applied 1884 place count 1074 transition count 1543
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1885 place count 1073 transition count 1535
Iterating global reduction 6 with 1 rules applied. Total rules applied 1886 place count 1073 transition count 1535
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1887 place count 1072 transition count 1527
Iterating global reduction 6 with 1 rules applied. Total rules applied 1888 place count 1072 transition count 1527
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1889 place count 1071 transition count 1519
Iterating global reduction 6 with 1 rules applied. Total rules applied 1890 place count 1071 transition count 1519
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1891 place count 1070 transition count 1511
Iterating global reduction 6 with 1 rules applied. Total rules applied 1892 place count 1070 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1893 place count 1069 transition count 1503
Iterating global reduction 6 with 1 rules applied. Total rules applied 1894 place count 1069 transition count 1503
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 4 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 6 with 196 rules applied. Total rules applied 2090 place count 971 transition count 1405
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2092 place count 970 transition count 1414
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 2098 place count 970 transition count 1408
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2104 place count 964 transition count 1408
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2106 place count 964 transition count 1406
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2108 place count 962 transition count 1406
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2109 place count 962 transition count 1406
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 2110 place count 962 transition count 1406
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2111 place count 961 transition count 1405
Reduce places removed 5 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 7 rules applied. Total rules applied 2118 place count 956 transition count 1403
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 2120 place count 954 transition count 1403
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 8 Pre rules applied. Total rules applied 2120 place count 954 transition count 1395
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 16 rules applied. Total rules applied 2136 place count 946 transition count 1395
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 10 with 2 rules applied. Total rules applied 2138 place count 944 transition count 1395
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 2148 place count 939 transition count 1390
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 2150 place count 937 transition count 1388
Iterating global reduction 11 with 2 rules applied. Total rules applied 2152 place count 937 transition count 1388
SDD proceeding with computation,1788 properties remain. new max is 4
SDD size :1 after 5
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2154 place count 937 transition count 1386
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 2156 place count 935 transition count 1386
Applied a total of 2156 rules in 1996 ms. Remains 935 /2034 variables (removed 1099) and now considering 1386/2567 (removed 1181) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2013 ms. Remains : 935/2034 places, 1386/2567 transitions.
SDD proceeding with computation,1788 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1788 properties remain. new max is 16
SDD size :10 after 16
SDD proceeding with computation,1788 properties remain. new max is 32
SDD size :16 after 49
SDD proceeding with computation,1788 properties remain. new max is 64
SDD size :49 after 196
SDD proceeding with computation,1788 properties remain. new max is 128
SDD size :196 after 416
SDD proceeding with computation,1788 properties remain. new max is 256
SDD size :416 after 569
Invariant property smplace_472 does not hold.
Invariant property smplace_471 does not hold.
Invariant property smplace_470 does not hold.
Invariant property smplace_312 does not hold.
Invariant property smplace_311 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_307 does not hold.
Invariant property smplace_306 does not hold.
Invariant property smplace_305 does not hold.
Invariant property smplace_304 does not hold.
Invariant property smplace_303 does not hold.
Invariant property smplace_302 does not hold.
Invariant property smplace_301 does not hold.
Invariant property smplace_300 does not hold.
Invariant property smplace_299 does not hold.
Invariant property smplace_298 does not hold.
Invariant property smplace_297 does not hold.
Invariant property smplace_296 does not hold.
SDD proceeding with computation,1768 properties remain. new max is 256
SDD size :569 after 15361
Invariant property smplace_444 does not hold.
Invariant property smplace_370 does not hold.
Invariant property smplace_364 does not hold.
Invariant property smplace_363 does not hold.
Invariant property smplace_336 does not hold.
Invariant property smplace_330 does not hold.
Invariant property smplace_329 does not hold.
Invariant property smplace_293 does not hold.
Invariant property smplace_292 does not hold.
Invariant property smplace_232 does not hold.
Invariant property smplace_231 does not hold.
SDD proceeding with computation,1757 properties remain. new max is 256
SDD size :15361 after 37196
Invariant property smplace_380 does not hold.
Invariant property smplace_371 does not hold.
Invariant property smplace_349 does not hold.
Invariant property smplace_348 does not hold.
Invariant property smplace_347 does not hold.
Invariant property smplace_346 does not hold.
Invariant property smplace_345 does not hold.
Invariant property smplace_344 does not hold.
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_335 does not hold.
Invariant property smplace_334 does not hold.
Invariant property smplace_333 does not hold.
SDD proceeding with computation,1739 properties remain. new max is 256
SDD size :37196 after 618139
Invariant property smplace_451 does not hold.
Invariant property smplace_450 does not hold.
Invariant property smplace_396 does not hold.
Invariant property smplace_383 does not hold.
Invariant property smplace_382 does not hold.
Invariant property smplace_381 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_375 does not hold.
Invariant property smplace_374 does not hold.
Invariant property smplace_373 does not hold.
Invariant property smplace_372 does not hold.
Invariant property smplace_369 does not hold.
Invariant property smplace_368 does not hold.
Invariant property smplace_367 does not hold.
RANDOM walk for 3648667 steps (48218 resets) in 120010 ms. (30 steps per ms) remains 276/359 properties
BEST_FIRST walk for 40003 steps (121 resets) in 335 ms. (119 steps per ms) remains 276/276 properties
SDD proceeding with computation,1722 properties remain. new max is 256
SDD size :618139 after 895449
BEST_FIRST walk for 40004 steps (116 resets) in 444 ms. (89 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40003 steps (114 resets) in 434 ms. (91 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40003 steps (116 resets) in 451 ms. (88 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (113 resets) in 460 ms. (86 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (123 resets) in 346 ms. (115 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (122 resets) in 420 ms. (95 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40003 steps (119 resets) in 398 ms. (100 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (118 resets) in 423 ms. (94 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (120 resets) in 415 ms. (96 steps per ms) remains 276/276 properties
Invariant property smplace_395 does not hold.
BEST_FIRST walk for 40004 steps (112 resets) in 414 ms. (96 steps per ms) remains 276/276 properties
Invariant property smplace_390 does not hold.
Invariant property smplace_388 does not hold.
Invariant property smplace_386 does not hold.
BEST_FIRST walk for 40003 steps (118 resets) in 358 ms. (111 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40003 steps (126 resets) in 331 ms. (120 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40003 steps (118 resets) in 422 ms. (94 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40003 steps (117 resets) in 440 ms. (90 steps per ms) remains 276/276 properties
SDD proceeding with computation,1718 properties remain. new max is 256
SDD size :895449 after 902929
BEST_FIRST walk for 40004 steps (117 resets) in 333 ms. (119 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40002 steps (117 resets) in 392 ms. (101 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40003 steps (114 resets) in 418 ms. (95 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40003 steps (119 resets) in 361 ms. (110 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (124 resets) in 447 ms. (89 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (114 resets) in 371 ms. (107 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (115 resets) in 353 ms. (113 steps per ms) remains 276/276 properties
Invariant property smplace_812 does not hold.
BEST_FIRST walk for 40003 steps (125 resets) in 410 ms. (97 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (119 resets) in 424 ms. (94 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (121 resets) in 376 ms. (106 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (122 resets) in 393 ms. (101 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40001 steps (116 resets) in 409 ms. (97 steps per ms) remains 276/276 properties
Invariant property smplace_449 does not hold.
Invariant property smplace_443 does not hold.
Invariant property smplace_442 does not hold.
BEST_FIRST walk for 40004 steps (122 resets) in 476 ms. (83 steps per ms) remains 276/276 properties
Invariant property smplace_394 does not hold.
Invariant property smplace_393 does not hold.
Invariant property smplace_392 does not hold.
BEST_FIRST walk for 40004 steps (116 resets) in 418 ms. (95 steps per ms) remains 276/276 properties
Invariant property smplace_391 does not hold.
Invariant property smplace_389 does not hold.
Invariant property smplace_387 does not hold.
Invariant property smplace_385 does not hold.
BEST_FIRST walk for 40004 steps (121 resets) in 421 ms. (94 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40002 steps (112 resets) in 357 ms. (111 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (122 resets) in 392 ms. (101 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40003 steps (120 resets) in 402 ms. (99 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (120 resets) in 431 ms. (92 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40002 steps (119 resets) in 411 ms. (97 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40001 steps (117 resets) in 408 ms. (97 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40001 steps (119 resets) in 425 ms. (93 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (122 resets) in 348 ms. (114 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40003 steps (113 resets) in 381 ms. (104 steps per ms) remains 276/276 properties
SDD proceeding with computation,1707 properties remain. new max is 256
SDD size :902929 after 1.72565e+07
BEST_FIRST walk for 40003 steps (116 resets) in 414 ms. (96 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40002 steps (120 resets) in 424 ms. (94 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40003 steps (116 resets) in 434 ms. (91 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40003 steps (114 resets) in 356 ms. (112 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (116 resets) in 382 ms. (104 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40003 steps (123 resets) in 397 ms. (100 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (118 resets) in 407 ms. (98 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (116 resets) in 422 ms. (94 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (116 resets) in 412 ms. (96 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40002 steps (121 resets) in 413 ms. (96 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40003 steps (119 resets) in 407 ms. (98 steps per ms) remains 276/276 properties
// Phase 1: matrix 1386 rows 935 cols
[2024-05-20 13:23:36] [INFO ] Computed 139 invariants in 40 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SDD proceeding with computation,1707 properties remain. new max is 512
SDD size :1.72565e+07 after 1.27294e+08
Invariant property smplace_867 does not hold.
Invariant property smplace_866 does not hold.
Invariant property smplace_865 does not hold.
Invariant property smplace_839 does not hold.
Invariant property smplace_817 does not hold.
Invariant property smplace_813 does not hold.
Invariant property smplace_759 does not hold.
Invariant property smplace_758 does not hold.
Invariant property smplace_731 does not hold.
Invariant property smplace_725 does not hold.
Invariant property smplace_724 does not hold.
Invariant property smplace_707 does not hold.
Invariant property smplace_706 does not hold.
Invariant property smplace_705 does not hold.
Invariant property smplace_704 does not hold.
Invariant property smplace_703 does not hold.
Invariant property smplace_702 does not hold.
Invariant property smplace_701 does not hold.
Invariant property smplace_700 does not hold.
Invariant property smplace_699 does not hold.
Invariant property smplace_698 does not hold.
Invariant property smplace_697 does not hold.
Invariant property smplace_696 does not hold.
Invariant property smplace_695 does not hold.
Invariant property smplace_694 does not hold.
Invariant property smplace_693 does not hold.
Invariant property smplace_692 does not hold.
Invariant property smplace_691 does not hold.
Invariant property smplace_688 does not hold.
Invariant property smplace_687 does not hold.
Invariant property smplace_627 does not hold.
Invariant property smplace_626 does not hold.
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 41/317 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SDD proceeding with computation,1675 properties remain. new max is 512
SDD size :1.27294e+08 after 2.65704e+10
Invariant property smplace_855 does not hold.
Invariant property smplace_854 does not hold.
Invariant property smplace_853 does not hold.
Invariant property smplace_827 does not hold.
Invariant property smplace_820 does not hold.
Invariant property smplace_819 does not hold.
Invariant property smplace_816 does not hold.
Invariant property smplace_815 does not hold.
Invariant property smplace_814 does not hold.
Invariant property smplace_775 does not hold.
Invariant property smplace_766 does not hold.
Invariant property smplace_765 does not hold.
Invariant property smplace_744 does not hold.
Invariant property smplace_743 does not hold.
Invariant property smplace_742 does not hold.
Invariant property smplace_741 does not hold.
Invariant property smplace_740 does not hold.
Invariant property smplace_739 does not hold.
Invariant property smplace_738 does not hold.
Invariant property smplace_737 does not hold.
Invariant property smplace_736 does not hold.
Invariant property smplace_735 does not hold.
Invariant property smplace_734 does not hold.
Invariant property smplace_733 does not hold.
Invariant property smplace_732 does not hold.
Invariant property smplace_730 does not hold.
Invariant property smplace_729 does not hold.
Invariant property smplace_728 does not hold.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 3/320 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 265/585 variables, 41/64 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SDD proceeding with computation,1647 properties remain. new max is 512
SDD size :2.65704e+10 after 3.88761e+11
SDD proceeding with computation,1647 properties remain. new max is 1024
SDD size :3.88761e+11 after 3.89056e+11
Invariant property smplace_846 does not hold.
Invariant property smplace_845 does not hold.
Invariant property smplace_791 does not hold.
Invariant property smplace_778 does not hold.
Invariant property smplace_777 does not hold.
Invariant property smplace_776 does not hold.
Invariant property smplace_774 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_767 does not hold.
Invariant property smplace_764 does not hold.
Invariant property smplace_763 does not hold.
Invariant property smplace_762 does not hold.
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 42/627 variables, 12/76 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SDD proceeding with computation,1630 properties remain. new max is 1024
SDD size :3.89056e+11 after 5.79187e+11
SDD proceeding with computation,1630 properties remain. new max is 2048
SDD size :5.79187e+11 after 5.80686e+11
Invariant property smplace_1262 does not hold.
Invariant property smplace_1261 does not hold.
Invariant property smplace_1260 does not hold.
Invariant property smplace_1250 does not hold.
Invariant property smplace_1249 does not hold.
Invariant property smplace_1248 does not hold.
Invariant property smplace_1234 does not hold.
At refinement iteration 10 (INCLUDED_ONLY) 0/627 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Invariant property smplace_1222 does not hold.
Invariant property smplace_1215 does not hold.
Invariant property smplace_1214 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_1208 does not hold.
Invariant property smplace_1207 does not hold.
At refinement iteration 11 (OVERLAPS) 1/628 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Invariant property smplace_1160 does not hold.
Invariant property smplace_1154 does not hold.
Invariant property smplace_1153 does not hold.
Invariant property smplace_1126 does not hold.
Invariant property smplace_1120 does not hold.
Invariant property smplace_1119 does not hold.
Invariant property smplace_1102 does not hold.
Invariant property smplace_1101 does not hold.
Invariant property smplace_1100 does not hold.
Invariant property smplace_1099 does not hold.
Invariant property smplace_1098 does not hold.
Invariant property smplace_1097 does not hold.
Invariant property smplace_1096 does not hold.
Invariant property smplace_1095 does not hold.
Invariant property smplace_1094 does not hold.
Invariant property smplace_1093 does not hold.
Invariant property smplace_1092 does not hold.
Invariant property smplace_1091 does not hold.
Invariant property smplace_1090 does not hold.
Invariant property smplace_1089 does not hold.
Invariant property smplace_1088 does not hold.
Invariant property smplace_1087 does not hold.
Invariant property smplace_1086 does not hold.
Invariant property smplace_1083 does not hold.
Invariant property smplace_1082 does not hold.
Invariant property smplace_1022 does not hold.
Invariant property smplace_1021 does not hold.
Invariant property smplace_844 does not hold.
Invariant property smplace_838 does not hold.
Invariant property smplace_837 does not hold.
At refinement iteration 12 (INCLUDED_ONLY) 0/628 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 13 (OVERLAPS) 178/806 variables, 30/107 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Invariant property smplace_826 does not hold.
Invariant property smplace_825 does not hold.
Invariant property smplace_790 does not hold.
Invariant property smplace_789 does not hold.
Invariant property smplace_788 does not hold.
Invariant property smplace_787 does not hold.
Invariant property smplace_786 does not hold.
Invariant property smplace_785 does not hold.
Invariant property smplace_784 does not hold.
Invariant property smplace_783 does not hold.
Invariant property smplace_782 does not hold.
Invariant property smplace_781 does not hold.
Invariant property smplace_780 does not hold.
At refinement iteration 14 (INCLUDED_ONLY) 0/806 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 15 (OVERLAPS) 54/860 variables, 4/111 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/860 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 17 (OVERLAPS) 2/862 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 1.0 140.0))
(s1 (/ 1.0 140.0))
(s2 (/ 13.0 140.0))
(s3 (/ 1.0 140.0))
(s4 (/ 1.0 140.0))
(s5 (/ 1.0 140.0))
(s6 (/ 1.0 140.0))
(s7 (/ 47.0 70.0))
(s8 (/ 1.0 140.0))
(s9 (/ 1.0 140.0))
(s10 (/ 1.0 140.0))
(s11 (/ 1.0 140.0))
(s12 (/ 1.0 140.0))
(s13 (/ 1.0 140.0))
(s14 (/ 1.0 140.0))
(s15 (/ 1.0 140.0))
(s16 (/ 1.0 140.0))
(s17 (/ 1.0 140.0))
(s18 (/ 1.0 140.0))
(s19 (/ 1.0 140.0))
(s20 (/ 1.0 140.0))
(s21 (/ 1.0 140.0))
(s22 (/ 1.0 140.0))
(s23 (/ 1.0 140.0))
(s24 (/ 1.0 140.0))
(s25 (/ 1.0 140.0))
(s26 (/ 1.0 140.0))
(s27 (/ 1.0 140.0))
(s28 (/ 1.0 140.0))
(s29 (/ 1.0 140.0))
(s30 (/ 1.0 140.0))
(s31 (/ 1.0 140.0))
(s32 (/ 1.0 140.0))
(s33 (/ 1.0 140.0))
(s34 (/ 1.0 140.0))
(s35 0.0)
(s36 (/ 1.0 140.0))
(s37 (/ 3.0 140.0))
(s38 (/ 1.0 140.0))
(s39 (/ 1.0 140.0))
(s40 (/ 1.0 140.0))
(s41 (/ 3.0 70.0))
(s42 (/ 127.0 140.0))
(s43 0.0)
(s44 (/ 1.0 140.0))
(s45 (/ 1.0 140.0))
(s46 (/ 1.0 140.0))
(s47 (/ 1.0 140.0))
(s48 (/ 1.0 140.0))
(s49 (/ 1.0 140.0))
(s50 (/ 1.0 140.0))
(s51 (/ 9.0 140.0))
(s52 (/ 27.0 35.0))
(s53 (/ 1.0 140.0))
(s54 (/ 1.0 140.0))
(s55 (/ 1.0 140.0))
(s56 (/ 1.0 140.0))
(s57 (/ 1.0 140.0))
(s58 (/ 1.0 140.0))
(s59 (/ 1.0 140.0))
(s60 (/ 1.0 140.0))
(s61 (/ 1.0 140.0))
(s62 (/ 1.0 140.0))
(s63 (/ 1.0 140.0))
(s64 (/ 1.0 140.0))
(s65 (/ 1.0 140.0))
(s66 (/ 1.0 140.0))
(s67 (/ 1.0 140.0))
(s68 (/ 1.0 140.0))
(s69 (/ 1.0 140.0))
(s70 (/ 1.0 140.0))
(s71 (/ 69.0 70.0))
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 (/ 3.0 4.0))
(s109 (/ 1.0 140.0))
(s110 (/ 1.0 140.0))
(s111 (/ 1.0 140.0))
(s112 (/ 1.0 140.0))
(s113 (/ 1.0 140.0))
(s114 (/ 1.0 140.0))
(s115 (/ 1.0 140.0))
(s116 (/ 1.0 140.0))
(s117 (/ 1.0 140.0))
(s118 (/ 1.0 140.0))
(s119 (/ 9.0 140.0))
(s120 (/ 1.0 140.0))
(s121 (/ 1.0 140.0))
(s122 (/ 1.0 140.0))
(s123 (/ 1.0 140.0))
(s124 (/ 1.0 140.0))
(s125 (/ 1.0 140.0))
(s126 (/ 1.0 140.0))
(s127 (/ 1.0 140.0))
(s128 (/ 1.0 140.0))
(s129 (/ 1.0 140.0))
(s130 (/ 1.0 140.0))
(s131 (/ 1.0 140.0))
(s132 (/ 1.0 140.0))
(s133 (/ 1.0 140.0))
(s134 (/ 1.0 140.0))
(s135 (/ 1.0 140.0))
(s136 0.0)
(s137 0.0)
(s138 (/ 1.0 140.0))
(s139 (/ 1.0 140.0))
(s140 (/ 1.0 140.0))
(s141 (/ 1.0 140.0))
(s142 (/ 1.0 140.0))
(s143 (/ 1.0 2.0))
(s144 (/ 1.0 140.0))
(s145 (/ 1.0 140.0))
(s146 (/ 1.0 140.0))
(s147 (/ 1.0 140.0))
(s148 0.0)
(s149 (/ 1.0 140.0))
(s150 (/ 1.0 140.0))
(s151 (/ 1.0 140.0))
(s152 (/ 1.0 140.0))
(s153 (/ 1.0 140.0))
(s154 (/ 8.0 35.0))
(s155 (/ 1.0 140.0))
(s156 (/ 1.0 140.0))
(s157 (/ 1.0 140.0))
(s158 (/ 1.0 140.0))
(s159 (/ 1.0 140.0))
(s160 0.0)
(s161 (/ 3.0 28.0))
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 (/ 1.0 140.0))
(s171 (/ 1.0 140.0))
(s172 (/ 1.0 140.0))
(s173 (/ 1.0 140.0))
(s174 0.0)
(s175 (/ 1.0 140.0))
(s176 (/ 1.0 140.0))
(s177 (/ 1.0 140.0))
(s178 0.0)
(s179 (/ 1.0 140.0))
(s180 (/ 1.0 140.0))
(s181 (/ 1.0 140.0))
(s182 (/ 1.0 140.0))
(s183 0.0)
(s184 (/ 1.0 140.0))
(s185 (/ 1.0 140.0))
(s186 (/ 1.0 140.0))
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 (/ 1.0 140.0))
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 (/ 1.0 140.0))
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 (/ 1.0 140.0))
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 (/ 1.0 140.0))
(s251 (/ 1.0 140.0))
(s252 (/ 1.0 140.0))
(s253 (/ 1.0 140.0))
(s254 (/ 1.0 140.0))
(s255 (/ 1.0 140.0))
(s256 0.0)
(s257 (/ 1.0 140.0))
(s258 (/ 1.0 140.0))
(s259 (/ 129.0 140.0))
(s260 (/ 1.0 140.0))
(s261 (/ 1.0 140.0))
(s262 (/ 1.0 140.0))
(s263 (/ 1.0 140.0))
(s264 (/ 1.0 140.0))
(s265 (/ 1.0 35.0))
(s266 (/ 1.0 140.0))
(s267 (/ 1.0 140.0))
(s268 (/ 1.0 140.0))
(s269 (/ 1.0 140.0))
(s270 (/ 1.0 35.0))
(s271 (/ 1.0 140.0))
(s272 (/ 67.0 70.0))
(s273 (/ 1.0 140.0))
(s274 (/ 1.0 140.0))
(s275 (/ 1.0 140.0))
(s276 (/ 1.0 140.0))
(s277 (/ 1.0 140.0))
(s278 (/ 1.0 140.0))
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 (/ 1.0 140.0))
(s286 (/ 1.0 2.0))
(s287 (/ 1.0 140.0))
(s288 (/ 17.0 35.0))
(s289 (/ 1.0 140.0))
(s290 (/ 1.0 140.0))
(s291 (/ 1.0 140.0))
(s292 (/ 1.0 140.0))
(s293 (/ 1.0 140.0))
(s294 (/ 1.0 140.0))
(s295 (/ 33.0 35.0))
(s296 (/ 1.0 140.0))
(s297 (/ 1.0 140.0))
(s298 0.0)
(s299 (/ 139.0 140.0))
(s300 (/ 1.0 140.0))
(s301 0.0)
(s302 (/ 9.0 10.0))
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 (/ 1.0 10.0))
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 (/ 69.0 70.0))
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 (/ 1.0 70.0))
(s355 (/ 1.0 140.0))
(s356 (/ 1.0 140.0))
(s357 (/ 1.0 140.0))
(s358 (/ 1.0 140.0))
(s359 (/ 53.0 70.0))
(s360 (/ 1.0 140.0))
(s361 (/ 1.0 140.0))
(s362 0.0)
(s363 (/ 1.0 140.0))
(s364 (/ 1.0 140.0))
(s365 (/ 1.0 140.0))
(s366 (/ 1.0 140.0))
(s367 (/ 1.0 140.0))
(s368 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 862/2321 variables, and 113 constraints, problems are : Problem set: 0 solved, 276 unsolved in 45064 ms.
Refiners :[Positive P Invariants (semi-flows): 34/35 constraints, Generalized P Invariants (flows): 79/104 constraints, State Equation: 0/935 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 41/317 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/317 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SDD proceeding with computation,1571 properties remain. new max is 2048
SDD size :5.80686e+11 after 1.28923e+17
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Invariant property smplace_1241 does not hold.
Invariant property smplace_1240 does not hold.
At refinement iteration 5 (OVERLAPS) 3/320 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Invariant property smplace_1186 does not hold.
Invariant property smplace_1173 does not hold.
Invariant property smplace_1172 does not hold.
Invariant property smplace_1171 does not hold.
Invariant property smplace_1170 does not hold.
Invariant property smplace_1169 does not hold.
Invariant property smplace_1168 does not hold.
Invariant property smplace_1167 does not hold.
Invariant property smplace_1166 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_1159 does not hold.
Invariant property smplace_1158 does not hold.
Invariant property smplace_1157 does not hold.
Invariant property smplace_1139 does not hold.
Invariant property smplace_1138 does not hold.
Invariant property smplace_1137 does not hold.
Invariant property smplace_1136 does not hold.
Invariant property smplace_1135 does not hold.
Invariant property smplace_1134 does not hold.
Invariant property smplace_1133 does not hold.
Invariant property smplace_1132 does not hold.
Invariant property smplace_1131 does not hold.
Invariant property smplace_1130 does not hold.
Invariant property smplace_1129 does not hold.
Invariant property smplace_1128 does not hold.
Invariant property smplace_1127 does not hold.
Invariant property smplace_1125 does not hold.
Invariant property smplace_1124 does not hold.
Invariant property smplace_1123 does not hold.
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 265/585 variables, 41/64 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-20 13:24:32] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 29 ms to minimize.
[2024-05-20 13:24:32] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 16 ms to minimize.
[2024-05-20 13:24:34] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 3 ms to minimize.
SDD proceeding with computation,1536 properties remain. new max is 2048
SDD size :1.28923e+17 after 5.10252e+17
[2024-05-20 13:24:34] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 3 ms to minimize.
[2024-05-20 13:24:34] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 9 ms to minimize.
[2024-05-20 13:24:35] [INFO ] Deduced a trap composed of 89 places in 222 ms of which 3 ms to minimize.
Invariant property smplace_1239 does not hold.
Invariant property smplace_1185 does not hold.
Invariant property smplace_1184 does not hold.
Invariant property smplace_1183 does not hold.
Invariant property smplace_1182 does not hold.
Invariant property smplace_1181 does not hold.
Invariant property smplace_1180 does not hold.
Invariant property smplace_1179 does not hold.
Invariant property smplace_1178 does not hold.
Invariant property smplace_1177 does not hold.
Invariant property smplace_1176 does not hold.
Invariant property smplace_1175 does not hold.
[2024-05-20 13:24:37] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/585 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 276 unsolved
SDD proceeding with computation,1524 properties remain. new max is 2048
SDD size :5.10252e+17 after 5.72712e+18
[2024-05-20 13:24:40] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 3 ms to minimize.
Invariant property smplace_1657 does not hold.
Invariant property smplace_1656 does not hold.
Invariant property smplace_1655 does not hold.
Invariant property smplace_1645 does not hold.
Invariant property smplace_1607 does not hold.
Invariant property smplace_1606 does not hold.
Invariant property smplace_1603 does not hold.
Invariant property smplace_1602 does not hold.
[2024-05-20 13:24:41] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 3 ms to minimize.
Invariant property smplace_1521 does not hold.
Invariant property smplace_1497 does not hold.
Invariant property smplace_1496 does not hold.
Invariant property smplace_1495 does not hold.
Invariant property smplace_1494 does not hold.
Invariant property smplace_1493 does not hold.
Invariant property smplace_1492 does not hold.
Invariant property smplace_1491 does not hold.
Invariant property smplace_1490 does not hold.
Invariant property smplace_1489 does not hold.
Invariant property smplace_1488 does not hold.
Invariant property smplace_1487 does not hold.
Invariant property smplace_1486 does not hold.
Invariant property smplace_1485 does not hold.
Invariant property smplace_1484 does not hold.
Invariant property smplace_1483 does not hold.
Invariant property smplace_1482 does not hold.
Invariant property smplace_1481 does not hold.
Invariant property smplace_1233 does not hold.
Invariant property smplace_1232 does not hold.
Invariant property smplace_1221 does not hold.
Invariant property smplace_1220 does not hold.
At refinement iteration 9 (INCLUDED_ONLY) 0/585 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/585 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 11 (OVERLAPS) 42/627 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-20 13:24:54] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/627 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-20 13:25:00] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/627 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 627/2321 variables, and 87 constraints, problems are : Problem set: 0 solved, 276 unsolved in 45024 ms.
Refiners :[Positive P Invariants (semi-flows): 27/35 constraints, Generalized P Invariants (flows): 49/104 constraints, State Equation: 0/935 constraints, PredecessorRefiner: 0/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 90367ms problems are : Problem set: 0 solved, 276 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 276 out of 935 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 935/935 places, 1386/1386 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 935 transition count 1361
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 910 transition count 1361
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 50 place count 910 transition count 1345
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 82 place count 894 transition count 1345
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 100 place count 885 transition count 1336
Applied a total of 100 rules in 75 ms. Remains 885 /935 variables (removed 50) and now considering 1336/1386 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 885/935 places, 1336/1386 transitions.
SDD proceeding with computation,1494 properties remain. new max is 2048
SDD size :5.72712e+18 after 1.95128e+22
Invariant property smplace_1644 does not hold.
Invariant property smplace_1643 does not hold.
Invariant property smplace_1636 does not hold.
Invariant property smplace_1635 does not hold.
Invariant property smplace_1629 does not hold.
Invariant property smplace_1605 does not hold.
Invariant property smplace_1604 does not hold.
Invariant property smplace_1581 does not hold.
Invariant property smplace_1580 does not hold.
Invariant property smplace_1575 does not hold.
Invariant property smplace_1573 does not hold.
Invariant property smplace_1571 does not hold.
Invariant property smplace_1568 does not hold.
Invariant property smplace_1567 does not hold.
Invariant property smplace_1566 does not hold.
Invariant property smplace_1565 does not hold.
Invariant property smplace_1564 does not hold.
Invariant property smplace_1563 does not hold.
Invariant property smplace_1562 does not hold.
Invariant property smplace_1561 does not hold.
Invariant property smplace_1560 does not hold.
Invariant property smplace_1559 does not hold.
Invariant property smplace_1558 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_1549 does not hold.
Invariant property smplace_1548 does not hold.
Invariant property smplace_1534 does not hold.
Invariant property smplace_1533 does not hold.
Invariant property smplace_1532 does not hold.
Invariant property smplace_1531 does not hold.
Invariant property smplace_1530 does not hold.
Invariant property smplace_1529 does not hold.
Invariant property smplace_1528 does not hold.
Invariant property smplace_1527 does not hold.
Invariant property smplace_1526 does not hold.
Invariant property smplace_1525 does not hold.
Invariant property smplace_1524 does not hold.
Invariant property smplace_1523 does not hold.
Invariant property smplace_1522 does not hold.
Invariant property smplace_1520 does not hold.
Invariant property smplace_1519 does not hold.
Invariant property smplace_1518 does not hold.
Invariant property smplace_1515 does not hold.
Invariant property smplace_1514 does not hold.
Invariant property smplace_1478 does not hold.
Invariant property smplace_1477 does not hold.
Invariant property smplace_1417 does not hold.
Invariant property smplace_1416 does not hold.
RANDOM walk for 3944793 steps (52024 resets) in 118107 ms. (33 steps per ms) remains 273/276 properties
BEST_FIRST walk for 40004 steps (123 resets) in 518 ms. (77 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40001 steps (118 resets) in 609 ms. (65 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (120 resets) in 552 ms. (72 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (121 resets) in 534 ms. (74 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (122 resets) in 542 ms. (73 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (118 resets) in 576 ms. (69 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (113 resets) in 615 ms. (64 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (121 resets) in 562 ms. (71 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40002 steps (112 resets) in 659 ms. (60 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (111 resets) in 572 ms. (69 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (120 resets) in 545 ms. (73 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (123 resets) in 499 ms. (80 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (122 resets) in 468 ms. (85 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40002 steps (117 resets) in 513 ms. (77 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (112 resets) in 562 ms. (71 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (124 resets) in 480 ms. (83 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (116 resets) in 499 ms. (80 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (119 resets) in 548 ms. (72 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40002 steps (119 resets) in 541 ms. (73 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (121 resets) in 502 ms. (79 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (122 resets) in 532 ms. (75 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (107 resets) in 531 ms. (75 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (118 resets) in 517 ms. (77 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (123 resets) in 446 ms. (89 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (120 resets) in 556 ms. (71 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (118 resets) in 513 ms. (77 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (115 resets) in 477 ms. (83 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40001 steps (124 resets) in 501 ms. (79 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (118 resets) in 554 ms. (72 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (118 resets) in 553 ms. (72 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (123 resets) in 420 ms. (95 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (113 resets) in 452 ms. (88 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (118 resets) in 654 ms. (61 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (119 resets) in 622 ms. (64 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40002 steps (127 resets) in 812 ms. (49 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40002 steps (119 resets) in 837 ms. (47 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (119 resets) in 627 ms. (63 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (120 resets) in 835 ms. (47 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (120 resets) in 703 ms. (56 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (120 resets) in 780 ms. (51 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (105 resets) in 655 ms. (60 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (117 resets) in 637 ms. (62 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (111 resets) in 659 ms. (60 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40002 steps (119 resets) in 558 ms. (71 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (124 resets) in 635 ms. (62 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (118 resets) in 506 ms. (78 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (111 resets) in 753 ms. (53 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40004 steps (116 resets) in 515 ms. (77 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40003 steps (115 resets) in 601 ms. (66 steps per ms) remains 273/273 properties
BEST_FIRST walk for 40002 steps (112 resets) in 579 ms. (68 steps per ms) remains 273/273 properties
SDD proceeding with computation,1441 properties remain. new max is 2048
SDD size :1.95128e+22 after 5.5133e+23
Invariant property smplace_1912 does not hold.
Invariant property smplace_1757 does not hold.
Invariant property smplace_1756 does not hold.
Invariant property smplace_1755 does not hold.
Invariant property smplace_1754 does not hold.
Invariant property smplace_1753 does not hold.
Invariant property smplace_1726 does not hold.
Invariant property smplace_1634 does not hold.
Invariant property smplace_1628 does not hold.
Invariant property smplace_1627 does not hold.
Invariant property smplace_1626 does not hold.
Invariant property smplace_1625 does not hold.
Invariant property smplace_1624 does not hold.
Invariant property smplace_1617 does not hold.
Invariant property smplace_1616 does not hold.
Invariant property smplace_1610 does not hold.
Invariant property smplace_1609 does not hold.
Invariant property smplace_1579 does not hold.
Invariant property smplace_1578 does not hold.
Invariant property smplace_1577 does not hold.
Invariant property smplace_1576 does not hold.
Invariant property smplace_1574 does not hold.
Invariant property smplace_1572 does not hold.
Invariant property smplace_1570 does not hold.
Invariant property smplace_1476 does not hold.
Invariant property smplace_1475 does not hold.
Invariant property smplace_1474 does not hold.
Invariant property smplace_1473 does not hold.
Invariant property smplace_1472 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_1415 does not hold.
Invariant property smplace_1341 does not hold.
SDD proceeding with computation,1406 properties remain. new max is 2048
SDD size :5.5133e+23 after 5.64973e+25
Interrupted probabilistic random walk after 3285662 steps, run timeout after 117001 ms. (steps per millisecond=28 ) properties seen :33 out of 273
Probabilistic random walk after 3285662 steps, saw 836555 distinct states, run finished after 117020 ms. (steps per millisecond=28 ) properties seen :33
// Phase 1: matrix 1336 rows 885 cols
[2024-05-20 13:27:42] [INFO ] Computed 139 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 20/260 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 1/261 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Invariant property smplace_1375 does not hold.
Invariant property smplace_1374 does not hold.
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 134/395 variables, 29/48 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 47/442 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (OVERLAPS) 2/444 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 13 (OVERLAPS) 140/584 variables, 24/81 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/584 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 15 (OVERLAPS) 26/610 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/610 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 17 (OVERLAPS) 2/612 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/612 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 19 (OVERLAPS) 110/722 variables, 15/102 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/722 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 21 (OVERLAPS) 59/781 variables, 7/109 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/781 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 23 (OVERLAPS) 9/790 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/790 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 25 (OVERLAPS) 93/883 variables, 27/137 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/883 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 27 (OVERLAPS) 1/884 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/884 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 29 (OVERLAPS) 1/885 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/885 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 31 (OVERLAPS) 1336/2221 variables, 885/1024 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2221/2221 variables, and 1024 constraints, problems are : Problem set: 0 solved, 240 unsolved in 75028 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 104/104 constraints, State Equation: 885/885 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 20/260 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 1/261 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 240 unsolved
SDD proceeding with computation,1404 properties remain. new max is 2048
SDD size :5.64973e+25 after 5.64986e+25
At refinement iteration 7 (OVERLAPS) 134/395 variables, 29/48 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-20 13:29:04] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-05-20 13:29:04] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-20 13:29:05] [INFO ] Deduced a trap composed of 67 places in 130 ms of which 2 ms to minimize.
[2024-05-20 13:29:05] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2024-05-20 13:29:05] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
SDD proceeding with computation,1404 properties remain. new max is 4096
SDD size :5.64986e+25 after 5.656e+25
[2024-05-20 13:29:06] [INFO ] Deduced a trap composed of 32 places in 160 ms of which 2 ms to minimize.
Invariant property smplace_1414 does not hold.
Invariant property smplace_1413 does not hold.
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-20 13:29:08] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 3 ms to minimize.
[2024-05-20 13:29:08] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 240 unsolved
SDD proceeding with computation,1402 properties remain. new max is 4096
SDD size :5.656e+25 after 5.66357e+25
Invariant property smplace_1623 does not hold.
[2024-05-20 13:29:12] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 3 ms to minimize.
[2024-05-20 13:29:13] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 2 ms to minimize.
Invariant property smplace_1340 does not hold.
Invariant property smplace_1339 does not hold.
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-20 13:29:16] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/395 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/395 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 13 (OVERLAPS) 47/442 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 240 unsolved
SDD proceeding with computation,1399 properties remain. new max is 4096
SDD size :5.66357e+25 after 5.68325e+25
At refinement iteration 14 (INCLUDED_ONLY) 0/442 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 15 (OVERLAPS) 2/444 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/444 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 17 (OVERLAPS) 140/584 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/584 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 19 (OVERLAPS) 26/610 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/610 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 21 (OVERLAPS) 2/612 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/612 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 23 (OVERLAPS) 110/722 variables, 15/113 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/722 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 25 (OVERLAPS) 59/781 variables, 7/120 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/781 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 27 (OVERLAPS) 9/790 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-20 13:29:57] [INFO ] Deduced a trap composed of 105 places in 205 ms of which 4 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/790 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/790 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 30 (OVERLAPS) 93/883 variables, 27/149 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 883/2221 variables, and 149 constraints, problems are : Problem set: 0 solved, 240 unsolved in 75011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/35 constraints, Generalized P Invariants (flows): 103/104 constraints, State Equation: 0/885 constraints, PredecessorRefiner: 0/240 constraints, Known Traps: 12/12 constraints]
After SMT, in 150164ms problems are : Problem set: 0 solved, 240 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 240 out of 885 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 885/885 places, 1336/1336 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 885 transition count 1320
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 869 transition count 1320
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 32 place count 869 transition count 1313
Deduced a syphon composed of 7 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 47 place count 861 transition count 1313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 47 place count 861 transition count 1312
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 859 transition count 1312
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 50 place count 859 transition count 1311
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 858 transition count 1311
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 857 transition count 1310
Applied a total of 54 rules in 86 ms. Remains 857 /885 variables (removed 28) and now considering 1310/1336 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 857/885 places, 1310/1336 transitions.
RANDOM walk for 4000000 steps (52544 resets) in 106686 ms. (37 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (109 resets) in 418 ms. (95 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (115 resets) in 503 ms. (79 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (117 resets) in 471 ms. (84 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (109 resets) in 521 ms. (76 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (113 resets) in 476 ms. (83 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (122 resets) in 493 ms. (80 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (117 resets) in 470 ms. (84 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (120 resets) in 400 ms. (99 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (116 resets) in 522 ms. (76 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (113 resets) in 460 ms. (86 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (111 resets) in 578 ms. (69 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (114 resets) in 509 ms. (78 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (117 resets) in 448 ms. (89 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (110 resets) in 516 ms. (77 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (114 resets) in 501 ms. (79 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (121 resets) in 398 ms. (100 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (128 resets) in 428 ms. (93 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40001 steps (121 resets) in 490 ms. (81 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (116 resets) in 496 ms. (80 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (120 resets) in 420 ms. (95 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (124 resets) in 543 ms. (73 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (116 resets) in 482 ms. (82 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (120 resets) in 475 ms. (84 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (103 resets) in 511 ms. (78 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (125 resets) in 458 ms. (87 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (121 resets) in 478 ms. (83 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (111 resets) in 547 ms. (72 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (122 resets) in 443 ms. (90 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (115 resets) in 424 ms. (94 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (129 resets) in 384 ms. (103 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (125 resets) in 458 ms. (87 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (119 resets) in 471 ms. (84 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (124 resets) in 528 ms. (75 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (116 resets) in 472 ms. (84 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (124 resets) in 456 ms. (87 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (122 resets) in 525 ms. (76 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (111 resets) in 498 ms. (80 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (124 resets) in 426 ms. (93 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (115 resets) in 442 ms. (90 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (118 resets) in 412 ms. (96 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (122 resets) in 424 ms. (94 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40003 steps (117 resets) in 468 ms. (85 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (111 resets) in 463 ms. (86 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (118 resets) in 444 ms. (89 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (119 resets) in 482 ms. (82 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (116 resets) in 452 ms. (88 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40002 steps (121 resets) in 428 ms. (93 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (115 resets) in 392 ms. (101 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (113 resets) in 474 ms. (84 steps per ms) remains 240/240 properties
BEST_FIRST walk for 40004 steps (122 resets) in 471 ms. (84 steps per ms) remains 240/240 properties
SDD proceeding with computation,1399 properties remain. new max is 8192
SDD size :5.68325e+25 after 5.69073e+25
Invariant property smplace_1513 does not hold.
Invariant property smplace_1512 does not hold.
Invariant property smplace_1511 does not hold.
Invariant property smplace_1510 does not hold.
Invariant property smplace_1509 does not hold.
Invariant property smplace_1502 does not hold.
Invariant property smplace_1501 does not hold.
Invariant property smplace_1500 does not hold.
Invariant property smplace_1499 does not hold.
Invariant property smplace_1378 does not hold.
Invariant property smplace_1377 does not hold.
SDD proceeding with computation,1388 properties remain. new max is 8192
SDD size :5.69073e+25 after 5.70237e+25
Invariant property smplace_1547 does not hold.
Invariant property smplace_1546 does not hold.
Invariant property smplace_1545 does not hold.
Invariant property smplace_1544 does not hold.
Invariant property smplace_1543 does not hold.
Invariant property smplace_1539 does not hold.
Invariant property smplace_1538 does not hold.
Invariant property smplace_1537 does not hold.
Invariant property smplace_1536 does not hold.
Invariant property smplace_1381 does not hold.
Invariant property smplace_1380 does not hold.
SDD proceeding with computation,1377 properties remain. new max is 8192
SDD size :5.70237e+25 after 5.79355e+25
Invariant property smplace_1752 does not hold.
Invariant property smplace_1751 does not hold.
Invariant property smplace_1750 does not hold.
Invariant property smplace_1622 does not hold.
Invariant property smplace_1621 does not hold.
Invariant property smplace_1620 does not hold.
Invariant property smplace_1619 does not hold.
Invariant property smplace_1618 does not hold.
Interrupted probabilistic random walk after 3330677 steps, run timeout after 102001 ms. (steps per millisecond=32 ) properties seen :0 out of 240
Probabilistic random walk after 3330677 steps, saw 873376 distinct states, run finished after 102002 ms. (steps per millisecond=32 ) properties seen :0
// Phase 1: matrix 1310 rows 857 cols
[2024-05-20 13:32:29] [INFO ] Computed 137 invariants in 18 ms
Invariant property smplace_1338 does not hold.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 20/260 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/260 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 1/261 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 134/395 variables, 29/48 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 37/432 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/432 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 11 (OVERLAPS) 2/434 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/434 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 13 (OVERLAPS) 125/559 variables, 22/79 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Detected timeout of ITS tools.
[2024-05-20 13:32:50] [INFO ] Flatten gal took : 128 ms
[2024-05-20 13:32:50] [INFO ] Applying decomposition
[2024-05-20 13:32:50] [INFO ] Flatten gal took : 108 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/graph420196423288983833.txt' '-o' '/tmp/graph420196423288983833.bin' '-w' '/tmp/graph420196423288983833.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph420196423288983833.bin' '-l' '-1' '-v' '-w' '/tmp/graph420196423288983833.weights' '-q' '0' '-e' '0.001'
[2024-05-20 13:32:51] [INFO ] Decomposing Gal with order
[2024-05-20 13:32:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 13:32:52] [INFO ] Removed a total of 1934 redundant transitions.
[2024-05-20 13:32:52] [INFO ] Flatten gal took : 325 ms
[2024-05-20 13:32:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 165 ms.
[2024-05-20 13:32:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1734437818412545354.gal : 90 ms
[2024-05-20 13:32:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3615260070822532739.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/ReachabilityCardinality1734437818412545354.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3615260070822532739.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 ...307
Loading property file /tmp/ReachabilityCardinality3615260070822532739.prop.
SDD proceeding with computation,240 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,240 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,240 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,240 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,240 properties remain. new max is 64
SDD size :1 after 144426
SDD proceeding with computation,240 properties remain. new max is 128
SDD size :144426 after 3.06512e+24
At refinement iteration 14 (INCLUDED_ONLY) 0/559 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 15 (OVERLAPS) 26/585 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/585 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 17 (OVERLAPS) 2/587 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/587 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 19 (OVERLAPS) 97/684 variables, 15/100 constraints. Problems are: Problem set: 0 solved, 240 unsolved
SDD proceeding with computation,240 properties remain. new max is 256
SDD size :2.25208e+26 after 7.21683e+29
At refinement iteration 20 (INCLUDED_ONLY) 0/684 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 21 (OVERLAPS) 5/689 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/689 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 23 (OVERLAPS) 70/759 variables, 6/109 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/759 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 25 (OVERLAPS) 45/804 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/804 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 27 (OVERLAPS) 4/808 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Invariant property smplace_843 does not hold.
Invariant property smplace_842 does not hold.
Invariant property smplace_841 does not hold.
Invariant property smplace_664 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_657 does not hold.
Invariant property smplace_656 does not hold.
Invariant property smplace_655 does not hold.
Invariant property smplace_654 does not hold.
Invariant property smplace_653 does not hold.
Invariant property smplace_652 does not hold.
Invariant property smplace_647 does not hold.
Invariant property smplace_646 does not hold.
Invariant property smplace_645 does not hold.
Invariant property smplace_644 does not hold.
Invariant property smplace_643 does not hold.
Invariant property smplace_642 does not hold.
Invariant property smplace_641 does not hold.
Invariant property smplace_640 does not hold.
Invariant property smplace_639 does not hold.
Invariant property smplace_638 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_630 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_608 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_463 does not hold.
Invariant property smplace_462 does not hold.
Invariant property smplace_461 does not hold.
Invariant property smplace_460 does not hold.
Invariant property smplace_459 does not hold.
Invariant property smplace_458 does not hold.
Invariant property smplace_457 does not hold.
Invariant property smplace_456 does not hold.
Invariant property smplace_455 does not hold.
Invariant property smplace_448 does not hold.
Invariant property smplace_447 does not hold.
Invariant property smplace_446 does not hold.
Invariant property smplace_432 does not hold.
Invariant property smplace_431 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_425 does not hold.
Invariant property smplace_424 does not hold.
Invariant property smplace_423 does not hold.
Invariant property smplace_422 does not hold.
Invariant property smplace_421 does not hold.
Invariant property smplace_420 does not hold.
Invariant property smplace_419 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_412 does not hold.
Invariant property smplace_411 does not hold.
Invariant property smplace_410 does not hold.
Invariant property smplace_409 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_405 does not hold.
Invariant property smplace_404 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_265 does not hold.
Invariant property smplace_264 does not hold.
Invariant property smplace_263 does not hold.
Invariant property smplace_262 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_258 does not hold.
Invariant property smplace_257 does not hold.
Invariant property smplace_256 does not hold.
Invariant property smplace_255 does not hold.
Invariant property smplace_254 does not hold.
Invariant property smplace_253 does not hold.
Invariant property smplace_252 does not hold.
Invariant property smplace_251 does not hold.
Invariant property smplace_250 does not hold.
Invariant property smplace_249 does not hold.
Invariant property smplace_248 does not hold.
Invariant property smplace_247 does not hold.
Invariant property smplace_246 does not hold.
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_238 does not hold.
Invariant property smplace_237 does not hold.
Invariant property smplace_236 does not hold.
Invariant property smplace_235 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_216 does not hold.
Invariant property smplace_215 does not hold.
Invariant property smplace_214 does not hold.
Invariant property smplace_213 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_209 does not hold.
Invariant property smplace_208 does not hold.
Invariant property smplace_207 does not hold.
Invariant property smplace_206 does not hold.
Invariant property smplace_205 does not hold.
Invariant property smplace_204 does not hold.
Invariant property smplace_203 does not hold.
Invariant property smplace_202 does not hold.
Invariant property smplace_201 does not hold.
Invariant property smplace_200 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_179 does not hold.
Invariant property smplace_178 does not hold.
Invariant property smplace_177 does not hold.
Invariant property smplace_176 does not hold.
Invariant property smplace_175 does not hold.
Invariant property smplace_174 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_167 does not hold.
Invariant property smplace_166 does not hold.
Invariant property smplace_165 does not hold.
Invariant property smplace_164 does not hold.
Invariant property smplace_163 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_159 does not hold.
Invariant property smplace_158 does not hold.
Invariant property smplace_91 does not hold.
Invariant property smplace_90 does not hold.
Invariant property smplace_89 does not hold.
Invariant property smplace_79 does not hold.
Invariant property smplace_78 does not hold.
Invariant property smplace_77 does not hold.
Invariant property smplace_76 does not hold.
Invariant property smplace_75 does not hold.
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_69 does not hold.
Invariant property smplace_68 does not hold.
Invariant property smplace_67 does not hold.
Invariant property smplace_66 does not hold.
Invariant property smplace_65 does not hold.
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.
Invariant property smplace_60 does not hold.
Invariant property smplace_59 does not hold.
Invariant property smplace_58 does not hold.
Invariant property smplace_57 does not hold.
Invariant property smplace_56 does not hold.
Invariant property smplace_55 does not hold.
Invariant property smplace_51 does not hold.
Invariant property smplace_50 does not hold.
Invariant property smplace_49 does not hold.
Invariant property smplace_48 does not hold.
Invariant property smplace_47 does not hold.
Invariant property smplace_46 does not hold.
Invariant property smplace_42 does not hold.
Invariant property smplace_41 does not hold.
Invariant property smplace_40 does not hold.
Invariant property smplace_39 does not hold.
Invariant property smplace_38 does not hold.
Invariant property smplace_37 does not hold.
Invariant property smplace_36 does not hold.
Invariant property smplace_35 does not hold.
Invariant property smplace_34 does not hold.
Invariant property smplace_33 does not hold.
Invariant property smplace_32 does not hold.
Invariant property smplace_31 does not hold.
Invariant property smplace_30 does not hold.
Invariant property smplace_29 does not hold.
Invariant property smplace_28 does not hold.
Invariant property smplace_27 does not hold.
Invariant property smplace_26 does not hold.
Invariant property smplace_25 does not hold.
Invariant property smplace_24 does not hold.
Invariant property smplace_23 does not hold.
Invariant property smplace_22 does not hold.
Invariant property smplace_21 does not hold.
Invariant property smplace_20 does not hold.
Invariant property smplace_19 does not hold.
Invariant property smplace_18 does not hold.
Invariant property smplace_17 does not hold.
Invariant property smplace_16 does not hold.
Invariant property smplace_15 does not hold.
Invariant property smplace_14 does not hold.
Invariant property smplace_13 does not hold.
Invariant property smplace_12 does not hold.
Invariant property smplace_11 does not hold.
Invariant property smplace_10 does not hold.
Invariant property smplace_9 does not hold.
Invariant property smplace_8 does not hold.
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.03733e+30 after 1.04351e+30
At refinement iteration 28 (INCLUDED_ONLY) 0/808 variables, 0/115 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 49/857 variables, 22/137 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/857 variables, 0/137 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 1310/2167 variables, 857/994 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2167 variables, 0/994 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 0/2167 variables, 0/994 constraints. Problems are: Problem set: 236 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2167/2167 variables, and 994 constraints, problems are : Problem set: 236 solved, 4 unsolved in 71440 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 857/857 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 236 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 1/1 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 1/2 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 145/167 variables, 12/14 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 0/14 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 57/224 variables, 13/27 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/27 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/227 variables, 3/30 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/30 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 314/541 variables, 43/73 constraints. Problems are: Problem set: 236 solved, 4 unsolved
[2024-05-20 13:33:41] [INFO ] Deduced a trap composed of 60 places in 246 ms of which 18 ms to minimize.
[2024-05-20 13:33:42] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/541 variables, 2/75 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/75 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 30/571 variables, 6/81 constraints. Problems are: Problem set: 236 solved, 4 unsolved
[2024-05-20 13:33:42] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/571 variables, 1/82 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/571 variables, 0/82 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 2/573 variables, 2/84 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/573 variables, 0/84 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 111/684 variables, 19/103 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/684 variables, 0/103 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 5/689 variables, 3/106 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/689 variables, 0/106 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 70/759 variables, 6/112 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/759 variables, 0/112 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 45/804 variables, 5/117 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/804 variables, 0/117 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 4/808 variables, 1/118 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/808 variables, 0/118 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 49/857 variables, 22/140 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/857 variables, 0/140 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 1310/2167 variables, 857/997 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2167 variables, 4/1001 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2167 variables, 0/1001 constraints. Problems are: Problem set: 236 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 0/2167 variables, 0/1001 constraints. Problems are: Problem set: 236 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2167/2167 variables, and 1001 constraints, problems are : Problem set: 236 solved, 4 unsolved in 4359 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 857/857 constraints, PredecessorRefiner: 4/240 constraints, Known Traps: 3/3 constraints]
After SMT, in 75923ms problems are : Problem set: 236 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10732 ms.
Support contains 4 out of 857 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 857/857 places, 1310/1310 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 857 transition count 1267
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 814 transition count 1267
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 86 place count 814 transition count 1204
Deduced a syphon composed of 63 places in 2 ms
Ensure Unique test removed 7 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 133 rules applied. Total rules applied 219 place count 744 transition count 1204
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 225 place count 743 transition count 1199
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 230 place count 738 transition count 1199
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 230 place count 738 transition count 1197
Deduced a syphon composed of 2 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 236 place count 734 transition count 1197
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 236 place count 734 transition count 1195
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 240 place count 732 transition count 1195
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 245 place count 727 transition count 1190
Iterating global reduction 4 with 5 rules applied. Total rules applied 250 place count 727 transition count 1190
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 43 rules applied. Total rules applied 293 place count 704 transition count 1170
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 4 with 1 rules applied. Total rules applied 294 place count 704 transition count 1169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 295 place count 703 transition count 1169
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 295 place count 703 transition count 1165
Deduced a syphon composed of 4 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 9 rules applied. Total rules applied 304 place count 698 transition count 1165
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 307 place count 695 transition count 1165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 307 place count 695 transition count 1164
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 309 place count 694 transition count 1164
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 311 place count 692 transition count 1157
Ensure Unique test removed 1 places
Iterating global reduction 7 with 3 rules applied. Total rules applied 314 place count 691 transition count 1157
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 315 place count 690 transition count 1157
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 316 place count 689 transition count 1156
Iterating global reduction 8 with 1 rules applied. Total rules applied 317 place count 689 transition count 1156
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 8 with 2 rules applied. Total rules applied 319 place count 689 transition count 1154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 320 place count 688 transition count 1154
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 332 place count 682 transition count 1148
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 335 place count 679 transition count 1145
Iterating global reduction 10 with 3 rules applied. Total rules applied 338 place count 679 transition count 1145
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 339 place count 678 transition count 1144
Iterating global reduction 10 with 1 rules applied. Total rules applied 340 place count 678 transition count 1144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 341 place count 678 transition count 1143
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 343 place count 678 transition count 1141
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 345 place count 676 transition count 1141
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 346 place count 676 transition count 1140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 347 place count 675 transition count 1140
Applied a total of 347 rules in 340 ms. Remains 675 /857 variables (removed 182) and now considering 1140/1310 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 675/857 places, 1140/1310 transitions.
RANDOM walk for 4000000 steps (51384 resets) in 38023 ms. (105 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000002 steps (11592 resets) in 14064 ms. (284 steps per ms) remains 4/4 properties
BEST_FIRST walk for 3979241 steps (11607 resets) in 14350 ms. (277 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (11672 resets) in 13556 ms. (295 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000001 steps (11681 resets) in 13805 ms. (289 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 6145615 steps, run timeout after 84001 ms. (steps per millisecond=73 ) properties seen :0 out of 4
Probabilistic random walk after 6145615 steps, saw 1569619 distinct states, run finished after 84001 ms. (steps per millisecond=73 ) properties seen :0
// Phase 1: matrix 1140 rows 675 cols
[2024-05-20 13:35:48] [INFO ] Computed 118 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/57 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 157/214 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 26/240 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/242 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 125/367 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 27/394 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/396 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 111/507 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/507 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 60/567 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/567 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 9/576 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/576 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 97/673 variables, 29/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/673 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1/674 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/674 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/675 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/675 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 1140/1815 variables, 675/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1815 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 0/1815 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1815/1815 variables, and 793 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1733 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 49/53 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/57 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 157/214 variables, 18/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 26/240 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/242 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 125/367 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/367 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 27/394 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/394 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/396 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/396 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 111/507 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/507 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 60/567 variables, 8/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/567 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 9/576 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/576 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 97/673 variables, 29/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/673 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 1/674 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/674 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 1/675 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/675 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 1140/1815 variables, 675/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1815 variables, 4/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1815 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 0/1815 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1815/1815 variables, and 797 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2513 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 87/87 constraints, State Equation: 675/675 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 4272ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5839 ms.
Support contains 4 out of 675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 1140/1140 transitions.
Applied a total of 0 rules in 38 ms. Remains 675 /675 variables (removed 0) and now considering 1140/1140 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 675/675 places, 1140/1140 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 675/675 places, 1140/1140 transitions.
Applied a total of 0 rules in 26 ms. Remains 675 /675 variables (removed 0) and now considering 1140/1140 (removed 0) transitions.
[2024-05-20 13:35:59] [INFO ] Invariant cache hit.
[2024-05-20 13:36:00] [INFO ] Implicit Places using invariants in 874 ms returned [0, 18, 19, 30, 48, 66, 87, 137, 146, 147, 149, 166, 184, 255, 259, 260, 271, 272, 274, 291, 309, 378, 382, 383, 394, 395, 397, 414, 432, 501, 505, 506, 509, 520, 521, 522, 540, 542, 546, 564, 565, 566, 567, 579, 585, 591, 597, 603, 609, 615, 621, 627, 633, 639]
[2024-05-20 13:36:00] [INFO ] Actually due to overlaps returned [540, 522, 48, 166, 291, 414, 546, 149, 274, 397, 30, 146, 271, 394, 520, 564, 147, 272, 395, 521, 542, 565, 0, 19, 259, 260, 382, 383, 505, 506, 184, 309, 432, 566, 609, 627, 639, 18, 66, 87, 509, 567, 579, 585, 591, 597, 603, 615, 621, 633]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 890 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 625/675 places, 1140/1140 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 622 transition count 1046
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 195 place count 528 transition count 1042
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 195 place count 528 transition count 1019
Deduced a syphon composed of 23 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 504 transition count 1019
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 254 place count 500 transition count 1011
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 262 place count 492 transition count 1011
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 277 place count 477 transition count 996
Iterating global reduction 4 with 15 rules applied. Total rules applied 292 place count 477 transition count 996
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 295 place count 477 transition count 993
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 295 place count 477 transition count 992
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 297 place count 476 transition count 992
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 300 place count 473 transition count 986
Iterating global reduction 5 with 3 rules applied. Total rules applied 303 place count 473 transition count 986
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 304 place count 472 transition count 985
Iterating global reduction 5 with 1 rules applied. Total rules applied 305 place count 472 transition count 985
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 306 place count 471 transition count 983
Iterating global reduction 5 with 1 rules applied. Total rules applied 307 place count 471 transition count 983
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 375 place count 437 transition count 949
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 378 place count 434 transition count 946
Iterating global reduction 5 with 3 rules applied. Total rules applied 381 place count 434 transition count 946
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 384 place count 434 transition count 943
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 388 place count 432 transition count 944
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 397 place count 432 transition count 935
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 407 place count 422 transition count 935
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 419 place count 422 transition count 935
Applied a total of 419 rules in 207 ms. Remains 422 /625 variables (removed 203) and now considering 935/1140 (removed 205) transitions.
// Phase 1: matrix 935 rows 422 cols
[2024-05-20 13:36:00] [INFO ] Computed 59 invariants in 9 ms
[2024-05-20 13:36:00] [INFO ] Implicit Places using invariants in 486 ms returned [88, 94, 97, 99, 100, 103, 104, 158, 175, 181, 184, 186, 191, 192, 244, 261, 267, 270, 272, 277, 278, 330, 347, 353, 356, 358]
[2024-05-20 13:36:00] [INFO ] Actually due to overlaps returned [103, 191, 277, 104, 192, 278, 88, 94, 99, 175, 181, 186, 261, 267, 272, 347, 353, 358, 100, 158, 244, 330]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 489 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 400/675 places, 935/1140 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 384 transition count 919
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 384 transition count 919
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 380 transition count 915
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 380 transition count 915
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 0 with 14 rules applied. Total rules applied 54 place count 373 transition count 908
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 373 transition count 896
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 78 place count 361 transition count 896
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 361 transition count 893
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 358 transition count 893
Applied a total of 84 rules in 91 ms. Remains 358 /400 variables (removed 42) and now considering 893/935 (removed 42) transitions.
// Phase 1: matrix 893 rows 358 cols
[2024-05-20 13:36:00] [INFO ] Computed 37 invariants in 8 ms
[2024-05-20 13:36:01] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-20 13:36:01] [INFO ] Invariant cache hit.
[2024-05-20 13:36:02] [INFO ] Implicit Places using invariants and state equation in 1205 ms returned []
Implicit Place search using SMT with State Equation took 1575 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 358/675 places, 893/1140 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3281 ms. Remains : 358/675 places, 893/1140 transitions.
RANDOM walk for 4000000 steps (78241 resets) in 29432 ms. (135 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000002 steps (21830 resets) in 11529 ms. (346 steps per ms) remains 4/4 properties
BEST_FIRST walk for 3770050 steps (20445 resets) in 11967 ms. (315 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (21693 resets) in 11819 ms. (338 steps per ms) remains 4/4 properties
BEST_FIRST walk for 3895407 steps (21130 resets) in 11974 ms. (325 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 4294400 steps, run timeout after 75001 ms. (steps per millisecond=57 ) properties seen :0 out of 4
Probabilistic random walk after 4294400 steps, saw 2218567 distinct states, run finished after 75001 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-20 13:37:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 145/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/161 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 13/174 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/207 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 118/325 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 22/347 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 11/358 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 893/1251 variables, 358/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1251 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1251 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1251/1251 variables, and 395 constraints, problems are : Problem set: 0 solved, 4 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 145/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/161 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 13/174 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/207 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 118/325 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 22/347 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 11/358 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 893/1251 variables, 358/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1251 variables, 4/399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1251 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1251 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1251/1251 variables, and 399 constraints, problems are : Problem set: 0 solved, 4 unsolved in 984 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1722ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6307 ms.
Support contains 4 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 893/893 transitions.
Applied a total of 0 rules in 13 ms. Remains 358 /358 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 358/358 places, 893/893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 893/893 transitions.
Applied a total of 0 rules in 32 ms. Remains 358 /358 variables (removed 0) and now considering 893/893 (removed 0) transitions.
[2024-05-20 13:37:50] [INFO ] Invariant cache hit.
[2024-05-20 13:37:51] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-20 13:37:51] [INFO ] Invariant cache hit.
[2024-05-20 13:37:52] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1468 ms to find 0 implicit places.
[2024-05-20 13:37:52] [INFO ] Redundant transitions in 83 ms returned []
Running 868 sub problems to find dead transitions.
[2024-05-20 13:37:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 3 (OVERLAPS) 1/358 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1251 variables, and 37 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/358 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 3 (OVERLAPS) 1/358 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-05-20 13:38:45] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 3 ms to minimize.
[2024-05-20 13:38:51] [INFO ] Deduced a trap composed of 60 places in 484 ms of which 3 ms to minimize.
[2024-05-20 13:38:53] [INFO ] Deduced a trap composed of 61 places in 393 ms of which 5 ms to minimize.
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 Int declared 358/1251 variables, and 40 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/358 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 3/3 constraints]
After SMT, in 61048ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 61067ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62666 ms. Remains : 358/358 places, 893/893 transitions.
RANDOM walk for 400000 steps (7847 resets) in 9061 ms. (44 steps per ms) remains 4/4 properties
Running SMT prover for 4 properties.
[2024-05-20 13:38:56] [INFO ] Invariant cache hit.
[2024-05-20 13:38:56] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-20 13:38:56] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 37 ms returned sat
[2024-05-20 13:38:56] [INFO ] After 571ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-20 13:38:57] [INFO ] After 910ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 13:38:57] [INFO ] After 1100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 13:38:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-20 13:38:57] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 23 ms returned sat
[2024-05-20 13:38:57] [INFO ] After 503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-20 13:38:58] [INFO ] After 837ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-20 13:38:58] [INFO ] After 991ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
RANDOM walk for 4000000 steps (78639 resets) in 38531 ms. (103 steps per ms) remains 4/4 properties
BEST_FIRST walk for 3719933 steps (20201 resets) in 11206 ms. (331 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000003 steps (21704 resets) in 11321 ms. (353 steps per ms) remains 4/4 properties
BEST_FIRST walk for 3668209 steps (20029 resets) in 11456 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000003 steps (21797 resets) in 11905 ms. (335 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 6919120 steps, run timeout after 105001 ms. (steps per millisecond=65 ) properties seen :0 out of 4
Probabilistic random walk after 6919120 steps, saw 2864695 distinct states, run finished after 105002 ms. (steps per millisecond=65 ) properties seen :0
[2024-05-20 13:41:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 145/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/161 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 13/174 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/207 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 118/325 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 22/347 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 11/358 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 893/1251 variables, 358/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1251 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1251 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1251/1251 variables, and 395 constraints, problems are : Problem set: 0 solved, 4 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 145/149 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 12/161 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 13/174 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/207 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 118/325 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 22/347 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 11/358 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 893/1251 variables, 358/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1251 variables, 4/399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1251 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1251 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1251/1251 variables, and 399 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1116 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1847ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6545 ms.
Support contains 4 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 893/893 transitions.
Applied a total of 0 rules in 14 ms. Remains 358 /358 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 358/358 places, 893/893 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 893/893 transitions.
Applied a total of 0 rules in 12 ms. Remains 358 /358 variables (removed 0) and now considering 893/893 (removed 0) transitions.
[2024-05-20 13:41:26] [INFO ] Invariant cache hit.
[2024-05-20 13:41:27] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-20 13:41:27] [INFO ] Invariant cache hit.
[2024-05-20 13:41:28] [INFO ] Implicit Places using invariants and state equation in 1650 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
[2024-05-20 13:41:28] [INFO ] Redundant transitions in 66 ms returned []
Running 868 sub problems to find dead transitions.
[2024-05-20 13:41:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 3 (OVERLAPS) 1/358 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 868 unsolved
SMT process timed out in 30620ms, After SMT, problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 30632ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32741 ms. Remains : 358/358 places, 893/893 transitions.
RANDOM walk for 400000 steps (7872 resets) in 4339 ms. (92 steps per ms) remains 4/4 properties
Running SMT prover for 4 properties.
[2024-05-20 13:42:01] [INFO ] Invariant cache hit.
[2024-05-20 13:42:01] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-20 13:42:01] [INFO ] [Real]Absence check using 11 positive and 26 generalized place invariants in 24 ms returned sat
[2024-05-20 13:42:01] [INFO ] After 436ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-20 13:42:02] [INFO ] After 656ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 13:42:02] [INFO ] After 804ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 13:42:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-20 13:42:02] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 20 ms returned sat
[2024-05-20 13:42:02] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-20 13:42:02] [INFO ] After 540ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-20 13:42:02] [INFO ] After 647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
RANDOM walk for 40000 steps (776 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (213 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 372601 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 1
Probabilistic random walk after 372601 steps, saw 259209 distinct states, run finished after 3004 ms. (steps per millisecond=124 ) properties seen :0
[2024-05-20 13:42:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/116 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/119 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/132 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 160/325 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/347 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/358 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 893/1251 variables, 358/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1251 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1251 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1251/1251 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/116 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/119 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/132 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 160/325 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/347 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/358 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 893/1251 variables, 358/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1251 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1251 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1251 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1251/1251 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 919ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 163 ms.
Support contains 1 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 893/893 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 358 transition count 891
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 356 transition count 891
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 356 transition count 890
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 355 transition count 890
Applied a total of 6 rules in 25 ms. Remains 355 /358 variables (removed 3) and now considering 890/893 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 355/358 places, 890/893 transitions.
RANDOM walk for 40000 steps (781 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (210 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 392549 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 1
Probabilistic random walk after 392549 steps, saw 273436 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
// Phase 1: matrix 890 rows 355 cols
[2024-05-20 13:42:10] [INFO ] Computed 37 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/113 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/129 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 160/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/344 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/355 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 890/1245 variables, 355/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1245 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1245 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 392 constraints, problems are : Problem set: 0 solved, 1 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/113 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/129 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 160/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/344 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/355 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 890/1245 variables, 355/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1245 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1245 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1245 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 951ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 71 ms.
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 890/890 transitions.
Applied a total of 0 rules in 13 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 355/355 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 890/890 transitions.
Applied a total of 0 rules in 16 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-20 13:42:11] [INFO ] Invariant cache hit.
[2024-05-20 13:42:11] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-20 13:42:11] [INFO ] Invariant cache hit.
[2024-05-20 13:42:12] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1626 ms to find 0 implicit places.
[2024-05-20 13:42:12] [INFO ] Redundant transitions in 13 ms returned []
Running 865 sub problems to find dead transitions.
[2024-05-20 13:42:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 3 (OVERLAPS) 1/355 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 355/1245 variables, and 37 constraints, problems are : Problem set: 0 solved, 865 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/355 constraints, PredecessorRefiner: 865/865 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 865 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 865 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 3 (OVERLAPS) 1/355 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 865 unsolved
[2024-05-20 13:43:02] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 3 ms to minimize.
[2024-05-20 13:43:09] [INFO ] Deduced a trap composed of 61 places in 466 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/1245 variables, and 39 constraints, problems are : Problem set: 0 solved, 865 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/355 constraints, PredecessorRefiner: 0/865 constraints, Known Traps: 2/2 constraints]
After SMT, in 60734ms problems are : Problem set: 0 solved, 865 unsolved
Search for dead transitions found 0 dead transitions in 60754ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62422 ms. Remains : 355/355 places, 890/890 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 13 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-20 13:43:13] [INFO ] Invariant cache hit.
[2024-05-20 13:43:13] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 13:43:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2024-05-20 13:43:14] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 23 ms returned sat
[2024-05-20 13:43:14] [INFO ] After 548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 13:43:14] [INFO ] After 623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 13:43:14] [INFO ] After 940ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1196 ms.
RANDOM walk for 40000 steps (759 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (217 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 346009 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 346009 steps, saw 240194 distinct states, run finished after 3004 ms. (steps per millisecond=115 ) properties seen :0
// Phase 1: matrix 893 rows 358 cols
[2024-05-20 13:43:17] [INFO ] Computed 37 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/116 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/119 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/132 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 160/325 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/347 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/358 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 893/1251 variables, 358/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1251 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1251 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1251/1251 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 749 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/97 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/116 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/119 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/132 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 160/325 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/325 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/347 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/358 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/358 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 893/1251 variables, 358/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1251 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1251 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1251 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1251/1251 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1487ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 1 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 893/893 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 358 transition count 891
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 356 transition count 890
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 355 transition count 890
Applied a total of 6 rules in 26 ms. Remains 355 /358 variables (removed 3) and now considering 890/893 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 355/358 places, 890/893 transitions.
RANDOM walk for 40000 steps (767 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (213 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 401426 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 401426 steps, saw 279781 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
// Phase 1: matrix 890 rows 355 cols
[2024-05-20 13:43:22] [INFO ] Computed 37 invariants in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/113 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/129 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 160/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/344 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/355 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 890/1245 variables, 355/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1245 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1245 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 392 constraints, problems are : Problem set: 0 solved, 1 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/113 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/129 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/162 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 160/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/344 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/355 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 890/1245 variables, 355/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1245 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1245 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1245 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 619 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1194ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 890/890 transitions.
Applied a total of 0 rules in 13 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 355/355 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 890/890 transitions.
Applied a total of 0 rules in 12 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-20 13:43:23] [INFO ] Invariant cache hit.
[2024-05-20 13:43:24] [INFO ] Implicit Places using invariants in 586 ms returned []
[2024-05-20 13:43:24] [INFO ] Invariant cache hit.
[2024-05-20 13:43:25] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned []
Implicit Place search using SMT with State Equation took 1892 ms to find 0 implicit places.
[2024-05-20 13:43:25] [INFO ] Redundant transitions in 51 ms returned []
Running 865 sub problems to find dead transitions.
[2024-05-20 13:43:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 3 (OVERLAPS) 1/355 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 865 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 355/1245 variables, and 37 constraints, problems are : Problem set: 0 solved, 865 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/355 constraints, PredecessorRefiner: 865/865 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 865 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 3 (OVERLAPS) 1/355 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 865 unsolved
[2024-05-20 13:44:15] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 5 ms to minimize.
[2024-05-20 13:44:20] [INFO ] Deduced a trap composed of 64 places in 326 ms of which 4 ms to minimize.
[2024-05-20 13:44:21] [INFO ] Deduced a trap composed of 77 places in 325 ms of which 8 ms to minimize.
[2024-05-20 13:44:22] [INFO ] Deduced a trap composed of 61 places in 310 ms of which 3 ms to minimize.
[2024-05-20 13:44:25] [INFO ] Deduced a trap composed of 71 places in 307 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/1245 variables, and 42 constraints, problems are : Problem set: 0 solved, 865 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/355 constraints, PredecessorRefiner: 0/865 constraints, Known Traps: 5/5 constraints]
After SMT, in 60622ms problems are : Problem set: 0 solved, 865 unsolved
Search for dead transitions found 0 dead transitions in 60634ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62600 ms. Remains : 355/355 places, 890/890 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 14 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-20 13:44:26] [INFO ] Invariant cache hit.
[2024-05-20 13:44:26] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 13:44:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-20 13:44:26] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 17 ms returned sat
[2024-05-20 13:44:27] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 13:44:27] [INFO ] After 419ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 13:44:27] [INFO ] After 555ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 698 ms.
RANDOM walk for 40000 steps (820 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (208 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 384557 steps, run timeout after 3014 ms. (steps per millisecond=127 ) properties seen :0 out of 1
Probabilistic random walk after 384557 steps, saw 267730 distinct states, run finished after 3014 ms. (steps per millisecond=127 ) properties seen :0
// Phase 1: matrix 893 rows 358 cols
[2024-05-20 13:44:30] [INFO ] Computed 37 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 116/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/129 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/142 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/175 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 150/325 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/347 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/358 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 893/1251 variables, 358/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1251 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1251 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1251/1251 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 430 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 116/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/129 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/142 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/175 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 150/325 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/347 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/358 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 893/1251 variables, 358/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1251 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1251 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1251 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1251/1251 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1107ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 893/893 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 358 transition count 891
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 356 transition count 891
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 356 transition count 890
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 355 transition count 890
Applied a total of 6 rules in 20 ms. Remains 355 /358 variables (removed 3) and now considering 890/893 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 355/358 places, 890/893 transitions.
RANDOM walk for 40000 steps (817 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (222 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 388327 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :0 out of 1
Probabilistic random walk after 388327 steps, saw 270471 distinct states, run finished after 3004 ms. (steps per millisecond=129 ) properties seen :0
// Phase 1: matrix 890 rows 355 cols
[2024-05-20 13:44:34] [INFO ] Computed 37 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/114 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/126 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/139 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 150/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/344 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/355 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 890/1245 variables, 355/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1245 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1245 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 392 constraints, problems are : Problem set: 0 solved, 1 unsolved in 494 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/114 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/126 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/139 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 150/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/344 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/355 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 890/1245 variables, 355/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1245 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1245 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1245 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1017ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 890/890 transitions.
Applied a total of 0 rules in 13 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 355/355 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 890/890 transitions.
Applied a total of 0 rules in 14 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-20 13:44:35] [INFO ] Invariant cache hit.
[2024-05-20 13:44:36] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-20 13:44:36] [INFO ] Invariant cache hit.
[2024-05-20 13:44:36] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
[2024-05-20 13:44:36] [INFO ] Redundant transitions in 14 ms returned []
Running 865 sub problems to find dead transitions.
[2024-05-20 13:44:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 3 (OVERLAPS) 1/355 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 865 unsolved
[2024-05-20 13:45:07] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 355/1245 variables, and 38 constraints, problems are : Problem set: 0 solved, 865 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/355 constraints, PredecessorRefiner: 865/865 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 865 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 3 (OVERLAPS) 1/355 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 865 unsolved
[2024-05-20 13:45:28] [INFO ] Deduced a trap composed of 54 places in 311 ms of which 4 ms to minimize.
[2024-05-20 13:45:30] [INFO ] Deduced a trap composed of 61 places in 308 ms of which 3 ms to minimize.
[2024-05-20 13:45:33] [INFO ] Deduced a trap composed of 79 places in 286 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 865 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/1245 variables, and 41 constraints, problems are : Problem set: 0 solved, 865 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/355 constraints, PredecessorRefiner: 0/865 constraints, Known Traps: 4/4 constraints]
After SMT, in 60621ms problems are : Problem set: 0 solved, 865 unsolved
Search for dead transitions found 0 dead transitions in 60633ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62109 ms. Remains : 355/355 places, 890/890 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 12 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-20 13:45:37] [INFO ] Invariant cache hit.
[2024-05-20 13:45:37] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 13:45:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 13:45:37] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 17 ms returned sat
[2024-05-20 13:45:38] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 13:45:38] [INFO ] After 399ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 13:45:38] [INFO ] After 536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 642 ms.
RANDOM walk for 40000 steps (797 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (214 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 397790 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 1
Probabilistic random walk after 397790 steps, saw 277190 distinct states, run finished after 3004 ms. (steps per millisecond=132 ) properties seen :0
// Phase 1: matrix 893 rows 358 cols
[2024-05-20 13:45:41] [INFO ] Computed 37 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 116/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/129 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/142 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/175 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 150/325 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/347 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/358 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 893/1251 variables, 358/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1251 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1251 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1251/1251 variables, and 395 constraints, problems are : Problem set: 0 solved, 1 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 116/117 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/129 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/142 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/175 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 150/325 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/347 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/358 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/358 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 893/1251 variables, 358/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1251 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1251 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1251 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1251/1251 variables, and 396 constraints, problems are : Problem set: 0 solved, 1 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1034ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 70 ms.
Support contains 1 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 893/893 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 358 transition count 891
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 356 transition count 890
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 355 transition count 890
Applied a total of 6 rules in 18 ms. Remains 355 /358 variables (removed 3) and now considering 890/893 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 355/358 places, 890/893 transitions.
RANDOM walk for 40000 steps (775 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (219 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 400817 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 400817 steps, saw 279407 distinct states, run finished after 3004 ms. (steps per millisecond=133 ) properties seen :0
// Phase 1: matrix 890 rows 355 cols
[2024-05-20 13:45:45] [INFO ] Computed 37 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/114 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/126 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/139 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 150/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/344 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/355 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 890/1245 variables, 355/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1245 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1245 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 392 constraints, problems are : Problem set: 0 solved, 1 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/114 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/126 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/139 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/172 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 150/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/344 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/355 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 890/1245 variables, 355/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1245 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1245 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1245 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 393 constraints, problems are : Problem set: 0 solved, 1 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1000ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 890/890 transitions.
Applied a total of 0 rules in 13 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 355/355 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 890/890 transitions.
Applied a total of 0 rules in 13 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-20 13:45:46] [INFO ] Invariant cache hit.
[2024-05-20 13:45:47] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-20 13:45:47] [INFO ] Invariant cache hit.
[2024-05-20 13:45:48] [INFO ] Implicit Places using invariants and state equation in 1207 ms returned []
Implicit Place search using SMT with State Equation took 1704 ms to find 0 implicit places.
[2024-05-20 13:45:48] [INFO ] Redundant transitions in 9 ms returned []
Running 865 sub problems to find dead transitions.
[2024-05-20 13:45:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 3 (OVERLAPS) 1/355 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 865 unsolved
[2024-05-20 13:46:18] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 355/1245 variables, and 38 constraints, problems are : Problem set: 0 solved, 865 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/355 constraints, PredecessorRefiner: 865/865 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 865 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 3 (OVERLAPS) 1/355 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/355 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 865 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 865 unsolved
[2024-05-20 13:46:41] [INFO ] Deduced a trap composed of 66 places in 313 ms of which 4 ms to minimize.
[2024-05-20 13:46:43] [INFO ] Deduced a trap composed of 61 places in 287 ms of which 4 ms to minimize.
[2024-05-20 13:46:46] [INFO ] Deduced a trap composed of 77 places in 310 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 865 unsolved
(s224 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 1)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(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 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 1)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/1245 variables, and 41 constraints, problems are : Problem set: 0 solved, 865 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/355 constraints, PredecessorRefiner: 0/865 constraints, Known Traps: 4/4 constraints]
After SMT, in 60794ms problems are : Problem set: 0 solved, 865 unsolved
Search for dead transitions found 0 dead transitions in 60807ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62541 ms. Remains : 355/355 places, 890/890 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 12 ms. Remains 355 /355 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-20 13:46:49] [INFO ] Invariant cache hit.
[2024-05-20 13:46:49] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 13:46:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-20 13:46:49] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 22 ms returned sat
[2024-05-20 13:46:49] [INFO ] After 417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 13:46:49] [INFO ] After 469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 13:46:49] [INFO ] After 636ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 732 ms.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 12 ms. Remains 358 /358 variables (removed 0) and now considering 893/893 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 893 rows 358 cols
[2024-05-20 13:46:49] [INFO ] Computed 37 invariants in 7 ms
[2024-05-20 13:46:49] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-20 13:46:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 13:46:50] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 17 ms returned sat
[2024-05-20 13:46:50] [INFO ] After 629ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-20 13:46:50] [INFO ] After 819ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-20 13:46:51] [INFO ] After 1088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-20 13:46:51] [INFO ] Flatten gal took : 39 ms
[2024-05-20 13:46:51] [INFO ] Flatten gal took : 38 ms
[2024-05-20 13:46:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7907283096281381829.gal : 7 ms
[2024-05-20 13:46:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3461047281644380940.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/ReachabilityCardinality7907283096281381829.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3461047281644380940.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/ReachabilityCardinality3461047281644380940.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 44
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :44 after 328
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :328 after 8528
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :8528 after 17712
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :17712 after 20070
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :20070 after 20615
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :20615 after 23168
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :23168 after 351317
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :351317 after 3.53136e+06
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :3.53136e+06 after 3.727e+07
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :3.727e+07 after 4.53565e+08
Invariant property smplace_582 does not hold.
Invariant property smplace_581 does not hold.
Invariant property smplace_187 does not hold.
Invariant property smplace_186 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.64209e+09,5.25677,111672,2,19747,22,275423,6,0,2328,299201,0
Total reachable state count : 1642091103

Verifying 4 reachability properties.
Invariant property smplace_186 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_186,6,5.26122,111672,2,417,22,275423,7,0,2331,299201,0
Invariant property smplace_187 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_187,8,5.26411,111672,2,425,22,275423,8,0,2333,299201,0
Invariant property smplace_581 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_581,1868,5.26604,111672,2,1080,22,275423,9,0,2335,299201,0
Invariant property smplace_582 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_582,1868,5.26795,111672,2,1080,22,275423,10,0,2337,299201,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 6616 ms.
[2024-05-20 13:46:56] [INFO ] Flatten gal took : 36 ms
[2024-05-20 13:46:56] [INFO ] Flatten gal took : 36 ms
[2024-05-20 13:46:56] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability956695161487876741.gal : 7 ms
[2024-05-20 13:46:56] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16654401151153082376.prop : 0 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/ReachabilityFireability956695161487876741.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16654401151153082376.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/ReachabilityFireability16654401151153082376.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 44
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :44 after 328
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :328 after 8528
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :8528 after 17712
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :17712 after 20070
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :20070 after 20615
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :20615 after 23168
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :23168 after 348447
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :348447 after 4.22526e+06
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :4.22526e+06 after 4.73137e+07
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :4.73137e+07 after 6.25462e+08
Detected timeout of ITS tools.
[2024-05-20 13:46:59] [INFO ] Flatten gal took : 58 ms
[2024-05-20 13:46:59] [INFO ] Applying decomposition
[2024-05-20 13:46:59] [INFO ] Flatten gal took : 34 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/graph15693693928351663759.txt' '-o' '/tmp/graph15693693928351663759.bin' '-w' '/tmp/graph15693693928351663759.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15693693928351663759.bin' '-l' '-1' '-v' '-w' '/tmp/graph15693693928351663759.weights' '-q' '0' '-e' '0.001'
[2024-05-20 13:46:59] [INFO ] Decomposing Gal with order
[2024-05-20 13:46:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 13:46:59] [INFO ] Removed a total of 1826 redundant transitions.
[2024-05-20 13:46:59] [INFO ] Flatten gal took : 68 ms
[2024-05-20 13:46:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 17 ms.
[2024-05-20 13:47:00] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13593701685183821282.gal : 9 ms
[2024-05-20 13:47:00] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4409555285125547175.prop : 0 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/ReachabilityFireability13593701685183821282.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability4409555285125547175.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 ...308
Loading property file /tmp/ReachabilityFireability4409555285125547175.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 36
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :36 after 88
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :88 after 656
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :59104 after 80848
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :80848 after 191224
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :191224 after 3.62064e+06
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :3.62064e+06 after 1.3741e+07
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :4.00917e+07 after 6.56161e+07
Detected timeout of ITS tools.
[2024-05-20 13:47:03] [INFO ] Flatten gal took : 50 ms
[2024-05-20 13:47:03] [INFO ] Flatten gal took : 48 ms
[2024-05-20 13:47:03] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17932992655658292662.gal : 7 ms
[2024-05-20 13:47:03] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11494290228496955455.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/ReachabilityFireability17932992655658292662.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability11494290228496955455.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 ...330
Loading property file /tmp/ReachabilityFireability11494290228496955455.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 44
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :44 after 328
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :328 after 8528
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :8528 after 17712
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :17712 after 20070
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :20070 after 20615
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :20615 after 23168
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :23168 after 348447
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :348447 after 4.22526e+06
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :4.22526e+06 after 4.73137e+07
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :4.73137e+07 after 6.25462e+08
Invariant property smplace_582 does not hold.
Invariant property smplace_581 does not hold.
Invariant property smplace_187 does not hold.
Invariant property smplace_186 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.64311e+09,5.78385,115212,2,21799,22,287246,6,0,2328,311878,0
Total reachable state count : 1643106378

Verifying 4 reachability properties.
Invariant property smplace_186 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_186,6,5.79045,115212,2,417,22,287246,7,0,2331,311878,0
Invariant property smplace_187 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_187,8,5.7942,115212,2,425,22,287246,8,0,2333,311878,0
Invariant property smplace_581 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_581,1868,5.79649,115212,2,1080,22,287246,9,0,2335,311878,0
Invariant property smplace_582 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_582,1868,5.79891,115212,2,1080,22,287246,10,0,2337,311878,0
Able to resolve query StableMarking after proving 1789 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS COLLATERAL_PROCESSING TOPOLOGICAL USE_NUPN
Total runtime 1461960 ms.

BK_STOP 1716212829079

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="ASLink-PT-04b"
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 ASLink-PT-04b, 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 r013-smll-171620124300043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04b.tgz
mv ASLink-PT-04b 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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;