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-171620124300023.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-02b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r466-smll-171620124300023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.2K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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 417K 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 1717182332178

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-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:05:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-31 19:05:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:05:34] [INFO ] Load time of PNML (sax parser for PT used): 365 ms
[2024-05-31 19:05:34] [INFO ] Transformed 1242 places.
[2024-05-31 19:05:34] [INFO ] Transformed 1621 transitions.
[2024-05-31 19:05:34] [INFO ] Found NUPN structural information;
[2024-05-31 19:05:34] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 696 ms.
Structural test allowed to assert that 146 places are NOT stable. Took 30 ms.
RANDOM walk for 40000 steps (164 resets) in 4300 ms. (9 steps per ms) remains 148/1096 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 148/148 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 148/148 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 148/148 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 148/148 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 148/148 properties
// Phase 1: matrix 1621 rows 1242 cols
[2024-05-31 19:05:36] [INFO ] Computed 121 invariants in 130 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 148/148 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 101/249 variables, 9/161 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 101/262 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 148 unsolved
SMT process timed out in 5492ms, After SMT, problems are : Problem set: 0 solved, 148 unsolved
Fused 148 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 148 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 246 transitions
Trivial Post-agglo rules discarded 246 transitions
Performed 246 trivial Post agglomeration. Transition count delta: 246
Iterating post reduction 0 with 246 rules applied. Total rules applied 246 place count 1242 transition count 1375
Reduce places removed 246 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 260 rules applied. Total rules applied 506 place count 996 transition count 1361
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 510 place count 992 transition count 1361
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 251 Pre rules applied. Total rules applied 510 place count 992 transition count 1110
Deduced a syphon composed of 251 places in 7 ms
Ensure Unique test removed 21 places
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 3 with 523 rules applied. Total rules applied 1033 place count 720 transition count 1110
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 3 with 16 rules applied. Total rules applied 1049 place count 719 transition count 1095
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1064 place count 704 transition count 1095
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1064 place count 704 transition count 1088
Deduced a syphon composed of 7 places in 2 ms
Ensure Unique test removed 7 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 21 rules applied. Total rules applied 1085 place count 690 transition count 1088
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 1085 place count 690 transition count 1081
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1099 place count 683 transition count 1081
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 1133 place count 649 transition count 1047
Iterating global reduction 5 with 34 rules applied. Total rules applied 1167 place count 649 transition count 1047
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1168 place count 649 transition count 1046
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1168 place count 649 transition count 1034
Deduced a syphon composed of 12 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 25 rules applied. Total rules applied 1193 place count 636 transition count 1034
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1193 place count 636 transition count 1033
Deduced a syphon composed of 1 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1196 place count 634 transition count 1033
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1199 place count 631 transition count 1012
Iterating global reduction 6 with 3 rules applied. Total rules applied 1202 place count 631 transition count 1012
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1202 place count 631 transition count 1011
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1204 place count 630 transition count 1011
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1205 place count 629 transition count 1003
Iterating global reduction 6 with 1 rules applied. Total rules applied 1206 place count 629 transition count 1003
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1207 place count 628 transition count 995
Iterating global reduction 6 with 1 rules applied. Total rules applied 1208 place count 628 transition count 995
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1209 place count 627 transition count 987
Iterating global reduction 6 with 1 rules applied. Total rules applied 1210 place count 627 transition count 987
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1211 place count 626 transition count 979
Iterating global reduction 6 with 1 rules applied. Total rules applied 1212 place count 626 transition count 979
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1213 place count 625 transition count 971
Iterating global reduction 6 with 1 rules applied. Total rules applied 1214 place count 625 transition count 971
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1215 place count 624 transition count 963
Iterating global reduction 6 with 1 rules applied. Total rules applied 1216 place count 624 transition count 963
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1217 place count 623 transition count 955
Iterating global reduction 6 with 1 rules applied. Total rules applied 1218 place count 623 transition count 955
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1219 place count 622 transition count 947
Iterating global reduction 6 with 1 rules applied. Total rules applied 1220 place count 622 transition count 947
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1221 place count 621 transition count 939
Iterating global reduction 6 with 1 rules applied. Total rules applied 1222 place count 621 transition count 939
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1223 place count 620 transition count 931
Iterating global reduction 6 with 1 rules applied. Total rules applied 1224 place count 620 transition count 931
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1225 place count 619 transition count 923
Iterating global reduction 6 with 1 rules applied. Total rules applied 1226 place count 619 transition count 923
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1227 place count 618 transition count 915
Iterating global reduction 6 with 1 rules applied. Total rules applied 1228 place count 618 transition count 915
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1229 place count 617 transition count 907
Iterating global reduction 6 with 1 rules applied. Total rules applied 1230 place count 617 transition count 907
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1231 place count 616 transition count 899
Iterating global reduction 6 with 1 rules applied. Total rules applied 1232 place count 616 transition count 899
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1233 place count 615 transition count 891
Iterating global reduction 6 with 1 rules applied. Total rules applied 1234 place count 615 transition count 891
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1235 place count 614 transition count 883
Iterating global reduction 6 with 1 rules applied. Total rules applied 1236 place count 614 transition count 883
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 3 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 6 with 114 rules applied. Total rules applied 1350 place count 557 transition count 826
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1352 place count 556 transition count 835
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 1357 place count 556 transition count 830
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1362 place count 551 transition count 830
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 1363 place count 551 transition count 830
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1364 place count 550 transition count 829
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 4 rules applied. Total rules applied 1368 place count 547 transition count 828
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1369 place count 546 transition count 828
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 1369 place count 546 transition count 824
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 1377 place count 542 transition count 824
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 9 with 2 rules applied. Total rules applied 1379 place count 540 transition count 824
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 1385 place count 537 transition count 821
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 1387 place count 535 transition count 819
Iterating global reduction 10 with 2 rules applied. Total rules applied 1389 place count 535 transition count 819
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1391 place count 535 transition count 817
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1393 place count 533 transition count 817
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1394 place count 533 transition count 817
Applied a total of 1394 rules in 1439 ms. Remains 533 /1242 variables (removed 709) and now considering 817/1621 (removed 804) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1457 ms. Remains : 533/1242 places, 817/1621 transitions.
RANDOM walk for 4000000 steps (64546 resets) in 40956 ms. (97 steps per ms) remains 66/148 properties
BEST_FIRST walk for 400004 steps (2232 resets) in 1316 ms. (303 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2220 resets) in 1300 ms. (307 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2245 resets) in 1304 ms. (306 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2167 resets) in 1353 ms. (295 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2248 resets) in 1332 ms. (300 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2155 resets) in 1315 ms. (303 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2201 resets) in 1346 ms. (296 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2237 resets) in 1348 ms. (296 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2238 resets) in 1322 ms. (302 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2206 resets) in 1322 ms. (302 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2221 resets) in 1334 ms. (299 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2222 resets) in 1318 ms. (303 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2241 resets) in 1318 ms. (303 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2203 resets) in 1310 ms. (305 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2243 resets) in 1323 ms. (302 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2171 resets) in 1341 ms. (298 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2239 resets) in 1307 ms. (305 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2207 resets) in 1306 ms. (306 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2186 resets) in 1324 ms. (301 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2238 resets) in 1318 ms. (303 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2248 resets) in 1301 ms. (307 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2223 resets) in 1328 ms. (300 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2183 resets) in 1374 ms. (290 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2241 resets) in 1329 ms. (300 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2218 resets) in 1323 ms. (302 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2199 resets) in 1321 ms. (302 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2252 resets) in 1304 ms. (306 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2228 resets) in 1341 ms. (298 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2185 resets) in 1317 ms. (303 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2199 resets) in 1321 ms. (302 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2214 resets) in 1325 ms. (301 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2232 resets) in 1512 ms. (264 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2253 resets) in 1675 ms. (238 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2219 resets) in 1909 ms. (209 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2233 resets) in 1668 ms. (239 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2236 resets) in 1339 ms. (298 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2191 resets) in 1372 ms. (291 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2192 resets) in 1280 ms. (312 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2227 resets) in 1261 ms. (316 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2256 resets) in 1286 ms. (310 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2213 resets) in 1652 ms. (241 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2194 resets) in 1677 ms. (238 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2198 resets) in 1745 ms. (229 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2223 resets) in 1865 ms. (214 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2215 resets) in 1750 ms. (228 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2200 resets) in 1699 ms. (235 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2238 resets) in 1880 ms. (212 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2197 resets) in 1958 ms. (204 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2197 resets) in 2090 ms. (191 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2218 resets) in 1260 ms. (317 steps per ms) remains 66/66 properties
// Phase 1: matrix 817 rows 533 cols
[2024-05-31 19:06:15] [INFO ] Computed 85 invariants in 47 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 56/122 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 2/124 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 96/220 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 26/246 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 2/248 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/248 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 106/354 variables, 13/48 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/354 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 14 (OVERLAPS) 73/427 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 16 (OVERLAPS) 10/437 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/437 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 18 (OVERLAPS) 94/531 variables, 27/83 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/531 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 20 (OVERLAPS) 1/532 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/532 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 22 (OVERLAPS) 1/533 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/533 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 24 (OVERLAPS) 817/1350 variables, 533/618 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1350 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 26 (OVERLAPS) 0/1350 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1350/1350 variables, and 618 constraints, problems are : Problem set: 0 solved, 66 unsolved in 11891 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 533/533 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 56/122 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 2/124 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 96/220 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-31 19:06:29] [INFO ] Deduced a trap composed of 61 places in 247 ms of which 26 ms to minimize.
[2024-05-31 19:06:29] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 26/246 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-05-31 19:06:31] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 2/248 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/248 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 14 (OVERLAPS) 106/354 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 16 (OVERLAPS) 73/427 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 18 (OVERLAPS) 10/437 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/437 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 20 (OVERLAPS) 94/531 variables, 27/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/531 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 22 (OVERLAPS) 1/532 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/532 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 24 (OVERLAPS) 1/533 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/533 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 26 (OVERLAPS) 817/1350 variables, 533/621 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1350 variables, 66/687 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1350 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 29 (OVERLAPS) 0/1350 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1350/1350 variables, and 687 constraints, problems are : Problem set: 0 solved, 66 unsolved in 21479 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 533/533 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints]
After SMT, in 33488ms problems are : Problem set: 0 solved, 66 unsolved
Fused 66 Parikh solutions to 56 different solutions.
Parikh walk visited 0 properties in 12671 ms.
Support contains 66 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 817/817 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 533 transition count 795
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 511 transition count 795
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 44 place count 511 transition count 779
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 76 place count 495 transition count 779
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 489 transition count 773
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 488 transition count 772
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 487 transition count 772
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 486 transition count 771
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 486 transition count 769
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 98 place count 484 transition count 768
Applied a total of 98 rules in 99 ms. Remains 484 /533 variables (removed 49) and now considering 768/817 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 484/533 places, 768/817 transitions.
RANDOM walk for 4000000 steps (64749 resets) in 42434 ms. (94 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2251 resets) in 1294 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2203 resets) in 1292 ms. (309 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2241 resets) in 1291 ms. (309 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2225 resets) in 1281 ms. (312 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2220 resets) in 1285 ms. (311 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2215 resets) in 1285 ms. (311 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2216 resets) in 1294 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2179 resets) in 1277 ms. (312 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2218 resets) in 1286 ms. (310 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2205 resets) in 1295 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2187 resets) in 1283 ms. (311 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2213 resets) in 1281 ms. (312 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400001 steps (2206 resets) in 1295 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2241 resets) in 1265 ms. (315 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2271 resets) in 1275 ms. (313 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2166 resets) in 1318 ms. (303 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2229 resets) in 1308 ms. (305 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2235 resets) in 1288 ms. (310 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2219 resets) in 1309 ms. (305 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2203 resets) in 1296 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2227 resets) in 1297 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2233 resets) in 1302 ms. (306 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2233 resets) in 1291 ms. (309 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2203 resets) in 1293 ms. (309 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2234 resets) in 1296 ms. (308 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2219 resets) in 1279 ms. (312 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2209 resets) in 1312 ms. (304 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2208 resets) in 1871 ms. (213 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2260 resets) in 2168 ms. (184 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2194 resets) in 1870 ms. (213 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2228 resets) in 1907 ms. (209 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2241 resets) in 1955 ms. (204 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2216 resets) in 1957 ms. (204 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2230 resets) in 2168 ms. (184 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2172 resets) in 1741 ms. (229 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2218 resets) in 2004 ms. (199 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400000 steps (2223 resets) in 1885 ms. (212 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2242 resets) in 1788 ms. (223 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2187 resets) in 1882 ms. (212 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2219 resets) in 2012 ms. (198 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2237 resets) in 2029 ms. (197 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2246 resets) in 1830 ms. (218 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2205 resets) in 1973 ms. (202 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2238 resets) in 1938 ms. (206 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400004 steps (2211 resets) in 1711 ms. (233 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2239 resets) in 2250 ms. (177 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2227 resets) in 1768 ms. (226 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400002 steps (2235 resets) in 1856 ms. (215 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2206 resets) in 1317 ms. (303 steps per ms) remains 66/66 properties
BEST_FIRST walk for 400003 steps (2242 resets) in 1320 ms. (302 steps per ms) remains 66/66 properties
Interrupted probabilistic random walk after 9022396 steps, run timeout after 111001 ms. (steps per millisecond=81 ) properties seen :64 out of 66
Probabilistic random walk after 9022396 steps, saw 2085985 distinct states, run finished after 111011 ms. (steps per millisecond=81 ) properties seen :64
// Phase 1: matrix 768 rows 484 cols
[2024-05-31 19:09:30] [INFO ] Computed 84 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 43/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 33/85 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/86 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 113/199 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 45/244 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/246 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 113/359 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 53/412 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/414 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/414 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 68/482 variables, 23/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/483 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/483 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/484 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/484 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 768/1252 variables, 484/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1252 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/1252 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1252/1252 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 43/52 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 33/85 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/86 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 113/199 variables, 21/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 45/244 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2/246 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 113/359 variables, 14/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/359 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 53/412 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/412 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/414 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/414 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 68/482 variables, 23/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/482 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 1/483 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/483 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/484 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/484 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 768/1252 variables, 484/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1252 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1252 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/1252 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1252/1252 variables, and 570 constraints, problems are : Problem set: 0 solved, 2 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 484/484 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1594ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1976 ms.
Support contains 2 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 768/768 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 484 transition count 754
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 470 transition count 754
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 28 place count 470 transition count 738
Deduced a syphon composed of 16 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 62 place count 452 transition count 738
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 64 place count 451 transition count 737
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 450 transition count 737
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 65 place count 450 transition count 736
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 68 place count 448 transition count 736
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 68 place count 448 transition count 735
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 70 place count 447 transition count 735
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 87 place count 438 transition count 727
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 87 place count 438 transition count 724
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 7 rules applied. Total rules applied 94 place count 434 transition count 724
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 433 transition count 724
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 95 place count 433 transition count 723
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 97 place count 432 transition count 723
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 99 place count 431 transition count 722
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 100 place count 431 transition count 721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 101 place count 430 transition count 721
Applied a total of 101 rules in 94 ms. Remains 430 /484 variables (removed 54) and now considering 721/768 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 430/484 places, 721/768 transitions.
RANDOM walk for 4000000 steps (64755 resets) in 11578 ms. (345 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (22240 resets) in 4666 ms. (857 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000001 steps (22134 resets) in 4644 ms. (861 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1873471 steps, run timeout after 15001 ms. (steps per millisecond=124 ) properties seen :0 out of 2
Probabilistic random walk after 1873471 steps, saw 515860 distinct states, run finished after 15001 ms. (steps per millisecond=124 ) properties seen :0
// Phase 1: matrix 721 rows 430 cols
[2024-05-31 19:09:55] [INFO ] Computed 77 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/60 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 88/149 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/190 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/192 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 123/315 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 46/361 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 67/428 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/429 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/429 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/430 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 721/1151 variables, 430/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1151 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1151 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1151/1151 variables, and 507 constraints, problems are : Problem set: 0 solved, 2 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 430/430 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 25/60 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 88/149 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 41/190 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/192 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 123/315 variables, 14/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 46/361 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/361 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 67/428 variables, 23/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/428 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/429 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/429 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 1/430 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/430 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 721/1151 variables, 430/507 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1151 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1151 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1151 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1151/1151 variables, and 509 constraints, problems are : Problem set: 0 solved, 2 unsolved in 834 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 59/59 constraints, State Equation: 430/430 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1486ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 651 ms.
Support contains 2 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 721/721 transitions.
Applied a total of 0 rules in 15 ms. Remains 430 /430 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 430/430 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 721/721 transitions.
Applied a total of 0 rules in 14 ms. Remains 430 /430 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2024-05-31 19:09:57] [INFO ] Invariant cache hit.
[2024-05-31 19:09:58] [INFO ] Implicit Places using invariants in 625 ms returned [1, 18, 19, 32, 49, 67, 136, 140, 149, 150, 152, 169, 187, 256, 260, 261, 264, 275, 276, 277, 295, 297, 301, 319, 320, 321, 322, 334, 340, 346, 352, 358, 364, 370, 376, 382, 388, 394]
[2024-05-31 19:09:58] [INFO ] Actually due to overlaps returned [295, 277, 32, 49, 169, 301, 152, 149, 275, 319, 150, 276, 297, 320, 1, 19, 260, 261, 67, 187, 321, 364, 382, 394, 18, 264, 322, 334, 340, 346, 352, 358, 370, 376, 388]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 643 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 395/430 places, 721/721 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 393 transition count 659
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 127 place count 331 transition count 658
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 127 place count 331 transition count 643
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 158 place count 315 transition count 643
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 170 place count 311 transition count 635
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 178 place count 303 transition count 635
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 193 place count 288 transition count 620
Iterating global reduction 4 with 15 rules applied. Total rules applied 208 place count 288 transition count 620
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 211 place count 288 transition count 617
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 211 place count 288 transition count 616
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 213 place count 287 transition count 616
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 216 place count 284 transition count 610
Iterating global reduction 5 with 3 rules applied. Total rules applied 219 place count 284 transition count 610
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 220 place count 283 transition count 609
Iterating global reduction 5 with 1 rules applied. Total rules applied 221 place count 283 transition count 609
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 222 place count 282 transition count 607
Iterating global reduction 5 with 1 rules applied. Total rules applied 223 place count 282 transition count 607
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 267 place count 260 transition count 585
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 268 place count 260 transition count 584
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 270 place count 258 transition count 582
Iterating global reduction 6 with 2 rules applied. Total rules applied 272 place count 258 transition count 582
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 274 place count 258 transition count 580
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 278 place count 256 transition count 581
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 282 place count 256 transition count 577
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 287 place count 251 transition count 577
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 293 place count 251 transition count 577
Applied a total of 293 rules in 149 ms. Remains 251 /395 variables (removed 144) and now considering 577/721 (removed 144) transitions.
// Phase 1: matrix 577 rows 251 cols
[2024-05-31 19:09:58] [INFO ] Computed 34 invariants in 5 ms
[2024-05-31 19:09:58] [INFO ] Implicit Places using invariants in 308 ms returned [74, 91, 97, 100, 102, 103, 106, 107, 159, 176, 182, 185, 187]
[2024-05-31 19:09:58] [INFO ] Actually due to overlaps returned [106, 107, 91, 97, 102, 176, 182, 187, 74, 103, 159]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 313 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 240/430 places, 577/721 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 232 transition count 569
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 232 transition count 569
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 230 transition count 567
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 230 transition count 567
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 28 place count 226 transition count 563
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 226 transition count 557
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 220 transition count 557
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 220 transition count 555
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 218 transition count 555
Applied a total of 44 rules in 72 ms. Remains 218 /240 variables (removed 22) and now considering 555/577 (removed 22) transitions.
// Phase 1: matrix 555 rows 218 cols
[2024-05-31 19:09:58] [INFO ] Computed 23 invariants in 5 ms
[2024-05-31 19:09:58] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-31 19:09:58] [INFO ] Invariant cache hit.
[2024-05-31 19:09:59] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 218/430 places, 555/721 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1992 ms. Remains : 218/430 places, 555/721 transitions.
RANDOM walk for 4000000 steps (100703 resets) in 8879 ms. (450 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (38478 resets) in 3795 ms. (1053 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000002 steps (38560 resets) in 3836 ms. (1042 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 38773 steps, run visited all 2 properties in 297 ms. (steps per millisecond=130 )
Probabilistic random walk after 38773 steps, saw 20270 distinct states, run finished after 304 ms. (steps per millisecond=127 ) properties seen :2
Able to resolve query StableMarking after proving 1097 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK MARKED_SUFFIX_TEST TOPOLOGICAL
Total runtime 270228 ms.
ITS solved all properties within timeout

BK_STOP 1717182604229

--------------------
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-02b"
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-02b, 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-171620124300023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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