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.r466-smll-171620124300058.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ASLink-PT-06a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r466-smll-171620124300058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K 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 59K 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:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K 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 597K 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 1717188343153

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ASLink-PT-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:45:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 20:45:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:45:46] [INFO ] Load time of PNML (sax parser for PT used): 577 ms
[2024-05-31 20:45:46] [INFO ] Transformed 1406 places.
[2024-05-31 20:45:46] [INFO ] Transformed 2100 transitions.
[2024-05-31 20:45:46] [INFO ] Found NUPN structural information;
[2024-05-31 20:45:46] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 907 ms.
Structural test allowed to assert that 160 places are NOT stable. Took 75 ms.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
RANDOM walk for 40000 steps (228 resets) in 4561 ms. (8 steps per ms) remains 490/1246 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 490/490 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 490/490 properties
// Phase 1: matrix 2078 rows 1406 cols
[2024-05-31 20:45:49] [INFO ] Computed 270 invariants in 344 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 490/490 constraints. Problems are: Problem set: 0 solved, 490 unsolved
SMT process timed out in 6008ms, After SMT, problems are : Problem set: 0 solved, 490 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 490 out of 1406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 6 places
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 1389 transition count 1990
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 193 place count 1301 transition count 1990
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 193 place count 1301 transition count 1876
Deduced a syphon composed of 114 places in 8 ms
Ensure Unique test removed 41 places
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 462 place count 1146 transition count 1876
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 2 with 1 rules applied. Total rules applied 463 place count 1146 transition count 1875
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 464 place count 1145 transition count 1875
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 466 place count 1143 transition count 1865
Iterating global reduction 4 with 2 rules applied. Total rules applied 468 place count 1143 transition count 1865
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 with 4 rules applied. Total rules applied 472 place count 1142 transition count 1862
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 474 place count 1140 transition count 1862
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 475 place count 1139 transition count 1854
Iterating global reduction 6 with 1 rules applied. Total rules applied 476 place count 1139 transition count 1854
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 477 place count 1138 transition count 1846
Iterating global reduction 6 with 1 rules applied. Total rules applied 478 place count 1138 transition count 1846
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 479 place count 1137 transition count 1838
Iterating global reduction 6 with 1 rules applied. Total rules applied 480 place count 1137 transition count 1838
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 481 place count 1136 transition count 1830
Iterating global reduction 6 with 1 rules applied. Total rules applied 482 place count 1136 transition count 1830
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 483 place count 1135 transition count 1822
Iterating global reduction 6 with 1 rules applied. Total rules applied 484 place count 1135 transition count 1822
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 485 place count 1134 transition count 1814
Iterating global reduction 6 with 1 rules applied. Total rules applied 486 place count 1134 transition count 1814
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 487 place count 1133 transition count 1806
Iterating global reduction 6 with 1 rules applied. Total rules applied 488 place count 1133 transition count 1806
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 489 place count 1132 transition count 1798
Iterating global reduction 6 with 1 rules applied. Total rules applied 490 place count 1132 transition count 1798
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 491 place count 1131 transition count 1790
Iterating global reduction 6 with 1 rules applied. Total rules applied 492 place count 1131 transition count 1790
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 493 place count 1130 transition count 1782
Iterating global reduction 6 with 1 rules applied. Total rules applied 494 place count 1130 transition count 1782
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 495 place count 1129 transition count 1774
Iterating global reduction 6 with 1 rules applied. Total rules applied 496 place count 1129 transition count 1774
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 497 place count 1128 transition count 1766
Iterating global reduction 6 with 1 rules applied. Total rules applied 498 place count 1128 transition count 1766
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 499 place count 1127 transition count 1758
Iterating global reduction 6 with 1 rules applied. Total rules applied 500 place count 1127 transition count 1758
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 501 place count 1126 transition count 1750
Iterating global reduction 6 with 1 rules applied. Total rules applied 502 place count 1126 transition count 1750
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 503 place count 1125 transition count 1742
Iterating global reduction 6 with 1 rules applied. Total rules applied 504 place count 1125 transition count 1742
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 505 place count 1124 transition count 1734
Iterating global reduction 6 with 1 rules applied. Total rules applied 506 place count 1124 transition count 1734
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 5 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 558 place count 1098 transition count 1708
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 562 place count 1098 transition count 1704
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 566 place count 1094 transition count 1704
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 567 place count 1094 transition count 1704
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 568 place count 1093 transition count 1703
Applied a total of 568 rules in 1459 ms. Remains 1093 /1406 variables (removed 313) and now considering 1703/2078 (removed 375) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1483 ms. Remains : 1093/1406 places, 1703/2078 transitions.
RANDOM walk for 3433617 steps (32547 resets) in 120004 ms. (28 steps per ms) remains 379/490 properties
BEST_FIRST walk for 40004 steps (59 resets) in 343 ms. (116 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (58 resets) in 340 ms. (117 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (62 resets) in 462 ms. (86 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (61 resets) in 610 ms. (65 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (60 resets) in 587 ms. (68 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (57 resets) in 275 ms. (144 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (65 resets) in 259 ms. (153 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (63 resets) in 279 ms. (142 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (65 resets) in 258 ms. (154 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (59 resets) in 271 ms. (147 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (66 resets) in 344 ms. (115 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (64 resets) in 258 ms. (154 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (64 resets) in 273 ms. (146 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (61 resets) in 279 ms. (142 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (64 resets) in 266 ms. (149 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (61 resets) in 253 ms. (157 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (58 resets) in 293 ms. (136 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (64 resets) in 379 ms. (105 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (64 resets) in 375 ms. (106 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (60 resets) in 414 ms. (96 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (64 resets) in 399 ms. (100 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (67 resets) in 319 ms. (125 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (64 resets) in 254 ms. (156 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (60 resets) in 276 ms. (144 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (62 resets) in 261 ms. (152 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (61 resets) in 274 ms. (145 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (67 resets) in 262 ms. (152 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (63 resets) in 270 ms. (147 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (59 resets) in 276 ms. (144 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (62 resets) in 269 ms. (148 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (64 resets) in 267 ms. (149 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (61 resets) in 271 ms. (147 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (60 resets) in 268 ms. (148 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40002 steps (57 resets) in 295 ms. (135 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (60 resets) in 282 ms. (141 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (63 resets) in 266 ms. (149 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (62 resets) in 291 ms. (136 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (62 resets) in 267 ms. (149 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (62 resets) in 276 ms. (144 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (64 resets) in 263 ms. (151 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (66 resets) in 254 ms. (156 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (63 resets) in 282 ms. (141 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (60 resets) in 273 ms. (145 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (64 resets) in 264 ms. (150 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (62 resets) in 266 ms. (149 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (66 resets) in 263 ms. (151 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40003 steps (62 resets) in 263 ms. (151 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (61 resets) in 287 ms. (138 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40001 steps (66 resets) in 255 ms. (156 steps per ms) remains 379/379 properties
BEST_FIRST walk for 40004 steps (66 resets) in 258 ms. (154 steps per ms) remains 379/379 properties
// Phase 1: matrix 1703 rows 1093 cols
[2024-05-31 20:46:30] [INFO ] Computed 211 invariants in 132 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/379 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 41/420 variables, 45/63 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (OVERLAPS) 1/421 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (OVERLAPS) 292/713 variables, 49/118 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 713/2796 variables, and 118 constraints, problems are : Problem set: 0 solved, 379 unsolved in 45029 ms.
Refiners :[Positive P Invariants (semi-flows): 46/72 constraints, Generalized P Invariants (flows): 72/139 constraints, State Equation: 0/1093 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/379 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 41/420 variables, 45/63 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 5/68 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (OVERLAPS) 1/421 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (OVERLAPS) 292/713 variables, 49/118 constraints. Problems are: Problem set: 0 solved, 379 unsolved
[2024-05-31 20:47:37] [INFO ] Deduced a trap composed of 23 places in 635 ms of which 77 ms to minimize.
[2024-05-31 20:47:37] [INFO ] Deduced a trap composed of 23 places in 389 ms of which 6 ms to minimize.
[2024-05-31 20:47:37] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 3 ms to minimize.
[2024-05-31 20:47:40] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 4 ms to minimize.
[2024-05-31 20:47:44] [INFO ] Deduced a trap composed of 27 places in 349 ms of which 4 ms to minimize.
[2024-05-31 20:47:46] [INFO ] Deduced a trap composed of 22 places in 389 ms of which 5 ms to minimize.
[2024-05-31 20:47:48] [INFO ] Deduced a trap composed of 38 places in 438 ms of which 9 ms to minimize.
[2024-05-31 20:47:51] [INFO ] Deduced a trap composed of 42 places in 458 ms of which 5 ms to minimize.
[2024-05-31 20:47:54] [INFO ] Deduced a trap composed of 38 places in 601 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/713 variables, 9/127 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 713/2796 variables, and 127 constraints, problems are : Problem set: 0 solved, 379 unsolved in 45025 ms.
Refiners :[Positive P Invariants (semi-flows): 46/72 constraints, Generalized P Invariants (flows): 72/139 constraints, State Equation: 0/1093 constraints, PredecessorRefiner: 0/379 constraints, Known Traps: 9/9 constraints]
After SMT, in 90656ms problems are : Problem set: 0 solved, 379 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 379 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 1703/1703 transitions.
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1090 transition count 1699
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 1084 transition count 1699
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 13 place count 1084 transition count 1694
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1079 transition count 1694
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 1078 transition count 1694
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 1077 transition count 1688
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 1077 transition count 1688
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 27 place count 1076 transition count 1688
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 4 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 53 place count 1063 transition count 1675
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 55 place count 1061 transition count 1673
Iterating global reduction 4 with 2 rules applied. Total rules applied 57 place count 1061 transition count 1673
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 60 place count 1061 transition count 1670
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 64 place count 1058 transition count 1669
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 1058 transition count 1669
Applied a total of 65 rules in 335 ms. Remains 1058 /1093 variables (removed 35) and now considering 1669/1703 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 335 ms. Remains : 1058/1093 places, 1669/1703 transitions.
RANDOM walk for 3734210 steps (39979 resets) in 120009 ms. (31 steps per ms) remains 329/379 properties
BEST_FIRST walk for 40004 steps (68 resets) in 239 ms. (166 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (71 resets) in 231 ms. (172 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (68 resets) in 225 ms. (177 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (69 resets) in 280 ms. (142 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (73 resets) in 233 ms. (170 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (68 resets) in 277 ms. (143 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (69 resets) in 266 ms. (149 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (70 resets) in 289 ms. (137 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (68 resets) in 297 ms. (134 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (68 resets) in 286 ms. (139 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (66 resets) in 375 ms. (106 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (63 resets) in 577 ms. (69 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (71 resets) in 411 ms. (97 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (69 resets) in 405 ms. (98 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (68 resets) in 337 ms. (118 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (69 resets) in 316 ms. (126 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (67 resets) in 348 ms. (114 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40002 steps (65 resets) in 421 ms. (94 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (68 resets) in 459 ms. (86 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40002 steps (67 resets) in 394 ms. (101 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (63 resets) in 426 ms. (93 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (67 resets) in 402 ms. (99 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (70 resets) in 417 ms. (95 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (67 resets) in 390 ms. (102 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (71 resets) in 394 ms. (101 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (67 resets) in 397 ms. (100 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (71 resets) in 330 ms. (120 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (63 resets) in 457 ms. (87 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (65 resets) in 486 ms. (82 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (68 resets) in 671 ms. (59 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (70 resets) in 501 ms. (79 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (71 resets) in 509 ms. (78 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (68 resets) in 507 ms. (78 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40002 steps (70 resets) in 447 ms. (89 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (66 resets) in 435 ms. (91 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (68 resets) in 454 ms. (87 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (70 resets) in 352 ms. (113 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (64 resets) in 387 ms. (103 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (68 resets) in 501 ms. (79 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40002 steps (71 resets) in 498 ms. (80 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (69 resets) in 477 ms. (83 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40002 steps (66 resets) in 538 ms. (74 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (65 resets) in 477 ms. (83 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40002 steps (66 resets) in 479 ms. (83 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (66 resets) in 526 ms. (75 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (71 resets) in 409 ms. (97 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (64 resets) in 494 ms. (80 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (67 resets) in 439 ms. (90 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (73 resets) in 395 ms. (101 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (70 resets) in 409 ms. (97 steps per ms) remains 329/329 properties
// Phase 1: matrix 1669 rows 1058 cols
[2024-05-31 20:48:38] [INFO ] Computed 204 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/329 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 40/369 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (OVERLAPS) 1/370 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (OVERLAPS) 285/655 variables, 51/114 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 9 (OVERLAPS) 9/664 variables, 9/123 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/664 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 11 (OVERLAPS) 149/813 variables, 27/150 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/813 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 13 (OVERLAPS) 9/822 variables, 6/156 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/822 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 15 (OVERLAPS) 64/886 variables, 11/167 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/886 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 17 (OVERLAPS) 5/891 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 891/2727 variables, and 170 constraints, problems are : Problem set: 0 solved, 329 unsolved in 75016 ms.
Refiners :[Positive P Invariants (semi-flows): 62/68 constraints, Generalized P Invariants (flows): 108/136 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 329 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/329 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 2 (OVERLAPS) 40/369 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 4/62 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 5 (OVERLAPS) 1/370 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 7 (OVERLAPS) 285/655 variables, 51/114 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-05-31 20:50:03] [INFO ] Deduced a trap composed of 25 places in 382 ms of which 5 ms to minimize.
[2024-05-31 20:50:04] [INFO ] Deduced a trap composed of 28 places in 294 ms of which 4 ms to minimize.
[2024-05-31 20:50:04] [INFO ] Deduced a trap composed of 32 places in 132 ms of which 2 ms to minimize.
[2024-05-31 20:50:06] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 3 ms to minimize.
[2024-05-31 20:50:07] [INFO ] Deduced a trap composed of 54 places in 178 ms of which 3 ms to minimize.
[2024-05-31 20:50:09] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 3 ms to minimize.
[2024-05-31 20:50:11] [INFO ] Deduced a trap composed of 27 places in 246 ms of which 3 ms to minimize.
[2024-05-31 20:50:13] [INFO ] Deduced a trap composed of 26 places in 299 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 8/122 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/655 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 10 (OVERLAPS) 9/664 variables, 9/131 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/664 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 12 (OVERLAPS) 149/813 variables, 27/158 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/813 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 14 (OVERLAPS) 9/822 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/822 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 16 (OVERLAPS) 64/886 variables, 11/175 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 886/2727 variables, and 175 constraints, problems are : Problem set: 0 solved, 329 unsolved in 75020 ms.
Refiners :[Positive P Invariants (semi-flows): 59/68 constraints, Generalized P Invariants (flows): 108/136 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 0/329 constraints, Known Traps: 8/8 constraints]
After SMT, in 150274ms problems are : Problem set: 0 solved, 329 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 329 out of 1058 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1058/1058 places, 1669/1669 transitions.
Ensure Unique test removed 2 places
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 4 rules applied. Total rules applied 4 place count 1056 transition count 1667
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 1053 transition count 1667
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 1053 transition count 1664
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 1050 transition count 1664
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 1049 transition count 1664
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 1048 transition count 1658
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 1048 transition count 1658
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 1046 transition count 1656
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 1046 transition count 1655
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 1045 transition count 1655
Applied a total of 22 rules in 235 ms. Remains 1045 /1058 variables (removed 13) and now considering 1655/1669 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 1045/1058 places, 1655/1669 transitions.
RANDOM walk for 1713721 steps (18797 resets) in 120011 ms. (14 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (70 resets) in 537 ms. (74 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40002 steps (69 resets) in 461 ms. (86 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (71 resets) in 433 ms. (92 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40002 steps (67 resets) in 539 ms. (74 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40002 steps (71 resets) in 534 ms. (74 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (70 resets) in 522 ms. (76 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (70 resets) in 478 ms. (83 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (69 resets) in 459 ms. (86 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (67 resets) in 546 ms. (73 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (69 resets) in 497 ms. (80 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (67 resets) in 487 ms. (81 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (73 resets) in 605 ms. (66 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (70 resets) in 505 ms. (79 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (64 resets) in 612 ms. (65 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (69 resets) in 433 ms. (92 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (70 resets) in 537 ms. (74 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (71 resets) in 593 ms. (67 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (68 resets) in 553 ms. (72 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (71 resets) in 489 ms. (81 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (74 resets) in 441 ms. (90 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (68 resets) in 516 ms. (77 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (72 resets) in 509 ms. (78 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40002 steps (67 resets) in 548 ms. (72 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (69 resets) in 458 ms. (87 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40001 steps (65 resets) in 477 ms. (83 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (71 resets) in 515 ms. (77 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (70 resets) in 637 ms. (62 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (69 resets) in 570 ms. (70 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (73 resets) in 518 ms. (77 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (72 resets) in 536 ms. (74 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (74 resets) in 455 ms. (87 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (70 resets) in 460 ms. (86 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (65 resets) in 509 ms. (78 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (71 resets) in 598 ms. (66 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (73 resets) in 669 ms. (59 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (68 resets) in 676 ms. (59 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (68 resets) in 566 ms. (70 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (69 resets) in 609 ms. (65 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (70 resets) in 531 ms. (75 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (71 resets) in 543 ms. (73 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (72 resets) in 484 ms. (82 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (72 resets) in 459 ms. (86 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (70 resets) in 462 ms. (86 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (65 resets) in 544 ms. (73 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (68 resets) in 503 ms. (79 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (72 resets) in 555 ms. (71 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (74 resets) in 405 ms. (98 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40002 steps (73 resets) in 490 ms. (81 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40003 steps (69 resets) in 521 ms. (76 steps per ms) remains 329/329 properties
BEST_FIRST walk for 40004 steps (71 resets) in 438 ms. (91 steps per ms) remains 329/329 properties
Interrupted probabilistic random walk after 2549834 steps, run timeout after 114001 ms. (steps per millisecond=22 ) properties seen :16 out of 329
Probabilistic random walk after 2549834 steps, saw 750681 distinct states, run finished after 114015 ms. (steps per millisecond=22 ) properties seen :16
// Phase 1: matrix 1655 rows 1045 cols
[2024-05-31 20:53:41] [INFO ] Computed 200 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 36/349 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 241/590 variables, 43/102 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 23/613 variables, 10/112 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/613 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 164/777 variables, 38/150 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/777 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 11 (OVERLAPS) 18/795 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/795 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 13 (OVERLAPS) 105/900 variables, 11/165 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/900 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 15 (OVERLAPS) 54/954 variables, 6/171 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/954 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 17 (OVERLAPS) 6/960 variables, 3/174 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/2700 variables, and 174 constraints, problems are : Problem set: 0 solved, 313 unsolved in 90017 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 111/137 constraints, State Equation: 0/1045 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 36/349 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 241/590 variables, 43/102 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-05-31 20:55:17] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 4 ms to minimize.
[2024-05-31 20:55:17] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 3 ms to minimize.
[2024-05-31 20:55:20] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 2 ms to minimize.
[2024-05-31 20:55:22] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 3 ms to minimize.
[2024-05-31 20:55:22] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 3 ms to minimize.
[2024-05-31 20:55:23] [INFO ] Deduced a trap composed of 66 places in 234 ms of which 3 ms to minimize.
[2024-05-31 20:55:25] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 7/109 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-05-31 20:55:26] [INFO ] Deduced a trap composed of 26 places in 276 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/590 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 23/613 variables, 10/120 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/613 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 11 (OVERLAPS) 164/777 variables, 38/158 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/777 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 13 (OVERLAPS) 18/795 variables, 4/162 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/795 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 15 (OVERLAPS) 105/900 variables, 11/173 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/900 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 17 (OVERLAPS) 54/954 variables, 6/179 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 954/2700 variables, and 179 constraints, problems are : Problem set: 0 solved, 313 unsolved in 90030 ms.
Refiners :[Positive P Invariants (semi-flows): 60/63 constraints, Generalized P Invariants (flows): 111/137 constraints, State Equation: 0/1045 constraints, PredecessorRefiner: 0/313 constraints, Known Traps: 8/8 constraints]
After SMT, in 180279ms problems are : Problem set: 0 solved, 313 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 313 out of 1045 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1045/1045 places, 1655/1655 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1045 transition count 1652
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1042 transition count 1652
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1042 transition count 1649
Deduced a syphon composed of 3 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 1037 transition count 1649
Applied a total of 14 rules in 83 ms. Remains 1037 /1045 variables (removed 8) and now considering 1649/1655 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 1037/1045 places, 1649/1655 transitions.
RANDOM walk for 4000000 steps (44368 resets) in 113092 ms. (35 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (73 resets) in 348 ms. (114 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (70 resets) in 508 ms. (78 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (73 resets) in 499 ms. (80 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (67 resets) in 575 ms. (69 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (69 resets) in 451 ms. (88 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40002 steps (68 resets) in 509 ms. (78 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (69 resets) in 396 ms. (100 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (71 resets) in 479 ms. (83 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (68 resets) in 444 ms. (89 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (71 resets) in 551 ms. (72 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (74 resets) in 585 ms. (68 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (69 resets) in 614 ms. (65 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (68 resets) in 627 ms. (63 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (69 resets) in 538 ms. (74 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (72 resets) in 529 ms. (75 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (72 resets) in 414 ms. (96 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (73 resets) in 569 ms. (70 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (72 resets) in 510 ms. (78 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (72 resets) in 495 ms. (80 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (72 resets) in 603 ms. (66 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (69 resets) in 530 ms. (75 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (71 resets) in 508 ms. (78 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (70 resets) in 526 ms. (75 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (70 resets) in 513 ms. (77 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (70 resets) in 470 ms. (84 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (75 resets) in 462 ms. (86 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (70 resets) in 465 ms. (85 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (69 resets) in 404 ms. (98 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40002 steps (68 resets) in 574 ms. (69 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (71 resets) in 612 ms. (65 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40002 steps (72 resets) in 524 ms. (76 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (71 resets) in 453 ms. (88 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (73 resets) in 576 ms. (69 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (72 resets) in 458 ms. (87 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (74 resets) in 545 ms. (73 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40002 steps (66 resets) in 536 ms. (74 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40002 steps (69 resets) in 551 ms. (72 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40002 steps (71 resets) in 653 ms. (61 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (73 resets) in 624 ms. (64 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (71 resets) in 373 ms. (106 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (71 resets) in 455 ms. (87 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (70 resets) in 479 ms. (83 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (76 resets) in 710 ms. (56 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (71 resets) in 663 ms. (60 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (73 resets) in 589 ms. (67 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (72 resets) in 554 ms. (72 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (65 resets) in 493 ms. (80 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40004 steps (71 resets) in 534 ms. (74 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40002 steps (68 resets) in 677 ms. (59 steps per ms) remains 313/313 properties
BEST_FIRST walk for 40003 steps (71 resets) in 572 ms. (69 steps per ms) remains 313/313 properties
Interrupted probabilistic random walk after 2403549 steps, run timeout after 111001 ms. (steps per millisecond=21 ) properties seen :0 out of 313
Probabilistic random walk after 2403549 steps, saw 760947 distinct states, run finished after 111003 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 1649 rows 1037 cols
[2024-05-31 20:59:10] [INFO ] Computed 198 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 36/349 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 241/590 variables, 43/102 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 15/605 variables, 8/110 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 164/769 variables, 38/148 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/769 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 11 (OVERLAPS) 18/787 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/787 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 13 (OVERLAPS) 105/892 variables, 11/163 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/892 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 15 (OVERLAPS) 54/946 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/946 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 17 (OVERLAPS) 6/952 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/952 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 19 (OVERLAPS) 84/1036 variables, 25/197 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1036 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 21 (OVERLAPS) 1/1037 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1037/2686 variables, and 198 constraints, problems are : Problem set: 0 solved, 313 unsolved in 105023 ms.
Refiners :[Positive P Invariants (semi-flows): 61/61 constraints, Generalized P Invariants (flows): 137/137 constraints, State Equation: 0/1037 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 36/349 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/349 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 241/590 variables, 43/102 constraints. Problems are: Problem set: 0 solved, 313 unsolved
[2024-05-31 21:01:04] [INFO ] Deduced a trap composed of 24 places in 537 ms of which 7 ms to minimize.
[2024-05-31 21:01:05] [INFO ] Deduced a trap composed of 33 places in 418 ms of which 5 ms to minimize.
[2024-05-31 21:01:06] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 3 ms to minimize.
[2024-05-31 21:01:08] [INFO ] Deduced a trap composed of 37 places in 234 ms of which 3 ms to minimize.
[2024-05-31 21:01:10] [INFO ] Deduced a trap composed of 54 places in 332 ms of which 4 ms to minimize.
[2024-05-31 21:01:12] [INFO ] Deduced a trap composed of 38 places in 278 ms of which 4 ms to minimize.
[2024-05-31 21:01:15] [INFO ] Deduced a trap composed of 27 places in 428 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 7/109 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 15/605 variables, 8/117 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 10 (OVERLAPS) 164/769 variables, 38/155 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/769 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 12 (OVERLAPS) 18/787 variables, 4/159 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/787 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 14 (OVERLAPS) 105/892 variables, 11/170 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/892 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 16 (OVERLAPS) 54/946 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/2686 variables, and 176 constraints, problems are : Problem set: 0 solved, 313 unsolved in 105019 ms.
Refiners :[Positive P Invariants (semi-flows): 58/61 constraints, Generalized P Invariants (flows): 111/137 constraints, State Equation: 0/1037 constraints, PredecessorRefiner: 0/313 constraints, Known Traps: 7/7 constraints]
After SMT, in 210189ms problems are : Problem set: 0 solved, 313 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 313 out of 1037 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1037/1037 places, 1649/1649 transitions.
Applied a total of 0 rules in 64 ms. Remains 1037 /1037 variables (removed 0) and now considering 1649/1649 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1037/1037 places, 1649/1649 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1037/1037 places, 1649/1649 transitions.
Applied a total of 0 rules in 47 ms. Remains 1037 /1037 variables (removed 0) and now considering 1649/1649 (removed 0) transitions.
[2024-05-31 21:02:40] [INFO ] Invariant cache hit.
[2024-05-31 21:02:42] [INFO ] Implicit Places using invariants in 1861 ms returned [20, 53, 71, 163, 180, 185, 186, 206, 224, 316, 330, 334, 335, 355, 373, 465, 479, 483, 484, 504, 522, 615, 629, 633, 634, 635, 653, 671, 747, 748, 760, 761, 762, 763, 781, 799, 818, 868, 869, 872, 883, 884, 885, 903, 905, 908, 926, 927, 928, 929, 941, 947, 953, 959, 965, 971, 977, 983, 989, 995, 1001]
Discarding 61 places :
Implicit Place search using SMT only with invariants took 1892 ms to find 61 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 976/1037 places, 1649/1649 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 976 transition count 1566
Reduce places removed 83 places and 0 transitions.
Iterating post reduction 1 with 83 rules applied. Total rules applied 166 place count 893 transition count 1566
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 166 place count 893 transition count 1535
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 229 place count 861 transition count 1535
Discarding 5 places :
Implicit places reduction removed 5 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 13 rules applied. Total rules applied 242 place count 856 transition count 1527
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 250 place count 848 transition count 1527
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 265 place count 833 transition count 1512
Iterating global reduction 4 with 15 rules applied. Total rules applied 280 place count 833 transition count 1512
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 283 place count 833 transition count 1509
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 283 place count 833 transition count 1508
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 285 place count 832 transition count 1508
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 288 place count 829 transition count 1505
Iterating global reduction 5 with 3 rules applied. Total rules applied 291 place count 829 transition count 1505
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 292 place count 828 transition count 1504
Iterating global reduction 5 with 1 rules applied. Total rules applied 293 place count 828 transition count 1504
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 294 place count 827 transition count 1503
Iterating global reduction 5 with 1 rules applied. Total rules applied 295 place count 827 transition count 1503
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 383 place count 783 transition count 1459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 384 place count 783 transition count 1458
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 385 place count 783 transition count 1457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 386 place count 782 transition count 1457
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 7 with 15 rules applied. Total rules applied 401 place count 782 transition count 1442
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 417 place count 766 transition count 1442
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 418 place count 766 transition count 1441
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 434 place count 766 transition count 1441
Applied a total of 434 rules in 392 ms. Remains 766 /976 variables (removed 210) and now considering 1441/1649 (removed 208) transitions.
// Phase 1: matrix 1441 rows 766 cols
[2024-05-31 21:02:42] [INFO ] Computed 130 invariants in 27 ms
[2024-05-31 21:02:43] [INFO ] Implicit Places using invariants in 1037 ms returned [122, 128, 131, 133, 134, 155, 156, 251, 257, 260, 262, 263, 281, 282, 376, 382, 385, 387, 388, 406, 407, 502, 508, 511, 513, 514, 532, 533, 607, 613, 616, 618, 624, 625, 692, 698, 701, 703]
[2024-05-31 21:02:43] [INFO ] Actually due to overlaps returned [155, 281, 406, 532, 624, 282, 407, 533, 625, 156, 122, 128, 133, 251, 257, 262, 376, 382, 387, 508, 513, 607, 613, 618, 692, 698, 703, 134, 263, 388, 502, 514]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 1041 ms to find 32 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 734/1037 places, 1441/1649 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 712 transition count 1419
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 712 transition count 1419
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 707 transition count 1414
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 707 transition count 1414
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 700 transition count 1407
Free-agglomeration rule applied 22 times.
Iterating global reduction 0 with 22 rules applied. Total rules applied 90 place count 700 transition count 1385
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 112 place count 678 transition count 1385
Applied a total of 112 rules in 115 ms. Remains 678 /734 variables (removed 56) and now considering 1385/1441 (removed 56) transitions.
// Phase 1: matrix 1385 rows 678 cols
[2024-05-31 21:02:43] [INFO ] Computed 98 invariants in 28 ms
[2024-05-31 21:02:44] [INFO ] Implicit Places using invariants in 757 ms returned []
[2024-05-31 21:02:44] [INFO ] Invariant cache hit.
[2024-05-31 21:02:46] [INFO ] Implicit Places using invariants and state equation in 2045 ms returned []
Implicit Place search using SMT with State Equation took 2807 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 678/1037 places, 1385/1649 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6295 ms. Remains : 678/1037 places, 1385/1649 transitions.
RANDOM walk for 4000000 steps (66490 resets) in 107072 ms. (37 steps per ms) remains 309/313 properties
BEST_FIRST walk for 40004 steps (136 resets) in 408 ms. (97 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (156 resets) in 485 ms. (82 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (133 resets) in 535 ms. (74 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40001 steps (130 resets) in 601 ms. (66 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (136 resets) in 448 ms. (89 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (147 resets) in 537 ms. (74 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (138 resets) in 460 ms. (86 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (137 resets) in 452 ms. (88 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (133 resets) in 605 ms. (66 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (135 resets) in 471 ms. (84 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (144 resets) in 494 ms. (80 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (141 resets) in 491 ms. (81 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (136 resets) in 478 ms. (83 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (138 resets) in 598 ms. (66 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (143 resets) in 489 ms. (81 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (131 resets) in 620 ms. (64 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (141 resets) in 540 ms. (73 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (141 resets) in 501 ms. (79 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (133 resets) in 514 ms. (77 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (137 resets) in 520 ms. (76 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (142 resets) in 561 ms. (71 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40002 steps (137 resets) in 615 ms. (64 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (137 resets) in 598 ms. (66 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (144 resets) in 629 ms. (63 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (136 resets) in 439 ms. (90 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (137 resets) in 526 ms. (75 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (127 resets) in 510 ms. (78 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (133 resets) in 579 ms. (68 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (133 resets) in 625 ms. (63 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (133 resets) in 487 ms. (81 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (140 resets) in 498 ms. (80 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40002 steps (138 resets) in 498 ms. (80 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (135 resets) in 494 ms. (80 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (132 resets) in 517 ms. (77 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (142 resets) in 519 ms. (76 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (135 resets) in 577 ms. (69 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (137 resets) in 580 ms. (68 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (141 resets) in 432 ms. (92 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (133 resets) in 482 ms. (82 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40002 steps (139 resets) in 448 ms. (89 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (143 resets) in 615 ms. (64 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (140 resets) in 526 ms. (75 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (138 resets) in 603 ms. (66 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40001 steps (139 resets) in 458 ms. (87 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (147 resets) in 453 ms. (88 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (139 resets) in 582 ms. (68 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (127 resets) in 612 ms. (65 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40002 steps (139 resets) in 546 ms. (73 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40004 steps (135 resets) in 479 ms. (83 steps per ms) remains 309/309 properties
BEST_FIRST walk for 40003 steps (141 resets) in 429 ms. (93 steps per ms) remains 309/309 properties
Interrupted probabilistic random walk after 1786992 steps, run timeout after 108002 ms. (steps per millisecond=16 ) properties seen :72 out of 309
Probabilistic random walk after 1786992 steps, saw 1196874 distinct states, run finished after 108002 ms. (steps per millisecond=16 ) properties seen :72
[2024-05-31 21:05:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 10/247 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 86/333 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 2/335 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (OVERLAPS) 102/437 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/437 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 11 (OVERLAPS) 17/454 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/454 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 13 (OVERLAPS) 98/552 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 15 (OVERLAPS) 51/603 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/603 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 17 (OVERLAPS) 75/678 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/678 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 19 (OVERLAPS) 1385/2063 variables, 678/776 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2063 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 21 (OVERLAPS) 0/2063 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2063/2063 variables, and 776 constraints, problems are : Problem set: 0 solved, 237 unsolved in 97049 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 678/678 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 10/247 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-31 21:06:50] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 2 ms to minimize.
[2024-05-31 21:06:51] [INFO ] Deduced a trap composed of 27 places in 150 ms of which 4 ms to minimize.
[2024-05-31 21:06:52] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-31 21:06:53] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (OVERLAPS) 86/333 variables, 18/55 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-31 21:07:01] [INFO ] Deduced a trap composed of 42 places in 329 ms of which 4 ms to minimize.
[2024-05-31 21:07:02] [INFO ] Deduced a trap composed of 25 places in 312 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (OVERLAPS) 2/335 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/335 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 11 (OVERLAPS) 102/437 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/437 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 13 (OVERLAPS) 17/454 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/454 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 15 (OVERLAPS) 98/552 variables, 12/86 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 17 (OVERLAPS) 51/603 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/603 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 19 (OVERLAPS) 75/678 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/678 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 21 (OVERLAPS) 1385/2063 variables, 678/782 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2063 variables, 237/1019 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2063/2063 variables, and 1019 constraints, problems are : Problem set: 0 solved, 237 unsolved in 120026 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 75/75 constraints, State Equation: 678/678 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 6/6 constraints]
After SMT, in 217174ms problems are : Problem set: 0 solved, 237 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 237 out of 678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 1385/1385 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 674 transition count 1376
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 664 transition count 1376
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 23 place count 664 transition count 1368
Deduced a syphon composed of 8 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 41 place count 654 transition count 1368
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 with 3 rules applied. Total rules applied 44 place count 653 transition count 1366
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 651 transition count 1366
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 46 place count 651 transition count 1365
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 48 place count 650 transition count 1365
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 52 place count 646 transition count 1356
Iterating global reduction 4 with 4 rules applied. Total rules applied 56 place count 646 transition count 1356
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 58 place count 646 transition count 1354
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 59 place count 645 transition count 1353
Iterating global reduction 5 with 1 rules applied. Total rules applied 60 place count 645 transition count 1353
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 64 place count 643 transition count 1351
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 65 place count 642 transition count 1350
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 642 transition count 1350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 67 place count 642 transition count 1349
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 68 place count 642 transition count 1349
Applied a total of 68 rules in 169 ms. Remains 642 /678 variables (removed 36) and now considering 1349/1385 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 642/678 places, 1349/1385 transitions.
RANDOM walk for 4000000 steps (68672 resets) in 83918 ms. (47 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (151 resets) in 530 ms. (75 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (142 resets) in 640 ms. (62 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (148 resets) in 576 ms. (69 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (151 resets) in 499 ms. (80 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (146 resets) in 533 ms. (74 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (148 resets) in 505 ms. (79 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (137 resets) in 575 ms. (69 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (145 resets) in 528 ms. (75 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (149 resets) in 478 ms. (83 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (140 resets) in 567 ms. (70 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (144 resets) in 531 ms. (75 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (152 resets) in 489 ms. (81 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (146 resets) in 545 ms. (73 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (137 resets) in 575 ms. (69 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (141 resets) in 546 ms. (73 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (141 resets) in 527 ms. (75 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (145 resets) in 551 ms. (72 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (141 resets) in 664 ms. (60 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (132 resets) in 582 ms. (68 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (145 resets) in 542 ms. (73 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (144 resets) in 553 ms. (72 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (148 resets) in 522 ms. (76 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (144 resets) in 509 ms. (78 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (147 resets) in 538 ms. (74 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (142 resets) in 563 ms. (70 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (142 resets) in 619 ms. (64 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (144 resets) in 522 ms. (76 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (147 resets) in 550 ms. (72 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (139 resets) in 585 ms. (68 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (147 resets) in 513 ms. (77 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (156 resets) in 527 ms. (75 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (153 resets) in 468 ms. (85 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (139 resets) in 575 ms. (69 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (145 resets) in 538 ms. (74 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (145 resets) in 506 ms. (78 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (144 resets) in 561 ms. (71 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (148 resets) in 465 ms. (85 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (156 resets) in 484 ms. (82 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40001 steps (142 resets) in 559 ms. (71 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (142 resets) in 517 ms. (77 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (142 resets) in 559 ms. (71 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (153 resets) in 515 ms. (77 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (149 resets) in 619 ms. (64 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (148 resets) in 587 ms. (68 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (146 resets) in 537 ms. (74 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (145 resets) in 533 ms. (74 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (147 resets) in 553 ms. (72 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (144 resets) in 513 ms. (77 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (138 resets) in 521 ms. (76 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (147 resets) in 472 ms. (84 steps per ms) remains 237/237 properties
Interrupted probabilistic random walk after 1179625 steps, run timeout after 87001 ms. (steps per millisecond=13 ) properties seen :0 out of 237
Probabilistic random walk after 1179625 steps, saw 762636 distinct states, run finished after 87001 ms. (steps per millisecond=13 ) properties seen :0
// Phase 1: matrix 1349 rows 642 cols
[2024-05-31 21:10:44] [INFO ] Computed 90 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 10/247 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 88/335 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 2/337 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (OVERLAPS) 101/438 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 11 (OVERLAPS) 14/452 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 13 (OVERLAPS) 3/455 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/455 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 15 (OVERLAPS) 13/468 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/468 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 17 (OVERLAPS) 33/501 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/501 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 19 (OVERLAPS) 107/608 variables, 13/85 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 21 (OVERLAPS) 18/626 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/626 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 23 (OVERLAPS) 16/642 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/642 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 25 (OVERLAPS) 1349/1991 variables, 642/732 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1991 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 27 (OVERLAPS) 0/1991 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1991/1991 variables, and 732 constraints, problems are : Problem set: 0 solved, 237 unsolved in 109299 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 10/247 variables, 12/31 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-31 21:12:36] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 2 ms to minimize.
[2024-05-31 21:12:37] [INFO ] Deduced a trap composed of 27 places in 144 ms of which 7 ms to minimize.
[2024-05-31 21:12:38] [INFO ] Deduced a trap composed of 44 places in 206 ms of which 3 ms to minimize.
[2024-05-31 21:12:38] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/247 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-31 21:12:42] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/247 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 7 (OVERLAPS) 88/335 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 9 (OVERLAPS) 2/337 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 11 (OVERLAPS) 101/438 variables, 13/71 constraints. Problems are: Problem set: 0 solved, 237 unsolved
[2024-05-31 21:12:50] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 14 (OVERLAPS) 14/452 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/452 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 16 (OVERLAPS) 3/455 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/455 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 18 (OVERLAPS) 13/468 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/468 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 20 (OVERLAPS) 33/501 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/501 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 22 (OVERLAPS) 107/608 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/608 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 24 (OVERLAPS) 18/626 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/626 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 26 (OVERLAPS) 16/642 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/642 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 28 (OVERLAPS) 1349/1991 variables, 642/738 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1991 variables, 237/975 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1991/1991 variables, and 975 constraints, problems are : Problem set: 0 solved, 237 unsolved in 135025 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 642/642 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 6/6 constraints]
After SMT, in 244442ms problems are : Problem set: 0 solved, 237 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 237 out of 642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 642/642 places, 1349/1349 transitions.
Applied a total of 0 rules in 21 ms. Remains 642 /642 variables (removed 0) and now considering 1349/1349 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 642/642 places, 1349/1349 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 642/642 places, 1349/1349 transitions.
Applied a total of 0 rules in 14 ms. Remains 642 /642 variables (removed 0) and now considering 1349/1349 (removed 0) transitions.
[2024-05-31 21:14:48] [INFO ] Invariant cache hit.
[2024-05-31 21:14:49] [INFO ] Implicit Places using invariants in 821 ms returned [364, 417, 438, 494]
[2024-05-31 21:14:49] [INFO ] Actually due to overlaps returned [438, 364, 494]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 823 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 639/642 places, 1349/1349 transitions.
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 0 with 5 rules applied. Total rules applied 5 place count 639 transition count 1344
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 634 transition count 1344
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 633 transition count 1343
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 633 transition count 1342
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 632 transition count 1342
Applied a total of 14 rules in 58 ms. Remains 632 /639 variables (removed 7) and now considering 1342/1349 (removed 7) transitions.
// Phase 1: matrix 1342 rows 632 cols
[2024-05-31 21:14:49] [INFO ] Computed 87 invariants in 13 ms
[2024-05-31 21:14:50] [INFO ] Implicit Places using invariants in 786 ms returned [415]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 789 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 631/642 places, 1342/1349 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 630 transition count 1341
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 630 transition count 1340
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 629 transition count 1340
Applied a total of 4 rules in 63 ms. Remains 629 /631 variables (removed 2) and now considering 1340/1342 (removed 2) transitions.
// Phase 1: matrix 1340 rows 629 cols
[2024-05-31 21:14:50] [INFO ] Computed 86 invariants in 21 ms
[2024-05-31 21:14:51] [INFO ] Implicit Places using invariants in 925 ms returned []
[2024-05-31 21:14:51] [INFO ] Invariant cache hit.
[2024-05-31 21:14:53] [INFO ] Implicit Places using invariants and state equation in 1993 ms returned []
Implicit Place search using SMT with State Equation took 2923 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 629/642 places, 1340/1349 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4670 ms. Remains : 629/642 places, 1340/1349 transitions.
RANDOM walk for 4000000 steps (68586 resets) in 82911 ms. (48 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (148 resets) in 622 ms. (64 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (146 resets) in 695 ms. (57 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (146 resets) in 726 ms. (55 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (150 resets) in 567 ms. (70 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (145 resets) in 454 ms. (87 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (150 resets) in 493 ms. (80 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (150 resets) in 482 ms. (82 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (141 resets) in 536 ms. (74 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (148 resets) in 529 ms. (75 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (144 resets) in 449 ms. (88 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (139 resets) in 586 ms. (68 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40001 steps (147 resets) in 721 ms. (55 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (144 resets) in 730 ms. (54 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (145 resets) in 528 ms. (75 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (140 resets) in 569 ms. (70 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (142 resets) in 512 ms. (77 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (144 resets) in 691 ms. (57 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (149 resets) in 599 ms. (66 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (147 resets) in 472 ms. (84 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (147 resets) in 537 ms. (74 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (144 resets) in 568 ms. (70 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (152 resets) in 565 ms. (70 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (148 resets) in 591 ms. (67 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (138 resets) in 718 ms. (55 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (143 resets) in 520 ms. (76 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (154 resets) in 465 ms. (85 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (144 resets) in 502 ms. (79 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (151 resets) in 516 ms. (77 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (141 resets) in 572 ms. (69 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (147 resets) in 545 ms. (73 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (142 resets) in 503 ms. (79 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (141 resets) in 570 ms. (70 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (145 resets) in 598 ms. (66 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (145 resets) in 601 ms. (66 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (146 resets) in 500 ms. (79 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (143 resets) in 558 ms. (71 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (138 resets) in 536 ms. (74 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (147 resets) in 531 ms. (75 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (148 resets) in 555 ms. (71 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (144 resets) in 495 ms. (80 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (147 resets) in 572 ms. (69 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (149 resets) in 536 ms. (74 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40004 steps (152 resets) in 569 ms. (70 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (148 resets) in 498 ms. (80 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (141 resets) in 529 ms. (75 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (143 resets) in 528 ms. (75 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40002 steps (149 resets) in 517 ms. (77 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (137 resets) in 555 ms. (71 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (147 resets) in 473 ms. (84 steps per ms) remains 237/237 properties
BEST_FIRST walk for 40003 steps (145 resets) in 499 ms. (80 steps per ms) remains 237/237 properties

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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-06a"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ASLink-PT-06a, 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 r466-smll-171620124300058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-06a.tgz
mv ASLink-PT-06a 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 ;