About the Execution of GreatSPN+red for MultiCrashLeafsetExtension-PT-S16C05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10873.239 | 3600000.00 | 12458550.00 | 1637.80 | ????FT??F?????FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r245-tall-171654349000026.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 greatspnxred
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349000026
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 18K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 05:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.6M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2023-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2023-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2023-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716566537157
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 16:02:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 16:02:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 16:02:18] [INFO ] Load time of PNML (sax parser for PT used): 337 ms
[2024-05-24 16:02:18] [INFO ] Transformed 4914 places.
[2024-05-24 16:02:18] [INFO ] Transformed 6913 transitions.
[2024-05-24 16:02:18] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 464 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 134 out of 4914 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 4884 transition count 6913
Discarding 1332 places :
Symmetric choice reduction at 1 with 1332 rule applications. Total rules 1362 place count 3552 transition count 5581
Iterating global reduction 1 with 1332 rules applied. Total rules applied 2694 place count 3552 transition count 5581
Discarding 1158 places :
Symmetric choice reduction at 1 with 1158 rule applications. Total rules 3852 place count 2394 transition count 4423
Iterating global reduction 1 with 1158 rules applied. Total rules applied 5010 place count 2394 transition count 4423
Discarding 195 places :
Symmetric choice reduction at 1 with 195 rule applications. Total rules 5205 place count 2199 transition count 3448
Iterating global reduction 1 with 195 rules applied. Total rules applied 5400 place count 2199 transition count 3448
Applied a total of 5400 rules in 1380 ms. Remains 2199 /4914 variables (removed 2715) and now considering 3448/6913 (removed 3465) transitions.
[2024-05-24 16:02:20] [INFO ] Flow matrix only has 3176 transitions (discarded 272 similar events)
// Phase 1: matrix 3176 rows 2199 cols
[2024-05-24 16:02:20] [INFO ] Computed 505 invariants in 154 ms
[2024-05-24 16:02:22] [INFO ] Implicit Places using invariants in 2299 ms returned [4, 8, 12, 14, 16, 18, 20, 22, 27, 34, 43, 54, 67, 82, 98, 118, 120, 122, 124, 137, 151, 160, 167, 172, 175, 207, 210, 211, 213, 214, 215, 221, 226, 233, 242, 253, 266, 280, 294, 295, 296, 297, 298, 299, 311, 320, 327, 332, 335, 338, 361, 368, 371, 372, 373, 375, 376, 378, 381, 386, 393, 405, 416, 428, 440, 441, 442, 443, 444, 445, 455, 462, 467, 470, 472, 474, 497, 504, 507, 508, 510, 511, 512, 515, 517, 520, 527, 534, 543, 553, 563, 565, 566, 567, 568, 575, 580, 585, 587, 589, 591, 614, 621, 624, 625, 626, 627, 629, 631, 633, 637, 640, 645, 652, 660, 668, 669, 671, 673, 678, 684, 686, 688, 690, 695, 718, 725, 728, 729, 730, 731, 732, 733, 735, 737, 739, 741, 744, 749, 755, 763, 764, 765, 766, 769, 773, 778, 780, 782, 784, 814, 817, 818, 823, 827, 829, 831, 833, 835, 840, 847, 851, 852, 853, 854, 855, 856, 859, 861, 863, 865, 868, 870, 893, 900, 903, 904, 906, 907, 908, 910, 914, 916, 918, 920, 922, 924, 927, 928, 931, 932, 934, 939, 944, 946, 948, 950, 973, 975, 979, 982, 983, 984, 986, 987, 989, 991, 993, 995, 999, 1001, 1003, 1006, 1007, 1008, 1009, 1010, 1011, 1013, 1015, 1017, 1019, 1021, 1023, 1053, 1056, 1057, 1059, 1060, 1061, 1063, 1065, 1067, 1069, 1071, 1073, 1077, 1081, 1084, 1085, 1087, 1094, 1098, 1103, 1105, 1107, 1130, 1137, 1141, 1142, 1143, 1144, 1145, 1149, 1151, 1153, 1155, 1157, 1159, 1162, 1167, 1168, 1169, 1170, 1171, 1172, 1175, 1177, 1179, 1181, 1183, 1185, 1208, 1215, 1218, 1219, 1220, 1221, 1222, 1223, 1225, 1227, 1229, 1231, 1233, 1236, 1241, 1249, 1251, 1252, 1253, 1261, 1264, 1266, 1268, 1270, 1274, 1297, 1304, 1307, 1308, 1309, 1311, 1312, 1314, 1317, 1319, 1323, 1326, 1331, 1347, 1348, 1350, 1351, 1352, 1359, 1364, 1367, 1369, 1374, 1376, 1399, 1406, 1409, 1410, 1412, 1413, 1414, 1416, 1421, 1423, 1426, 1431, 1438, 1447, 1458, 1459, 1460, 1462, 1463, 1472, 1479, 1484, 1487, 1489, 1491, 1517, 1524, 1527, 1528, 1529, 1530, 1531, 1532, 1534, 1536, 1539, 1544, 1551, 1560, 1571, 1585, 1586, 1587, 1588, 1589, 1603, 1612, 1620, 1627, 1630, 1632, 1655, 1662, 1665, 1666, 1667, 1668, 1669, 1670, 1672, 1676, 1681, 1697, 1708, 1721, 1736, 1737, 1738, 1739, 1740, 1741, 1755, 1766, 1776, 1783, 1788, 1791, 1814, 1816, 1823, 1824, 1825, 1826, 1827, 1828, 1832, 1837, 1844, 1853, 1864, 1877, 1892, 1909, 1910, 1911, 1912, 1913, 1914, 1929, 1942, 1953, 1962, 1969, 1974, 1998]
[2024-05-24 16:02:22] [INFO ] Actually due to overlaps returned [361, 497, 614, 718, 893, 973, 1130, 1208, 1297, 1399, 1517, 1655, 1814, 1998, 4, 12, 14, 16, 18, 20, 43, 82, 118, 120, 122, 207, 210, 211, 213, 214, 233, 266, 294, 295, 296, 297, 298, 368, 371, 372, 373, 375, 386, 416, 440, 441, 442, 443, 444, 504, 507, 508, 510, 511, 520, 543, 563, 565, 566, 567, 621, 624, 625, 626, 627, 637, 652, 668, 669, 671, 725, 728, 729, 730, 731, 732, 749, 763, 764, 765, 814, 817, 818, 833, 840, 851, 852, 853, 854, 855, 900, 903, 904, 906, 907, 918, 922, 927, 928, 931, 975, 979, 982, 983, 984, 986, 995, 1006, 1007, 1008, 1009, 1010, 1053, 1056, 1057, 1059, 1060, 1069, 1077, 1081, 1084, 1137, 1141, 1142, 1143, 1144, 1155, 1162, 1167, 1168, 1169, 1170, 1171, 1215, 1218, 1219, 1220, 1221, 1222, 1231, 1241, 1249, 1251, 1252, 1304, 1307, 1308, 1309, 1311, 1323, 1347, 1348, 1350, 1351, 1406, 1409, 1410, 1412, 1413, 1426, 1447, 1458, 1459, 1460, 1462, 1524, 1527, 1528, 1529, 1530, 1531, 1544, 1571, 1585, 1586, 1587, 1588, 1662, 1665, 1666, 1667, 1668, 1669, 1721, 1736, 1737, 1738, 1739, 1740, 1816, 1823, 1824, 1825, 1826, 1827, 1853, 1892, 1909, 1910, 1911, 1912, 1913]
Discarding 202 places :
Implicit Place search using SMT only with invariants took 2335 ms to find 202 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1997/4914 places, 3448/6913 transitions.
Discarding 130 places :
Symmetric choice reduction at 0 with 130 rule applications. Total rules 130 place count 1867 transition count 3318
Iterating global reduction 0 with 130 rules applied. Total rules applied 260 place count 1867 transition count 3318
Discarding 127 places :
Symmetric choice reduction at 0 with 127 rule applications. Total rules 387 place count 1740 transition count 3191
Iterating global reduction 0 with 127 rules applied. Total rules applied 514 place count 1740 transition count 3191
Discarding 126 places :
Symmetric choice reduction at 0 with 126 rule applications. Total rules 640 place count 1614 transition count 3065
Iterating global reduction 0 with 126 rules applied. Total rules applied 766 place count 1614 transition count 3065
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 774 place count 1606 transition count 3025
Iterating global reduction 0 with 8 rules applied. Total rules applied 782 place count 1606 transition count 3025
Applied a total of 782 rules in 196 ms. Remains 1606 /1997 variables (removed 391) and now considering 3025/3448 (removed 423) transitions.
[2024-05-24 16:02:22] [INFO ] Flow matrix only has 2753 transitions (discarded 272 similar events)
// Phase 1: matrix 2753 rows 1606 cols
[2024-05-24 16:02:22] [INFO ] Computed 303 invariants in 64 ms
[2024-05-24 16:02:24] [INFO ] Implicit Places using invariants in 1262 ms returned [7, 16, 21, 28, 47, 60, 90, 113, 126, 140, 149, 156, 161, 164, 199, 205, 210, 225, 236, 262, 276, 288, 297, 304, 309, 312, 315, 334, 336, 339, 350, 362, 384, 396, 406, 413, 418, 421, 423, 425, 439, 442, 444, 453, 460, 478, 489, 496, 501, 506, 508, 510, 512, 528, 530, 532, 538, 543, 557, 567, 572, 578, 580, 582, 584, 589, 606, 608, 610, 612, 614, 617, 627, 635, 638, 642, 647, 649, 651, 653, 673, 677, 679, 681, 684, 695, 699, 701, 703, 705, 707, 710, 712, 730, 732, 736, 738, 741, 744, 749, 751, 756, 761, 763, 765, 767, 783, 785, 787, 789, 794, 796, 798, 801, 803, 805, 807, 809, 811, 813, 829, 831, 833, 835, 838, 840, 849, 851, 858, 862, 867, 869, 871, 891, 895, 897, 899, 902, 904, 910, 913, 915, 917, 919, 921, 923, 936, 938, 940, 942, 945, 948, 961, 969, 972, 974, 976, 978, 982, 999, 1001, 1004, 1006, 1012, 1017, 1034, 1041, 1046, 1049, 1051, 1056, 1058, 1074, 1076, 1081, 1083, 1090, 1097, 1117, 1126, 1133, 1138, 1141, 1143, 1145, 1162, 1164, 1166, 1169, 1180, 1189, 1213, 1227, 1236, 1244, 1251, 1254, 1256, 1268, 1270, 1274, 1279, 1295, 1306, 1332, 1346, 1357, 1367, 1374, 1379, 1382, 1391, 1395, 1400, 1407, 1426, 1439, 1469, 1484, 1497, 1508, 1517, 1524, 1529]
Discarding 224 places :
Implicit Place search using SMT only with invariants took 1267 ms to find 224 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1382/4914 places, 3025/6913 transitions.
Applied a total of 0 rules in 50 ms. Remains 1382 /1382 variables (removed 0) and now considering 3025/3025 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5245 ms. Remains : 1382/4914 places, 3025/6913 transitions.
Support contains 134 out of 1382 places after structural reductions.
[2024-05-24 16:02:24] [INFO ] Flatten gal took : 192 ms
[2024-05-24 16:02:24] [INFO ] Flatten gal took : 141 ms
[2024-05-24 16:02:24] [INFO ] Input system was already deterministic with 3025 transitions.
RANDOM walk for 40000 steps (765 resets) in 3840 ms. (10 steps per ms) remains 33/64 properties
BEST_FIRST walk for 4004 steps (20 resets) in 84 ms. (47 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (20 resets) in 71 ms. (55 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (20 resets) in 68 ms. (58 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (20 resets) in 52 ms. (75 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (20 resets) in 51 ms. (77 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (20 resets) in 53 ms. (74 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (20 resets) in 79 ms. (50 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (20 resets) in 32 ms. (121 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (20 resets) in 33 ms. (117 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (20 resets) in 22 ms. (174 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (20 resets) in 32 ms. (121 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (20 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (20 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (20 resets) in 41 ms. (95 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (20 resets) in 34 ms. (114 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (20 resets) in 28 ms. (138 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (20 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (20 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (20 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (20 resets) in 19 ms. (200 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (20 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (20 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (20 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (20 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (20 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (20 resets) in 25 ms. (153 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (20 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (20 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (20 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (20 resets) in 45 ms. (87 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
[2024-05-24 16:02:26] [INFO ] Flow matrix only has 2753 transitions (discarded 272 similar events)
// Phase 1: matrix 2753 rows 1382 cols
[2024-05-24 16:02:26] [INFO ] Computed 79 invariants in 27 ms
[2024-05-24 16:02:26] [INFO ] State equation strengthened by 1094 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 3 (OVERLAPS) 1197/1276 variables, 16/21 constraints. Problems are: Problem set: 9 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1276 variables, 3/24 constraints. Problems are: Problem set: 9 solved, 22 unsolved
[2024-05-24 16:02:28] [INFO ] Deduced a trap composed of 491 places in 667 ms of which 74 ms to minimize.
[2024-05-24 16:02:28] [INFO ] Deduced a trap composed of 516 places in 609 ms of which 14 ms to minimize.
[2024-05-24 16:02:29] [INFO ] Deduced a trap composed of 513 places in 516 ms of which 8 ms to minimize.
[2024-05-24 16:02:29] [INFO ] Deduced a trap composed of 293 places in 553 ms of which 8 ms to minimize.
[2024-05-24 16:02:30] [INFO ] Deduced a trap composed of 310 places in 565 ms of which 8 ms to minimize.
[2024-05-24 16:02:31] [INFO ] Deduced a trap composed of 293 places in 562 ms of which 8 ms to minimize.
[2024-05-24 16:02:31] [INFO ] Deduced a trap composed of 310 places in 542 ms of which 8 ms to minimize.
SMT process timed out in 5242ms, After SMT, problems are : Problem set: 9 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 1382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1382/1382 places, 3025/3025 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1382 transition count 3002
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 1359 transition count 3002
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 46 place count 1359 transition count 2968
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 114 place count 1325 transition count 2968
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 143 place count 1296 transition count 2891
Iterating global reduction 2 with 29 rules applied. Total rules applied 172 place count 1296 transition count 2891
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 172 place count 1296 transition count 2890
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 174 place count 1295 transition count 2890
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 191 place count 1278 transition count 2817
Iterating global reduction 2 with 17 rules applied. Total rules applied 208 place count 1278 transition count 2817
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 210 place count 1276 transition count 2807
Iterating global reduction 2 with 2 rules applied. Total rules applied 212 place count 1276 transition count 2807
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 270 place count 1247 transition count 2778
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 285 place count 1232 transition count 2763
Iterating global reduction 2 with 15 rules applied. Total rules applied 300 place count 1232 transition count 2763
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 314 place count 1218 transition count 2693
Iterating global reduction 2 with 14 rules applied. Total rules applied 328 place count 1218 transition count 2693
Free-agglomeration rule (complex) applied 127 times.
Iterating global reduction 2 with 127 rules applied. Total rules applied 455 place count 1218 transition count 3298
Reduce places removed 127 places and 0 transitions.
Iterating post reduction 2 with 127 rules applied. Total rules applied 582 place count 1091 transition count 3298
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 3 with 28 rules applied. Total rules applied 610 place count 1091 transition count 3298
Applied a total of 610 rules in 875 ms. Remains 1091 /1382 variables (removed 291) and now considering 3298/3025 (removed -273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 876 ms. Remains : 1091/1382 places, 3298/3025 transitions.
RANDOM walk for 40000 steps (1263 resets) in 1091 ms. (36 steps per ms) remains 20/22 properties
BEST_FIRST walk for 4001 steps (19 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (17 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (19 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (17 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (18 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (18 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (20 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (19 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (20 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (18 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (20 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (20 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (16 resets) in 46 ms. (85 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (19 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (20 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (20 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (20 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (20 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (20 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 58244 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :1 out of 20
Probabilistic random walk after 58244 steps, saw 24852 distinct states, run finished after 3004 ms. (steps per millisecond=19 ) properties seen :1
[2024-05-24 16:02:36] [INFO ] Flow matrix only has 2925 transitions (discarded 373 similar events)
// Phase 1: matrix 2925 rows 1091 cols
[2024-05-24 16:02:36] [INFO ] Computed 79 invariants in 27 ms
[2024-05-24 16:02:36] [INFO ] State equation strengthened by 1658 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 973/1009 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 16:02:36] [INFO ] Deduced a trap composed of 157 places in 487 ms of which 6 ms to minimize.
[2024-05-24 16:02:37] [INFO ] Deduced a trap composed of 332 places in 442 ms of which 6 ms to minimize.
[2024-05-24 16:02:37] [INFO ] Deduced a trap composed of 368 places in 490 ms of which 6 ms to minimize.
[2024-05-24 16:02:38] [INFO ] Deduced a trap composed of 159 places in 507 ms of which 7 ms to minimize.
[2024-05-24 16:02:38] [INFO ] Deduced a trap composed of 347 places in 472 ms of which 7 ms to minimize.
[2024-05-24 16:02:39] [INFO ] Deduced a trap composed of 118 places in 454 ms of which 6 ms to minimize.
[2024-05-24 16:02:39] [INFO ] Deduced a trap composed of 196 places in 510 ms of which 6 ms to minimize.
[2024-05-24 16:02:40] [INFO ] Deduced a trap composed of 179 places in 524 ms of which 6 ms to minimize.
[2024-05-24 16:02:40] [INFO ] Deduced a trap composed of 171 places in 496 ms of which 6 ms to minimize.
[2024-05-24 16:02:41] [INFO ] Deduced a trap composed of 200 places in 497 ms of which 6 ms to minimize.
[2024-05-24 16:02:42] [INFO ] Deduced a trap composed of 195 places in 506 ms of which 7 ms to minimize.
[2024-05-24 16:02:42] [INFO ] Deduced a trap composed of 138 places in 511 ms of which 7 ms to minimize.
[2024-05-24 16:02:43] [INFO ] Deduced a trap composed of 179 places in 509 ms of which 7 ms to minimize.
[2024-05-24 16:02:43] [INFO ] Deduced a trap composed of 200 places in 495 ms of which 6 ms to minimize.
[2024-05-24 16:02:44] [INFO ] Deduced a trap composed of 208 places in 538 ms of which 7 ms to minimize.
[2024-05-24 16:02:44] [INFO ] Deduced a trap composed of 234 places in 519 ms of which 6 ms to minimize.
[2024-05-24 16:02:45] [INFO ] Deduced a trap composed of 393 places in 518 ms of which 6 ms to minimize.
[2024-05-24 16:02:45] [INFO ] Deduced a trap composed of 179 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:02:46] [INFO ] Deduced a trap composed of 220 places in 505 ms of which 7 ms to minimize.
[2024-05-24 16:02:46] [INFO ] Deduced a trap composed of 202 places in 503 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1009 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 16:02:47] [INFO ] Deduced a trap composed of 179 places in 506 ms of which 6 ms to minimize.
[2024-05-24 16:02:48] [INFO ] Deduced a trap composed of 256 places in 507 ms of which 6 ms to minimize.
[2024-05-24 16:02:48] [INFO ] Deduced a trap composed of 70 places in 504 ms of which 6 ms to minimize.
[2024-05-24 16:02:49] [INFO ] Deduced a trap composed of 195 places in 505 ms of which 6 ms to minimize.
[2024-05-24 16:02:49] [INFO ] Deduced a trap composed of 223 places in 496 ms of which 6 ms to minimize.
[2024-05-24 16:02:50] [INFO ] Deduced a trap composed of 221 places in 508 ms of which 6 ms to minimize.
[2024-05-24 16:02:50] [INFO ] Deduced a trap composed of 238 places in 495 ms of which 6 ms to minimize.
[2024-05-24 16:02:51] [INFO ] Deduced a trap composed of 102 places in 499 ms of which 6 ms to minimize.
[2024-05-24 16:02:51] [INFO ] Deduced a trap composed of 218 places in 452 ms of which 6 ms to minimize.
[2024-05-24 16:02:52] [INFO ] Deduced a trap composed of 179 places in 469 ms of which 7 ms to minimize.
[2024-05-24 16:02:52] [INFO ] Deduced a trap composed of 423 places in 415 ms of which 5 ms to minimize.
[2024-05-24 16:02:53] [INFO ] Deduced a trap composed of 304 places in 494 ms of which 6 ms to minimize.
[2024-05-24 16:02:53] [INFO ] Deduced a trap composed of 412 places in 495 ms of which 7 ms to minimize.
[2024-05-24 16:02:54] [INFO ] Deduced a trap composed of 201 places in 496 ms of which 6 ms to minimize.
[2024-05-24 16:02:54] [INFO ] Deduced a trap composed of 281 places in 499 ms of which 6 ms to minimize.
[2024-05-24 16:02:55] [INFO ] Deduced a trap composed of 159 places in 509 ms of which 6 ms to minimize.
[2024-05-24 16:02:56] [INFO ] Deduced a trap composed of 178 places in 529 ms of which 7 ms to minimize.
[2024-05-24 16:02:56] [INFO ] Deduced a trap composed of 182 places in 512 ms of which 6 ms to minimize.
[2024-05-24 16:02:57] [INFO ] Deduced a trap composed of 406 places in 518 ms of which 7 ms to minimize.
[2024-05-24 16:02:57] [INFO ] Deduced a trap composed of 200 places in 523 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1009 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 16:02:58] [INFO ] Deduced a trap composed of 185 places in 546 ms of which 6 ms to minimize.
[2024-05-24 16:02:58] [INFO ] Deduced a trap composed of 418 places in 495 ms of which 6 ms to minimize.
[2024-05-24 16:02:59] [INFO ] Deduced a trap composed of 313 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:03:00] [INFO ] Deduced a trap composed of 304 places in 533 ms of which 6 ms to minimize.
[2024-05-24 16:03:00] [INFO ] Deduced a trap composed of 302 places in 523 ms of which 6 ms to minimize.
[2024-05-24 16:03:01] [INFO ] Deduced a trap composed of 542 places in 533 ms of which 7 ms to minimize.
[2024-05-24 16:03:01] [INFO ] Deduced a trap composed of 336 places in 542 ms of which 7 ms to minimize.
[2024-05-24 16:03:02] [INFO ] Deduced a trap composed of 295 places in 520 ms of which 7 ms to minimize.
[2024-05-24 16:03:02] [INFO ] Deduced a trap composed of 195 places in 531 ms of which 7 ms to minimize.
[2024-05-24 16:03:03] [INFO ] Deduced a trap composed of 178 places in 542 ms of which 8 ms to minimize.
[2024-05-24 16:03:03] [INFO ] Deduced a trap composed of 290 places in 532 ms of which 6 ms to minimize.
[2024-05-24 16:03:04] [INFO ] Deduced a trap composed of 175 places in 510 ms of which 6 ms to minimize.
[2024-05-24 16:03:04] [INFO ] Deduced a trap composed of 167 places in 522 ms of which 7 ms to minimize.
[2024-05-24 16:03:05] [INFO ] Deduced a trap composed of 257 places in 527 ms of which 6 ms to minimize.
[2024-05-24 16:03:06] [INFO ] Deduced a trap composed of 356 places in 517 ms of which 6 ms to minimize.
[2024-05-24 16:03:06] [INFO ] Deduced a trap composed of 254 places in 504 ms of which 7 ms to minimize.
[2024-05-24 16:03:07] [INFO ] Deduced a trap composed of 245 places in 530 ms of which 6 ms to minimize.
[2024-05-24 16:03:07] [INFO ] Deduced a trap composed of 501 places in 533 ms of which 6 ms to minimize.
[2024-05-24 16:03:08] [INFO ] Deduced a trap composed of 206 places in 523 ms of which 7 ms to minimize.
[2024-05-24 16:03:08] [INFO ] Deduced a trap composed of 179 places in 541 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1009 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 16:03:09] [INFO ] Deduced a trap composed of 430 places in 535 ms of which 8 ms to minimize.
[2024-05-24 16:03:09] [INFO ] Deduced a trap composed of 342 places in 525 ms of which 7 ms to minimize.
[2024-05-24 16:03:10] [INFO ] Deduced a trap composed of 396 places in 532 ms of which 7 ms to minimize.
[2024-05-24 16:03:11] [INFO ] Deduced a trap composed of 479 places in 535 ms of which 6 ms to minimize.
[2024-05-24 16:03:11] [INFO ] Deduced a trap composed of 184 places in 527 ms of which 7 ms to minimize.
[2024-05-24 16:03:12] [INFO ] Deduced a trap composed of 485 places in 524 ms of which 6 ms to minimize.
[2024-05-24 16:03:12] [INFO ] Deduced a trap composed of 350 places in 534 ms of which 6 ms to minimize.
[2024-05-24 16:03:13] [INFO ] Deduced a trap composed of 402 places in 546 ms of which 6 ms to minimize.
[2024-05-24 16:03:13] [INFO ] Deduced a trap composed of 152 places in 533 ms of which 7 ms to minimize.
[2024-05-24 16:03:14] [INFO ] Deduced a trap composed of 136 places in 543 ms of which 7 ms to minimize.
[2024-05-24 16:03:14] [INFO ] Deduced a trap composed of 130 places in 531 ms of which 6 ms to minimize.
[2024-05-24 16:03:15] [INFO ] Deduced a trap composed of 151 places in 514 ms of which 6 ms to minimize.
[2024-05-24 16:03:16] [INFO ] Deduced a trap composed of 180 places in 528 ms of which 6 ms to minimize.
[2024-05-24 16:03:16] [INFO ] Deduced a trap composed of 161 places in 523 ms of which 6 ms to minimize.
[2024-05-24 16:03:17] [INFO ] Deduced a trap composed of 172 places in 536 ms of which 6 ms to minimize.
[2024-05-24 16:03:17] [INFO ] Deduced a trap composed of 228 places in 523 ms of which 6 ms to minimize.
[2024-05-24 16:03:18] [INFO ] Deduced a trap composed of 332 places in 524 ms of which 6 ms to minimize.
[2024-05-24 16:03:19] [INFO ] Deduced a trap composed of 348 places in 534 ms of which 7 ms to minimize.
[2024-05-24 16:03:19] [INFO ] Deduced a trap composed of 532 places in 526 ms of which 7 ms to minimize.
[2024-05-24 16:03:20] [INFO ] Deduced a trap composed of 217 places in 511 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1009 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 16:03:21] [INFO ] Deduced a trap composed of 174 places in 486 ms of which 6 ms to minimize.
[2024-05-24 16:03:21] [INFO ] Deduced a trap composed of 167 places in 524 ms of which 6 ms to minimize.
SMT process timed out in 45624ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 36 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 3298/3298 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1091 transition count 3296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1089 transition count 3296
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1089 transition count 3296
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 1087 transition count 3294
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 1087 transition count 3294
Applied a total of 10 rules in 224 ms. Remains 1087 /1091 variables (removed 4) and now considering 3294/3298 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 225 ms. Remains : 1087/1091 places, 3294/3298 transitions.
RANDOM walk for 40000 steps (1264 resets) in 951 ms. (42 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (17 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (18 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (18 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (20 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (20 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (18 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (20 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (19 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 57295 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :0 out of 19
Probabilistic random walk after 57295 steps, saw 24448 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :0
[2024-05-24 16:03:25] [INFO ] Flow matrix only has 2921 transitions (discarded 373 similar events)
// Phase 1: matrix 2921 rows 1087 cols
[2024-05-24 16:03:25] [INFO ] Computed 79 invariants in 31 ms
[2024-05-24 16:03:25] [INFO ] State equation strengthened by 1658 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 971/1007 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 16:03:26] [INFO ] Deduced a trap composed of 169 places in 547 ms of which 7 ms to minimize.
[2024-05-24 16:03:26] [INFO ] Deduced a trap composed of 155 places in 541 ms of which 6 ms to minimize.
[2024-05-24 16:03:27] [INFO ] Deduced a trap composed of 178 places in 551 ms of which 6 ms to minimize.
[2024-05-24 16:03:27] [INFO ] Deduced a trap composed of 142 places in 547 ms of which 6 ms to minimize.
[2024-05-24 16:03:28] [INFO ] Deduced a trap composed of 146 places in 532 ms of which 6 ms to minimize.
[2024-05-24 16:03:28] [INFO ] Deduced a trap composed of 128 places in 527 ms of which 7 ms to minimize.
[2024-05-24 16:03:29] [INFO ] Deduced a trap composed of 168 places in 540 ms of which 6 ms to minimize.
[2024-05-24 16:03:30] [INFO ] Deduced a trap composed of 134 places in 519 ms of which 7 ms to minimize.
[2024-05-24 16:03:30] [INFO ] Deduced a trap composed of 146 places in 528 ms of which 6 ms to minimize.
[2024-05-24 16:03:31] [INFO ] Deduced a trap composed of 131 places in 528 ms of which 7 ms to minimize.
[2024-05-24 16:03:31] [INFO ] Deduced a trap composed of 330 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:03:32] [INFO ] Deduced a trap composed of 147 places in 537 ms of which 7 ms to minimize.
[2024-05-24 16:03:32] [INFO ] Deduced a trap composed of 138 places in 530 ms of which 6 ms to minimize.
[2024-05-24 16:03:33] [INFO ] Deduced a trap composed of 136 places in 541 ms of which 7 ms to minimize.
[2024-05-24 16:03:33] [INFO ] Deduced a trap composed of 155 places in 528 ms of which 7 ms to minimize.
[2024-05-24 16:03:34] [INFO ] Deduced a trap composed of 136 places in 536 ms of which 6 ms to minimize.
[2024-05-24 16:03:34] [INFO ] Deduced a trap composed of 348 places in 458 ms of which 6 ms to minimize.
[2024-05-24 16:03:35] [INFO ] Deduced a trap composed of 188 places in 516 ms of which 7 ms to minimize.
[2024-05-24 16:03:35] [INFO ] Deduced a trap composed of 366 places in 511 ms of which 6 ms to minimize.
[2024-05-24 16:03:36] [INFO ] Deduced a trap composed of 158 places in 492 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1007 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 16:03:37] [INFO ] Deduced a trap composed of 157 places in 523 ms of which 6 ms to minimize.
[2024-05-24 16:03:37] [INFO ] Deduced a trap composed of 179 places in 487 ms of which 7 ms to minimize.
[2024-05-24 16:03:38] [INFO ] Deduced a trap composed of 179 places in 530 ms of which 6 ms to minimize.
[2024-05-24 16:03:38] [INFO ] Deduced a trap composed of 71 places in 518 ms of which 6 ms to minimize.
[2024-05-24 16:03:39] [INFO ] Deduced a trap composed of 71 places in 502 ms of which 7 ms to minimize.
[2024-05-24 16:03:40] [INFO ] Deduced a trap composed of 218 places in 522 ms of which 7 ms to minimize.
[2024-05-24 16:03:40] [INFO ] Deduced a trap composed of 223 places in 524 ms of which 7 ms to minimize.
[2024-05-24 16:03:41] [INFO ] Deduced a trap composed of 222 places in 526 ms of which 7 ms to minimize.
[2024-05-24 16:03:41] [INFO ] Deduced a trap composed of 218 places in 522 ms of which 6 ms to minimize.
[2024-05-24 16:03:42] [INFO ] Deduced a trap composed of 382 places in 522 ms of which 6 ms to minimize.
[2024-05-24 16:03:42] [INFO ] Deduced a trap composed of 428 places in 511 ms of which 7 ms to minimize.
[2024-05-24 16:03:43] [INFO ] Deduced a trap composed of 477 places in 532 ms of which 6 ms to minimize.
[2024-05-24 16:03:43] [INFO ] Deduced a trap composed of 399 places in 528 ms of which 6 ms to minimize.
[2024-05-24 16:03:44] [INFO ] Deduced a trap composed of 198 places in 517 ms of which 7 ms to minimize.
[2024-05-24 16:03:44] [INFO ] Deduced a trap composed of 418 places in 439 ms of which 6 ms to minimize.
[2024-05-24 16:03:45] [INFO ] Deduced a trap composed of 199 places in 521 ms of which 7 ms to minimize.
[2024-05-24 16:03:46] [INFO ] Deduced a trap composed of 281 places in 522 ms of which 6 ms to minimize.
[2024-05-24 16:03:46] [INFO ] Deduced a trap composed of 199 places in 521 ms of which 7 ms to minimize.
[2024-05-24 16:03:47] [INFO ] Deduced a trap composed of 451 places in 464 ms of which 6 ms to minimize.
[2024-05-24 16:03:47] [INFO ] Deduced a trap composed of 218 places in 469 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1007 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 16:03:48] [INFO ] Deduced a trap composed of 196 places in 520 ms of which 7 ms to minimize.
[2024-05-24 16:03:48] [INFO ] Deduced a trap composed of 394 places in 440 ms of which 6 ms to minimize.
[2024-05-24 16:03:49] [INFO ] Deduced a trap composed of 164 places in 529 ms of which 7 ms to minimize.
[2024-05-24 16:03:49] [INFO ] Deduced a trap composed of 483 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:03:50] [INFO ] Deduced a trap composed of 213 places in 519 ms of which 6 ms to minimize.
[2024-05-24 16:03:51] [INFO ] Deduced a trap composed of 261 places in 506 ms of which 6 ms to minimize.
[2024-05-24 16:03:51] [INFO ] Deduced a trap composed of 199 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:03:52] [INFO ] Deduced a trap composed of 211 places in 523 ms of which 7 ms to minimize.
[2024-05-24 16:03:52] [INFO ] Deduced a trap composed of 70 places in 512 ms of which 6 ms to minimize.
[2024-05-24 16:03:53] [INFO ] Deduced a trap composed of 499 places in 531 ms of which 6 ms to minimize.
[2024-05-24 16:03:53] [INFO ] Deduced a trap composed of 182 places in 526 ms of which 7 ms to minimize.
[2024-05-24 16:03:54] [INFO ] Deduced a trap composed of 199 places in 507 ms of which 7 ms to minimize.
[2024-05-24 16:03:54] [INFO ] Deduced a trap composed of 294 places in 452 ms of which 6 ms to minimize.
[2024-05-24 16:03:55] [INFO ] Deduced a trap composed of 335 places in 520 ms of which 8 ms to minimize.
[2024-05-24 16:03:55] [INFO ] Deduced a trap composed of 182 places in 522 ms of which 7 ms to minimize.
[2024-05-24 16:03:56] [INFO ] Deduced a trap composed of 184 places in 525 ms of which 7 ms to minimize.
[2024-05-24 16:03:57] [INFO ] Deduced a trap composed of 194 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:03:57] [INFO ] Deduced a trap composed of 311 places in 456 ms of which 6 ms to minimize.
[2024-05-24 16:03:58] [INFO ] Deduced a trap composed of 290 places in 530 ms of which 6 ms to minimize.
[2024-05-24 16:03:58] [INFO ] Deduced a trap composed of 374 places in 533 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1007 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 16:03:59] [INFO ] Deduced a trap composed of 138 places in 523 ms of which 7 ms to minimize.
[2024-05-24 16:03:59] [INFO ] Deduced a trap composed of 165 places in 524 ms of which 6 ms to minimize.
[2024-05-24 16:04:00] [INFO ] Deduced a trap composed of 137 places in 523 ms of which 6 ms to minimize.
[2024-05-24 16:04:00] [INFO ] Deduced a trap composed of 148 places in 531 ms of which 6 ms to minimize.
[2024-05-24 16:04:01] [INFO ] Deduced a trap composed of 256 places in 525 ms of which 6 ms to minimize.
[2024-05-24 16:04:02] [INFO ] Deduced a trap composed of 242 places in 515 ms of which 7 ms to minimize.
[2024-05-24 16:04:02] [INFO ] Deduced a trap composed of 287 places in 517 ms of which 6 ms to minimize.
[2024-05-24 16:04:03] [INFO ] Deduced a trap composed of 436 places in 515 ms of which 7 ms to minimize.
[2024-05-24 16:04:03] [INFO ] Deduced a trap composed of 165 places in 522 ms of which 6 ms to minimize.
[2024-05-24 16:04:04] [INFO ] Deduced a trap composed of 245 places in 503 ms of which 6 ms to minimize.
[2024-05-24 16:04:04] [INFO ] Deduced a trap composed of 321 places in 522 ms of which 6 ms to minimize.
[2024-05-24 16:04:05] [INFO ] Deduced a trap composed of 256 places in 521 ms of which 6 ms to minimize.
[2024-05-24 16:04:05] [INFO ] Deduced a trap composed of 371 places in 532 ms of which 6 ms to minimize.
[2024-05-24 16:04:06] [INFO ] Deduced a trap composed of 418 places in 530 ms of which 6 ms to minimize.
[2024-05-24 16:04:07] [INFO ] Deduced a trap composed of 307 places in 521 ms of which 6 ms to minimize.
[2024-05-24 16:04:07] [INFO ] Deduced a trap composed of 304 places in 515 ms of which 6 ms to minimize.
[2024-05-24 16:04:08] [INFO ] Deduced a trap composed of 318 places in 514 ms of which 7 ms to minimize.
[2024-05-24 16:04:08] [INFO ] Deduced a trap composed of 159 places in 506 ms of which 6 ms to minimize.
[2024-05-24 16:04:09] [INFO ] Deduced a trap composed of 301 places in 530 ms of which 6 ms to minimize.
[2024-05-24 16:04:09] [INFO ] Deduced a trap composed of 538 places in 533 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1007 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 16:04:10] [INFO ] Deduced a trap composed of 388 places in 507 ms of which 6 ms to minimize.
[2024-05-24 16:04:11] [INFO ] Deduced a trap composed of 159 places in 522 ms of which 7 ms to minimize.
[2024-05-24 16:04:11] [INFO ] Deduced a trap composed of 169 places in 506 ms of which 6 ms to minimize.
[2024-05-24 16:04:12] [INFO ] Deduced a trap composed of 168 places in 510 ms of which 7 ms to minimize.
[2024-05-24 16:04:12] [INFO ] Deduced a trap composed of 154 places in 508 ms of which 6 ms to minimize.
[2024-05-24 16:04:13] [INFO ] Deduced a trap composed of 158 places in 515 ms of which 6 ms to minimize.
[2024-05-24 16:04:14] [INFO ] Deduced a trap composed of 159 places in 506 ms of which 6 ms to minimize.
[2024-05-24 16:04:14] [INFO ] Deduced a trap composed of 168 places in 506 ms of which 7 ms to minimize.
[2024-05-24 16:04:15] [INFO ] Deduced a trap composed of 197 places in 511 ms of which 6 ms to minimize.
[2024-05-24 16:04:15] [INFO ] Deduced a trap composed of 153 places in 511 ms of which 6 ms to minimize.
[2024-05-24 16:04:16] [INFO ] Deduced a trap composed of 273 places in 509 ms of which 6 ms to minimize.
[2024-05-24 16:04:16] [INFO ] Deduced a trap composed of 220 places in 518 ms of which 6 ms to minimize.
[2024-05-24 16:04:17] [INFO ] Deduced a trap composed of 118 places in 505 ms of which 6 ms to minimize.
[2024-05-24 16:04:17] [INFO ] Deduced a trap composed of 392 places in 538 ms of which 7 ms to minimize.
[2024-05-24 16:04:18] [INFO ] Deduced a trap composed of 170 places in 520 ms of which 6 ms to minimize.
[2024-05-24 16:04:18] [INFO ] Deduced a trap composed of 487 places in 527 ms of which 6 ms to minimize.
[2024-05-24 16:04:19] [INFO ] Deduced a trap composed of 518 places in 528 ms of which 6 ms to minimize.
[2024-05-24 16:04:20] [INFO ] Deduced a trap composed of 386 places in 511 ms of which 6 ms to minimize.
[2024-05-24 16:04:20] [INFO ] Deduced a trap composed of 335 places in 529 ms of which 7 ms to minimize.
[2024-05-24 16:04:21] [INFO ] Deduced a trap composed of 328 places in 521 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1007 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 16:04:22] [INFO ] Deduced a trap composed of 223 places in 532 ms of which 6 ms to minimize.
[2024-05-24 16:04:22] [INFO ] Deduced a trap composed of 190 places in 537 ms of which 6 ms to minimize.
[2024-05-24 16:04:23] [INFO ] Deduced a trap composed of 219 places in 520 ms of which 6 ms to minimize.
[2024-05-24 16:04:23] [INFO ] Deduced a trap composed of 181 places in 522 ms of which 6 ms to minimize.
[2024-05-24 16:04:24] [INFO ] Deduced a trap composed of 200 places in 531 ms of which 6 ms to minimize.
[2024-05-24 16:04:24] [INFO ] Deduced a trap composed of 203 places in 519 ms of which 7 ms to minimize.
[2024-05-24 16:04:25] [INFO ] Deduced a trap composed of 172 places in 545 ms of which 7 ms to minimize.
[2024-05-24 16:04:26] [INFO ] Deduced a trap composed of 239 places in 530 ms of which 7 ms to minimize.
[2024-05-24 16:04:26] [INFO ] Deduced a trap composed of 197 places in 494 ms of which 6 ms to minimize.
[2024-05-24 16:04:27] [INFO ] Deduced a trap composed of 222 places in 512 ms of which 7 ms to minimize.
[2024-05-24 16:04:27] [INFO ] Deduced a trap composed of 228 places in 511 ms of which 6 ms to minimize.
[2024-05-24 16:04:28] [INFO ] Deduced a trap composed of 209 places in 503 ms of which 6 ms to minimize.
[2024-05-24 16:04:28] [INFO ] Deduced a trap composed of 205 places in 528 ms of which 6 ms to minimize.
[2024-05-24 16:04:29] [INFO ] Deduced a trap composed of 231 places in 501 ms of which 6 ms to minimize.
[2024-05-24 16:04:29] [INFO ] Deduced a trap composed of 211 places in 525 ms of which 6 ms to minimize.
[2024-05-24 16:04:30] [INFO ] Deduced a trap composed of 193 places in 523 ms of which 7 ms to minimize.
[2024-05-24 16:04:30] [INFO ] Deduced a trap composed of 478 places in 429 ms of which 6 ms to minimize.
[2024-05-24 16:04:31] [INFO ] Deduced a trap composed of 421 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:04:31] [INFO ] Deduced a trap composed of 240 places in 504 ms of which 6 ms to minimize.
[2024-05-24 16:04:32] [INFO ] Deduced a trap composed of 227 places in 515 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1007 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 16:04:33] [INFO ] Deduced a trap composed of 149 places in 522 ms of which 6 ms to minimize.
[2024-05-24 16:04:33] [INFO ] Deduced a trap composed of 139 places in 524 ms of which 6 ms to minimize.
[2024-05-24 16:04:34] [INFO ] Deduced a trap composed of 141 places in 498 ms of which 5 ms to minimize.
[2024-05-24 16:04:34] [INFO ] Deduced a trap composed of 160 places in 526 ms of which 6 ms to minimize.
[2024-05-24 16:04:35] [INFO ] Deduced a trap composed of 199 places in 521 ms of which 6 ms to minimize.
[2024-05-24 16:04:36] [INFO ] Deduced a trap composed of 206 places in 526 ms of which 7 ms to minimize.
[2024-05-24 16:04:36] [INFO ] Deduced a trap composed of 183 places in 486 ms of which 6 ms to minimize.
[2024-05-24 16:04:37] [INFO ] Deduced a trap composed of 479 places in 507 ms of which 7 ms to minimize.
[2024-05-24 16:04:37] [INFO ] Deduced a trap composed of 403 places in 543 ms of which 6 ms to minimize.
[2024-05-24 16:04:38] [INFO ] Deduced a trap composed of 218 places in 527 ms of which 6 ms to minimize.
[2024-05-24 16:04:38] [INFO ] Deduced a trap composed of 202 places in 531 ms of which 6 ms to minimize.
[2024-05-24 16:04:39] [INFO ] Deduced a trap composed of 193 places in 522 ms of which 7 ms to minimize.
[2024-05-24 16:04:39] [INFO ] Deduced a trap composed of 446 places in 426 ms of which 6 ms to minimize.
[2024-05-24 16:04:40] [INFO ] Deduced a trap composed of 515 places in 444 ms of which 6 ms to minimize.
[2024-05-24 16:04:40] [INFO ] Deduced a trap composed of 214 places in 523 ms of which 6 ms to minimize.
SMT process timed out in 75485ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 36 out of 1087 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1087/1087 places, 3294/3294 transitions.
Applied a total of 0 rules in 85 ms. Remains 1087 /1087 variables (removed 0) and now considering 3294/3294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 1087/1087 places, 3294/3294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1087/1087 places, 3294/3294 transitions.
Applied a total of 0 rules in 86 ms. Remains 1087 /1087 variables (removed 0) and now considering 3294/3294 (removed 0) transitions.
[2024-05-24 16:04:40] [INFO ] Flow matrix only has 2921 transitions (discarded 373 similar events)
[2024-05-24 16:04:40] [INFO ] Invariant cache hit.
[2024-05-24 16:04:42] [INFO ] Implicit Places using invariants in 1120 ms returned [83, 84, 136, 144, 245, 320, 354, 403, 404, 441, 442, 454, 461, 462, 492, 501, 502, 518, 536, 543, 552, 553, 554, 574, 613, 614, 634, 648, 655, 680, 709, 777, 825, 909]
[2024-05-24 16:04:42] [INFO ] Actually due to overlaps returned [136, 454, 536, 83, 84, 144, 245, 320, 354, 403, 404, 441, 442, 461, 462, 492, 501, 502, 518, 543, 552, 553, 554, 574, 613, 614, 634, 655, 680, 709, 777]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 1125 ms to find 31 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1056/1087 places, 3294/3294 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 1035 transition count 3273
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 1035 transition count 3273
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 63 place count 1014 transition count 3252
Iterating global reduction 0 with 21 rules applied. Total rules applied 84 place count 1014 transition count 3252
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 1014 transition count 3250
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 88 place count 1012 transition count 3250
Applied a total of 88 rules in 227 ms. Remains 1012 /1056 variables (removed 44) and now considering 3250/3294 (removed 44) transitions.
[2024-05-24 16:04:42] [INFO ] Flow matrix only has 2877 transitions (discarded 373 similar events)
// Phase 1: matrix 2877 rows 1012 cols
[2024-05-24 16:04:42] [INFO ] Computed 48 invariants in 58 ms
[2024-05-24 16:04:43] [INFO ] Implicit Places using invariants in 1094 ms returned [603, 771, 855]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 1097 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1009/1087 places, 3250/3294 transitions.
Applied a total of 0 rules in 78 ms. Remains 1009 /1009 variables (removed 0) and now considering 3250/3250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2615 ms. Remains : 1009/1087 places, 3250/3294 transitions.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 16:04:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-24 16:04:43] [INFO ] Flatten gal took : 100 ms
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 16:04:43] [INFO ] Flatten gal took : 104 ms
[2024-05-24 16:04:43] [INFO ] Input system was already deterministic with 3025 transitions.
Support contains 82 out of 1382 places (down from 85) after GAL structural reductions.
Computed a total of 550 stabilizing places and 1392 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 3025/3025 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 1335 transition count 2930
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 1335 transition count 2930
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 129 place count 1300 transition count 2839
Iterating global reduction 0 with 35 rules applied. Total rules applied 164 place count 1300 transition count 2839
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 183 place count 1281 transition count 2744
Iterating global reduction 0 with 19 rules applied. Total rules applied 202 place count 1281 transition count 2744
Applied a total of 202 rules in 200 ms. Remains 1281 /1382 variables (removed 101) and now considering 2744/3025 (removed 281) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 1281/1382 places, 2744/3025 transitions.
[2024-05-24 16:04:44] [INFO ] Flatten gal took : 76 ms
[2024-05-24 16:04:44] [INFO ] Flatten gal took : 85 ms
[2024-05-24 16:04:44] [INFO ] Input system was already deterministic with 2744 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 3025/3025 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 1339 transition count 2938
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 1339 transition count 2938
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 118 place count 1307 transition count 2854
Iterating global reduction 0 with 32 rules applied. Total rules applied 150 place count 1307 transition count 2854
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 167 place count 1290 transition count 2769
Iterating global reduction 0 with 17 rules applied. Total rules applied 184 place count 1290 transition count 2769
Applied a total of 184 rules in 192 ms. Remains 1290 /1382 variables (removed 92) and now considering 2769/3025 (removed 256) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 1290/1382 places, 2769/3025 transitions.
[2024-05-24 16:04:44] [INFO ] Flatten gal took : 83 ms
[2024-05-24 16:04:44] [INFO ] Flatten gal took : 80 ms
[2024-05-24 16:04:45] [INFO ] Input system was already deterministic with 2769 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 3025/3025 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 1337 transition count 2936
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 1337 transition count 2936
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 124 place count 1303 transition count 2850
Iterating global reduction 0 with 34 rules applied. Total rules applied 158 place count 1303 transition count 2850
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 177 place count 1284 transition count 2755
Iterating global reduction 0 with 19 rules applied. Total rules applied 196 place count 1284 transition count 2755
Applied a total of 196 rules in 193 ms. Remains 1284 /1382 variables (removed 98) and now considering 2755/3025 (removed 270) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 1284/1382 places, 2755/3025 transitions.
[2024-05-24 16:04:45] [INFO ] Flatten gal took : 65 ms
[2024-05-24 16:04:45] [INFO ] Flatten gal took : 74 ms
[2024-05-24 16:04:45] [INFO ] Input system was already deterministic with 2755 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1382/1382 places, 3025/3025 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1382 transition count 2999
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1356 transition count 2999
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 52 place count 1356 transition count 2964
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 122 place count 1321 transition count 2964
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 153 place count 1290 transition count 2885
Iterating global reduction 2 with 31 rules applied. Total rules applied 184 place count 1290 transition count 2885
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 184 place count 1290 transition count 2884
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 186 place count 1289 transition count 2884
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 203 place count 1272 transition count 2811
Iterating global reduction 2 with 17 rules applied. Total rules applied 220 place count 1272 transition count 2811
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 222 place count 1270 transition count 2801
Iterating global reduction 2 with 2 rules applied. Total rules applied 224 place count 1270 transition count 2801
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 286 place count 1239 transition count 2770
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 303 place count 1222 transition count 2753
Iterating global reduction 2 with 17 rules applied. Total rules applied 320 place count 1222 transition count 2753
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 337 place count 1205 transition count 2668
Iterating global reduction 2 with 17 rules applied. Total rules applied 354 place count 1205 transition count 2668
Applied a total of 354 rules in 573 ms. Remains 1205 /1382 variables (removed 177) and now considering 2668/3025 (removed 357) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 574 ms. Remains : 1205/1382 places, 2668/3025 transitions.
[2024-05-24 16:04:46] [INFO ] Flatten gal took : 58 ms
[2024-05-24 16:04:46] [INFO ] Flatten gal took : 64 ms
[2024-05-24 16:04:46] [INFO ] Input system was already deterministic with 2668 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1382/1382 places, 3025/3025 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1382 transition count 2999
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1356 transition count 2999
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 52 place count 1356 transition count 2964
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 122 place count 1321 transition count 2964
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 152 place count 1291 transition count 2890
Iterating global reduction 2 with 30 rules applied. Total rules applied 182 place count 1291 transition count 2890
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 182 place count 1291 transition count 2889
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 184 place count 1290 transition count 2889
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 202 place count 1272 transition count 2811
Iterating global reduction 2 with 18 rules applied. Total rules applied 220 place count 1272 transition count 2811
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 222 place count 1270 transition count 2801
Iterating global reduction 2 with 2 rules applied. Total rules applied 224 place count 1270 transition count 2801
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 290 place count 1237 transition count 2768
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 307 place count 1220 transition count 2751
Iterating global reduction 2 with 17 rules applied. Total rules applied 324 place count 1220 transition count 2751
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 341 place count 1203 transition count 2666
Iterating global reduction 2 with 17 rules applied. Total rules applied 358 place count 1203 transition count 2666
Applied a total of 358 rules in 486 ms. Remains 1203 /1382 variables (removed 179) and now considering 2666/3025 (removed 359) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 489 ms. Remains : 1203/1382 places, 2666/3025 transitions.
[2024-05-24 16:04:46] [INFO ] Flatten gal took : 57 ms
[2024-05-24 16:04:46] [INFO ] Flatten gal took : 65 ms
[2024-05-24 16:04:47] [INFO ] Input system was already deterministic with 2666 transitions.
RANDOM walk for 36977 steps (983 resets) in 302 ms. (122 steps per ms) remains 0/1 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C05-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 1382/1382 places, 3025/3025 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1382 transition count 2999
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1356 transition count 2999
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 52 place count 1356 transition count 2964
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 122 place count 1321 transition count 2964
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 153 place count 1290 transition count 2885
Iterating global reduction 2 with 31 rules applied. Total rules applied 184 place count 1290 transition count 2885
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 184 place count 1290 transition count 2884
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 186 place count 1289 transition count 2884
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 204 place count 1271 transition count 2806
Iterating global reduction 2 with 18 rules applied. Total rules applied 222 place count 1271 transition count 2806
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 224 place count 1269 transition count 2796
Iterating global reduction 2 with 2 rules applied. Total rules applied 226 place count 1269 transition count 2796
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 290 place count 1237 transition count 2764
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 307 place count 1220 transition count 2747
Iterating global reduction 2 with 17 rules applied. Total rules applied 324 place count 1220 transition count 2747
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 341 place count 1203 transition count 2662
Iterating global reduction 2 with 17 rules applied. Total rules applied 358 place count 1203 transition count 2662
Applied a total of 358 rules in 444 ms. Remains 1203 /1382 variables (removed 179) and now considering 2662/3025 (removed 363) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 444 ms. Remains : 1203/1382 places, 2662/3025 transitions.
[2024-05-24 16:04:47] [INFO ] Flatten gal took : 67 ms
[2024-05-24 16:04:47] [INFO ] Flatten gal took : 64 ms
[2024-05-24 16:04:47] [INFO ] Input system was already deterministic with 2662 transitions.
RANDOM walk for 40000 steps (1066 resets) in 315 ms. (126 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (216 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 71254 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 71254 steps, saw 31242 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 16:04:51] [INFO ] Flow matrix only has 2390 transitions (discarded 272 similar events)
// Phase 1: matrix 2390 rows 1203 cols
[2024-05-24 16:04:51] [INFO ] Computed 79 invariants in 26 ms
[2024-05-24 16:04:51] [INFO ] State equation strengthened by 910 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1083/1085 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1085 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/1103 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:04:51] [INFO ] Deduced a trap composed of 295 places in 473 ms of which 7 ms to minimize.
[2024-05-24 16:04:52] [INFO ] Deduced a trap composed of 295 places in 479 ms of which 7 ms to minimize.
[2024-05-24 16:04:52] [INFO ] Deduced a trap composed of 240 places in 484 ms of which 6 ms to minimize.
[2024-05-24 16:04:53] [INFO ] Deduced a trap composed of 232 places in 494 ms of which 8 ms to minimize.
[2024-05-24 16:04:53] [INFO ] Deduced a trap composed of 429 places in 478 ms of which 7 ms to minimize.
[2024-05-24 16:04:54] [INFO ] Deduced a trap composed of 170 places in 491 ms of which 7 ms to minimize.
[2024-05-24 16:04:54] [INFO ] Deduced a trap composed of 265 places in 519 ms of which 7 ms to minimize.
[2024-05-24 16:04:55] [INFO ] Deduced a trap composed of 213 places in 491 ms of which 7 ms to minimize.
[2024-05-24 16:04:55] [INFO ] Deduced a trap composed of 271 places in 488 ms of which 7 ms to minimize.
[2024-05-24 16:04:56] [INFO ] Deduced a trap composed of 519 places in 476 ms of which 7 ms to minimize.
SMT process timed out in 5321ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1203/1203 places, 2662/2662 transitions.
Free-agglomeration rule (complex) applied 143 times.
Iterating global reduction 0 with 143 rules applied. Total rules applied 143 place count 1203 transition count 3295
Reduce places removed 143 places and 0 transitions.
Iterating post reduction 0 with 143 rules applied. Total rules applied 286 place count 1060 transition count 3295
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 1 with 29 rules applied. Total rules applied 315 place count 1060 transition count 3295
Applied a total of 315 rules in 268 ms. Remains 1060 /1203 variables (removed 143) and now considering 3295/2662 (removed -633) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 1060/1203 places, 3295/2662 transitions.
RANDOM walk for 4000000 steps (127251 resets) in 46769 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (21141 resets) in 10137 ms. (394 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 943583 steps, run timeout after 42001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 943583 steps, saw 394477 distinct states, run finished after 42001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-24 16:05:52] [INFO ] Flow matrix only has 2903 transitions (discarded 392 similar events)
// Phase 1: matrix 2903 rows 1060 cols
[2024-05-24 16:05:52] [INFO ] Computed 79 invariants in 37 ms
[2024-05-24 16:05:53] [INFO ] State equation strengthened by 1686 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 940/942 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/942 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/960 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:05:53] [INFO ] Deduced a trap composed of 235 places in 525 ms of which 7 ms to minimize.
[2024-05-24 16:05:54] [INFO ] Deduced a trap composed of 297 places in 503 ms of which 6 ms to minimize.
[2024-05-24 16:05:54] [INFO ] Deduced a trap composed of 228 places in 506 ms of which 6 ms to minimize.
[2024-05-24 16:05:55] [INFO ] Deduced a trap composed of 345 places in 522 ms of which 6 ms to minimize.
[2024-05-24 16:05:55] [INFO ] Deduced a trap composed of 675 places in 491 ms of which 6 ms to minimize.
[2024-05-24 16:05:56] [INFO ] Deduced a trap composed of 669 places in 505 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/960 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/960 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1022 variables, 36/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:05:56] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 2 ms to minimize.
[2024-05-24 16:05:56] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-05-24 16:05:57] [INFO ] Deduced a trap composed of 106 places in 496 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1022 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1022 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 28/1050 variables, 28/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1050 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/1060 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:05:57] [INFO ] Deduced a trap composed of 131 places in 521 ms of which 7 ms to minimize.
[2024-05-24 16:05:58] [INFO ] Deduced a trap composed of 46 places in 510 ms of which 6 ms to minimize.
[2024-05-24 16:05:58] [INFO ] Deduced a trap composed of 62 places in 509 ms of which 7 ms to minimize.
[2024-05-24 16:05:59] [INFO ] Deduced a trap composed of 62 places in 527 ms of which 7 ms to minimize.
[2024-05-24 16:05:59] [INFO ] Deduced a trap composed of 125 places in 515 ms of which 7 ms to minimize.
[2024-05-24 16:06:00] [INFO ] Deduced a trap composed of 82 places in 535 ms of which 6 ms to minimize.
[2024-05-24 16:06:01] [INFO ] Deduced a trap composed of 135 places in 520 ms of which 7 ms to minimize.
[2024-05-24 16:06:01] [INFO ] Deduced a trap composed of 123 places in 503 ms of which 6 ms to minimize.
[2024-05-24 16:06:02] [INFO ] Deduced a trap composed of 178 places in 530 ms of which 7 ms to minimize.
[2024-05-24 16:06:02] [INFO ] Deduced a trap composed of 126 places in 556 ms of which 6 ms to minimize.
[2024-05-24 16:06:03] [INFO ] Deduced a trap composed of 122 places in 574 ms of which 6 ms to minimize.
[2024-05-24 16:06:03] [INFO ] Deduced a trap composed of 123 places in 554 ms of which 6 ms to minimize.
[2024-05-24 16:06:04] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 2 ms to minimize.
[2024-05-24 16:06:04] [INFO ] Deduced a trap composed of 62 places in 529 ms of which 6 ms to minimize.
[2024-05-24 16:06:05] [INFO ] Deduced a trap composed of 127 places in 568 ms of which 7 ms to minimize.
[2024-05-24 16:06:05] [INFO ] Deduced a trap composed of 149 places in 491 ms of which 6 ms to minimize.
[2024-05-24 16:06:06] [INFO ] Deduced a trap composed of 155 places in 465 ms of which 6 ms to minimize.
[2024-05-24 16:06:06] [INFO ] Deduced a trap composed of 71 places in 458 ms of which 6 ms to minimize.
[2024-05-24 16:06:07] [INFO ] Deduced a trap composed of 111 places in 553 ms of which 7 ms to minimize.
[2024-05-24 16:06:07] [INFO ] Deduced a trap composed of 115 places in 561 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1060 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:06:08] [INFO ] Deduced a trap composed of 111 places in 572 ms of which 7 ms to minimize.
[2024-05-24 16:06:09] [INFO ] Deduced a trap composed of 103 places in 561 ms of which 7 ms to minimize.
[2024-05-24 16:06:09] [INFO ] Deduced a trap composed of 159 places in 504 ms of which 7 ms to minimize.
[2024-05-24 16:06:10] [INFO ] Deduced a trap composed of 199 places in 483 ms of which 6 ms to minimize.
[2024-05-24 16:06:10] [INFO ] Deduced a trap composed of 97 places in 521 ms of which 7 ms to minimize.
[2024-05-24 16:06:11] [INFO ] Deduced a trap composed of 117 places in 562 ms of which 7 ms to minimize.
[2024-05-24 16:06:11] [INFO ] Deduced a trap composed of 110 places in 560 ms of which 7 ms to minimize.
[2024-05-24 16:06:12] [INFO ] Deduced a trap composed of 105 places in 568 ms of which 6 ms to minimize.
[2024-05-24 16:06:12] [INFO ] Deduced a trap composed of 108 places in 564 ms of which 7 ms to minimize.
[2024-05-24 16:06:13] [INFO ] Deduced a trap composed of 142 places in 496 ms of which 6 ms to minimize.
[2024-05-24 16:06:13] [INFO ] Deduced a trap composed of 132 places in 504 ms of which 6 ms to minimize.
[2024-05-24 16:06:14] [INFO ] Deduced a trap composed of 141 places in 487 ms of which 6 ms to minimize.
[2024-05-24 16:06:15] [INFO ] Deduced a trap composed of 105 places in 577 ms of which 6 ms to minimize.
[2024-05-24 16:06:15] [INFO ] Deduced a trap composed of 155 places in 497 ms of which 7 ms to minimize.
[2024-05-24 16:06:16] [INFO ] Deduced a trap composed of 115 places in 575 ms of which 6 ms to minimize.
[2024-05-24 16:06:16] [INFO ] Deduced a trap composed of 131 places in 572 ms of which 6 ms to minimize.
[2024-05-24 16:06:17] [INFO ] Deduced a trap composed of 123 places in 566 ms of which 6 ms to minimize.
[2024-05-24 16:06:17] [INFO ] Deduced a trap composed of 170 places in 485 ms of which 6 ms to minimize.
[2024-05-24 16:06:18] [INFO ] Deduced a trap composed of 142 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:06:18] [INFO ] Deduced a trap composed of 141 places in 483 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1060 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:06:19] [INFO ] Deduced a trap composed of 155 places in 481 ms of which 6 ms to minimize.
[2024-05-24 16:06:19] [INFO ] Deduced a trap composed of 145 places in 485 ms of which 6 ms to minimize.
[2024-05-24 16:06:20] [INFO ] Deduced a trap composed of 149 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:06:20] [INFO ] Deduced a trap composed of 135 places in 560 ms of which 7 ms to minimize.
[2024-05-24 16:06:21] [INFO ] Deduced a trap composed of 147 places in 530 ms of which 6 ms to minimize.
[2024-05-24 16:06:22] [INFO ] Deduced a trap composed of 92 places in 549 ms of which 7 ms to minimize.
[2024-05-24 16:06:22] [INFO ] Deduced a trap composed of 96 places in 555 ms of which 6 ms to minimize.
[2024-05-24 16:06:23] [INFO ] Deduced a trap composed of 148 places in 470 ms of which 6 ms to minimize.
[2024-05-24 16:06:23] [INFO ] Deduced a trap composed of 159 places in 453 ms of which 6 ms to minimize.
[2024-05-24 16:06:24] [INFO ] Deduced a trap composed of 96 places in 565 ms of which 6 ms to minimize.
[2024-05-24 16:06:24] [INFO ] Deduced a trap composed of 92 places in 548 ms of which 7 ms to minimize.
[2024-05-24 16:06:25] [INFO ] Deduced a trap composed of 162 places in 470 ms of which 6 ms to minimize.
[2024-05-24 16:06:25] [INFO ] Deduced a trap composed of 164 places in 450 ms of which 6 ms to minimize.
[2024-05-24 16:06:26] [INFO ] Deduced a trap composed of 125 places in 523 ms of which 6 ms to minimize.
[2024-05-24 16:06:26] [INFO ] Deduced a trap composed of 139 places in 453 ms of which 6 ms to minimize.
[2024-05-24 16:06:27] [INFO ] Deduced a trap composed of 193 places in 531 ms of which 7 ms to minimize.
[2024-05-24 16:06:27] [INFO ] Deduced a trap composed of 103 places in 539 ms of which 6 ms to minimize.
[2024-05-24 16:06:28] [INFO ] Deduced a trap composed of 113 places in 543 ms of which 6 ms to minimize.
[2024-05-24 16:06:29] [INFO ] Deduced a trap composed of 97 places in 529 ms of which 6 ms to minimize.
[2024-05-24 16:06:29] [INFO ] Deduced a trap composed of 149 places in 463 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1060 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:06:29] [INFO ] Deduced a trap composed of 168 places in 442 ms of which 6 ms to minimize.
[2024-05-24 16:06:30] [INFO ] Deduced a trap composed of 139 places in 439 ms of which 6 ms to minimize.
[2024-05-24 16:06:30] [INFO ] Deduced a trap composed of 145 places in 453 ms of which 7 ms to minimize.
[2024-05-24 16:06:31] [INFO ] Deduced a trap composed of 140 places in 566 ms of which 6 ms to minimize.
[2024-05-24 16:06:32] [INFO ] Deduced a trap composed of 101 places in 507 ms of which 6 ms to minimize.
[2024-05-24 16:06:32] [INFO ] Deduced a trap composed of 112 places in 533 ms of which 6 ms to minimize.
[2024-05-24 16:06:33] [INFO ] Deduced a trap composed of 112 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:06:33] [INFO ] Deduced a trap composed of 100 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:06:34] [INFO ] Deduced a trap composed of 162 places in 455 ms of which 6 ms to minimize.
[2024-05-24 16:06:34] [INFO ] Deduced a trap composed of 144 places in 445 ms of which 6 ms to minimize.
[2024-05-24 16:06:35] [INFO ] Deduced a trap composed of 111 places in 522 ms of which 6 ms to minimize.
[2024-05-24 16:06:35] [INFO ] Deduced a trap composed of 122 places in 525 ms of which 7 ms to minimize.
[2024-05-24 16:06:36] [INFO ] Deduced a trap composed of 139 places in 524 ms of which 6 ms to minimize.
[2024-05-24 16:06:36] [INFO ] Deduced a trap composed of 150 places in 479 ms of which 6 ms to minimize.
[2024-05-24 16:06:37] [INFO ] Deduced a trap composed of 83 places in 575 ms of which 6 ms to minimize.
[2024-05-24 16:06:37] [INFO ] Deduced a trap composed of 72 places in 563 ms of which 6 ms to minimize.
[2024-05-24 16:06:38] [INFO ] Deduced a trap composed of 209 places in 468 ms of which 6 ms to minimize.
SMT process timed out in 45528ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1060/1060 places, 3295/3295 transitions.
Applied a total of 0 rules in 77 ms. Remains 1060 /1060 variables (removed 0) and now considering 3295/3295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 1060/1060 places, 3295/3295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1060/1060 places, 3295/3295 transitions.
Applied a total of 0 rules in 84 ms. Remains 1060 /1060 variables (removed 0) and now considering 3295/3295 (removed 0) transitions.
[2024-05-24 16:06:38] [INFO ] Flow matrix only has 2903 transitions (discarded 392 similar events)
[2024-05-24 16:06:38] [INFO ] Invariant cache hit.
[2024-05-24 16:06:39] [INFO ] Implicit Places using invariants in 1169 ms returned [82, 83, 133, 140, 239, 313, 347, 370, 394, 395, 430, 431, 442, 449, 450, 451, 478, 487, 488, 504, 522, 529, 538, 539, 540, 559, 597, 598, 617, 631, 638, 662, 690, 756, 803, 885]
[2024-05-24 16:06:39] [INFO ] Actually due to overlaps returned [133, 442, 522, 82, 83, 140, 239, 313, 347, 370, 394, 395, 430, 431, 449, 450, 451, 478, 487, 488, 504, 529, 538, 539, 540, 559, 597, 598, 617, 638, 662, 690, 756]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 1180 ms to find 33 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1027/1060 places, 3295/3295 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1005 transition count 3273
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1005 transition count 3273
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 983 transition count 3251
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 983 transition count 3251
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 983 transition count 3249
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 92 place count 981 transition count 3249
Applied a total of 92 rules in 214 ms. Remains 981 /1027 variables (removed 46) and now considering 3249/3295 (removed 46) transitions.
[2024-05-24 16:06:40] [INFO ] Flow matrix only has 2857 transitions (discarded 392 similar events)
// Phase 1: matrix 2857 rows 981 cols
[2024-05-24 16:06:40] [INFO ] Computed 46 invariants in 31 ms
[2024-05-24 16:06:41] [INFO ] Implicit Places using invariants in 996 ms returned [583, 746, 828]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 999 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 978/1060 places, 3249/3295 transitions.
Applied a total of 0 rules in 74 ms. Remains 978 /978 variables (removed 0) and now considering 3249/3249 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2551 ms. Remains : 978/1060 places, 3249/3295 transitions.
RANDOM walk for 4000000 steps (132144 resets) in 44671 ms. (89 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (16064 resets) in 7907 ms. (505 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 933000 steps, run timeout after 39001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 933000 steps, saw 386777 distinct states, run finished after 39001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 16:07:33] [INFO ] Flow matrix only has 2857 transitions (discarded 392 similar events)
// Phase 1: matrix 2857 rows 978 cols
[2024-05-24 16:07:33] [INFO ] Computed 43 invariants in 34 ms
[2024-05-24 16:07:33] [INFO ] State equation strengthened by 1686 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 892/894 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/894 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/912 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:07:33] [INFO ] Deduced a trap composed of 540 places in 467 ms of which 6 ms to minimize.
[2024-05-24 16:07:34] [INFO ] Deduced a trap composed of 102 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:07:34] [INFO ] Deduced a trap composed of 85 places in 457 ms of which 5 ms to minimize.
[2024-05-24 16:07:35] [INFO ] Deduced a trap composed of 92 places in 458 ms of which 6 ms to minimize.
[2024-05-24 16:07:35] [INFO ] Deduced a trap composed of 157 places in 476 ms of which 6 ms to minimize.
[2024-05-24 16:07:36] [INFO ] Deduced a trap composed of 102 places in 459 ms of which 6 ms to minimize.
[2024-05-24 16:07:36] [INFO ] Deduced a trap composed of 86 places in 461 ms of which 5 ms to minimize.
[2024-05-24 16:07:37] [INFO ] Deduced a trap composed of 135 places in 461 ms of which 6 ms to minimize.
[2024-05-24 16:07:37] [INFO ] Deduced a trap composed of 92 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:07:38] [INFO ] Deduced a trap composed of 116 places in 463 ms of which 6 ms to minimize.
[2024-05-24 16:07:38] [INFO ] Deduced a trap composed of 86 places in 461 ms of which 6 ms to minimize.
[2024-05-24 16:07:39] [INFO ] Deduced a trap composed of 183 places in 461 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/912 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/912 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/940 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:07:39] [INFO ] Deduced a trap composed of 5 places in 485 ms of which 6 ms to minimize.
[2024-05-24 16:07:40] [INFO ] Deduced a trap composed of 27 places in 482 ms of which 6 ms to minimize.
[2024-05-24 16:07:40] [INFO ] Deduced a trap composed of 46 places in 484 ms of which 6 ms to minimize.
[2024-05-24 16:07:41] [INFO ] Deduced a trap composed of 72 places in 494 ms of which 6 ms to minimize.
[2024-05-24 16:07:41] [INFO ] Deduced a trap composed of 77 places in 491 ms of which 6 ms to minimize.
[2024-05-24 16:07:42] [INFO ] Deduced a trap composed of 62 places in 482 ms of which 6 ms to minimize.
[2024-05-24 16:07:42] [INFO ] Deduced a trap composed of 83 places in 477 ms of which 6 ms to minimize.
[2024-05-24 16:07:43] [INFO ] Deduced a trap composed of 95 places in 481 ms of which 6 ms to minimize.
[2024-05-24 16:07:43] [INFO ] Deduced a trap composed of 88 places in 473 ms of which 6 ms to minimize.
[2024-05-24 16:07:44] [INFO ] Deduced a trap composed of 73 places in 481 ms of which 6 ms to minimize.
[2024-05-24 16:07:44] [INFO ] Deduced a trap composed of 71 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:07:45] [INFO ] Deduced a trap composed of 76 places in 483 ms of which 5 ms to minimize.
[2024-05-24 16:07:45] [INFO ] Deduced a trap composed of 76 places in 473 ms of which 6 ms to minimize.
[2024-05-24 16:07:46] [INFO ] Deduced a trap composed of 77 places in 476 ms of which 6 ms to minimize.
[2024-05-24 16:07:46] [INFO ] Deduced a trap composed of 85 places in 472 ms of which 5 ms to minimize.
[2024-05-24 16:07:47] [INFO ] Deduced a trap composed of 82 places in 478 ms of which 6 ms to minimize.
[2024-05-24 16:07:47] [INFO ] Deduced a trap composed of 80 places in 480 ms of which 6 ms to minimize.
[2024-05-24 16:07:48] [INFO ] Deduced a trap composed of 72 places in 468 ms of which 6 ms to minimize.
[2024-05-24 16:07:48] [INFO ] Deduced a trap composed of 67 places in 475 ms of which 6 ms to minimize.
[2024-05-24 16:07:49] [INFO ] Deduced a trap composed of 77 places in 462 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:07:49] [INFO ] Deduced a trap composed of 81 places in 479 ms of which 6 ms to minimize.
[2024-05-24 16:07:50] [INFO ] Deduced a trap composed of 88 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:07:50] [INFO ] Deduced a trap composed of 74 places in 475 ms of which 6 ms to minimize.
[2024-05-24 16:07:51] [INFO ] Deduced a trap composed of 85 places in 469 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/940 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/968 variables, 28/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/968 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/978 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/978 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2857/3835 variables, 978/1057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3835 variables, 1686/2743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3835 variables, 0/2743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3835 variables, 0/2743 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3835/3835 variables, and 2743 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19543 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 978/978 constraints, ReadFeed: 1686/1686 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 892/894 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/894 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/912 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/912 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:07:53] [INFO ] Deduced a trap composed of 157 places in 470 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/912 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/912 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/940 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/940 variables, 24/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:07:54] [INFO ] Deduced a trap composed of 27 places in 483 ms of which 6 ms to minimize.
[2024-05-24 16:07:54] [INFO ] Deduced a trap composed of 125 places in 474 ms of which 6 ms to minimize.
[2024-05-24 16:07:55] [INFO ] Deduced a trap composed of 138 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:07:55] [INFO ] Deduced a trap composed of 46 places in 481 ms of which 5 ms to minimize.
[2024-05-24 16:07:56] [INFO ] Deduced a trap composed of 78 places in 497 ms of which 6 ms to minimize.
[2024-05-24 16:07:56] [INFO ] Deduced a trap composed of 84 places in 494 ms of which 6 ms to minimize.
[2024-05-24 16:07:57] [INFO ] Deduced a trap composed of 102 places in 491 ms of which 6 ms to minimize.
[2024-05-24 16:07:57] [INFO ] Deduced a trap composed of 74 places in 486 ms of which 6 ms to minimize.
[2024-05-24 16:07:58] [INFO ] Deduced a trap composed of 82 places in 474 ms of which 5 ms to minimize.
[2024-05-24 16:07:58] [INFO ] Deduced a trap composed of 169 places in 487 ms of which 6 ms to minimize.
[2024-05-24 16:07:59] [INFO ] Deduced a trap composed of 166 places in 486 ms of which 7 ms to minimize.
[2024-05-24 16:07:59] [INFO ] Deduced a trap composed of 99 places in 482 ms of which 6 ms to minimize.
[2024-05-24 16:08:00] [INFO ] Deduced a trap composed of 138 places in 489 ms of which 5 ms to minimize.
[2024-05-24 16:08:00] [INFO ] Deduced a trap composed of 178 places in 482 ms of which 6 ms to minimize.
[2024-05-24 16:08:01] [INFO ] Deduced a trap composed of 187 places in 469 ms of which 6 ms to minimize.
[2024-05-24 16:08:01] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 2 ms to minimize.
[2024-05-24 16:08:01] [INFO ] Deduced a trap composed of 88 places in 475 ms of which 6 ms to minimize.
[2024-05-24 16:08:02] [INFO ] Deduced a trap composed of 93 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:08:02] [INFO ] Deduced a trap composed of 177 places in 478 ms of which 6 ms to minimize.
[2024-05-24 16:08:03] [INFO ] Deduced a trap composed of 83 places in 472 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:08:03] [INFO ] Deduced a trap composed of 79 places in 471 ms of which 6 ms to minimize.
[2024-05-24 16:08:04] [INFO ] Deduced a trap composed of 75 places in 469 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/940 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/940 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 28/968 variables, 28/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/968 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/978 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/978 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2857/3835 variables, 978/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3835 variables, 1686/2766 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3835 variables, 1/2767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3835 variables, 0/2767 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:08:09] [INFO ] Deduced a trap composed of 147 places in 445 ms of which 6 ms to minimize.
[2024-05-24 16:08:10] [INFO ] Deduced a trap composed of 103 places in 500 ms of which 6 ms to minimize.
At refinement iteration 20 (OVERLAPS) 0/3835 variables, 2/2769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3835 variables, 0/2769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/3835 variables, 0/2769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3835/3835 variables, and 2769 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18755 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 978/978 constraints, ReadFeed: 1686/1686 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 61/61 constraints]
After SMT, in 38387ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 2 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 3249/3249 transitions.
Applied a total of 0 rules in 77 ms. Remains 978 /978 variables (removed 0) and now considering 3249/3249 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 978/978 places, 3249/3249 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 3249/3249 transitions.
Applied a total of 0 rules in 78 ms. Remains 978 /978 variables (removed 0) and now considering 3249/3249 (removed 0) transitions.
[2024-05-24 16:08:11] [INFO ] Flow matrix only has 2857 transitions (discarded 392 similar events)
[2024-05-24 16:08:11] [INFO ] Invariant cache hit.
[2024-05-24 16:08:12] [INFO ] Implicit Places using invariants in 1007 ms returned []
[2024-05-24 16:08:12] [INFO ] Flow matrix only has 2857 transitions (discarded 392 similar events)
[2024-05-24 16:08:12] [INFO ] Invariant cache hit.
[2024-05-24 16:08:13] [INFO ] State equation strengthened by 1686 read => feed constraints.
[2024-05-24 16:08:37] [INFO ] Implicit Places using invariants and state equation in 24643 ms returned []
Implicit Place search using SMT with State Equation took 25651 ms to find 0 implicit places.
[2024-05-24 16:08:37] [INFO ] Redundant transitions in 183 ms returned []
Running 3187 sub problems to find dead transitions.
[2024-05-24 16:08:37] [INFO ] Flow matrix only has 2857 transitions (discarded 392 similar events)
[2024-05-24 16:08:37] [INFO ] Invariant cache hit.
[2024-05-24 16:08:37] [INFO ] State equation strengthened by 1686 read => feed constraints.
(s972 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 0.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 0.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 0.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 0.0)
(s549 0.0)
(s550 1.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 0.0)
(s567 0.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 0.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 1.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 1.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 0.0)
(s604 0.0)
(s605 1.0)
(s606 0.0)
(s607 1.0)
(s608 0.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 1.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 1.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 0.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 0.0)
(s660 0.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 0.0)
(s668 0.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 1.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 1.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 1.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 1.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 0.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 0.0)
(s732 0.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 0.0)
(s739 0.0)
(s740 1.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 1.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 1.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 1.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 1.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 1.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 1.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 1.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 1.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 1.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 0.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 0.0)
(s830 0.0)
(s831 1.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 1.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 1.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 1.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 1.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 1.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 1.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 1.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 1.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 1.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 1.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 1.0)
(s937 0.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3187 unsolved
SMT process timed out in 46768ms, After SMT, problems are : Problem set: 0 solved, 3187 unsolved
Search for dead transitions found 0 dead transitions in 46803ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72739 ms. Remains : 978/978 places, 3249/3249 transitions.
RANDOM walk for 400000 steps (13212 resets) in 6206 ms. (64 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-24 16:09:26] [INFO ] Flow matrix only has 2857 transitions (discarded 392 similar events)
[2024-05-24 16:09:26] [INFO ] Invariant cache hit.
[2024-05-24 16:09:26] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2024-05-24 16:09:26] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2024-05-24 16:09:26] [INFO ] After 648ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 16:09:26] [INFO ] State equation strengthened by 1686 read => feed constraints.
[2024-05-24 16:09:27] [INFO ] After 142ms SMT Verify possible using 1686 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 16:09:27] [INFO ] After 277ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 16:09:27] [INFO ] After 1085ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 16:09:27] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-24 16:09:27] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-24 16:09:28] [INFO ] After 644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 16:09:28] [INFO ] After 847ms SMT Verify possible using 1686 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 16:09:29] [INFO ] Deduced a trap composed of 77 places in 520 ms of which 6 ms to minimize.
[2024-05-24 16:09:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 667 ms
TRAPS : Iteration 1
[2024-05-24 16:09:29] [INFO ] After 1712ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 16:09:29] [INFO ] After 2484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (132144 resets) in 49659 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (16058 resets) in 8206 ms. (487 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1001187 steps, run timeout after 42001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 1001187 steps, saw 415033 distinct states, run finished after 42001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 16:10:26] [INFO ] Flow matrix only has 2857 transitions (discarded 392 similar events)
[2024-05-24 16:10:26] [INFO ] Invariant cache hit.
[2024-05-24 16:10:26] [INFO ] State equation strengthened by 1686 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 892/894 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/894 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/912 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:10:26] [INFO ] Deduced a trap composed of 540 places in 478 ms of which 6 ms to minimize.
[2024-05-24 16:10:27] [INFO ] Deduced a trap composed of 85 places in 462 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/912 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/912 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/940 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:10:27] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 2 ms to minimize.
[2024-05-24 16:10:27] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 3 ms to minimize.
[2024-05-24 16:10:28] [INFO ] Deduced a trap composed of 89 places in 502 ms of which 6 ms to minimize.
[2024-05-24 16:10:28] [INFO ] Deduced a trap composed of 46 places in 491 ms of which 6 ms to minimize.
[2024-05-24 16:10:29] [INFO ] Deduced a trap composed of 97 places in 493 ms of which 6 ms to minimize.
[2024-05-24 16:10:29] [INFO ] Deduced a trap composed of 105 places in 510 ms of which 6 ms to minimize.
[2024-05-24 16:10:30] [INFO ] Deduced a trap composed of 71 places in 507 ms of which 6 ms to minimize.
[2024-05-24 16:10:30] [INFO ] Deduced a trap composed of 75 places in 502 ms of which 6 ms to minimize.
[2024-05-24 16:10:31] [INFO ] Deduced a trap composed of 141 places in 506 ms of which 6 ms to minimize.
[2024-05-24 16:10:31] [INFO ] Deduced a trap composed of 85 places in 505 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/940 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/940 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 28/968 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/968 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/978 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/978 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2857/3835 variables, 978/1033 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3835 variables, 1686/2719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3835 variables, 0/2719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/3835 variables, 0/2719 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3835/3835 variables, and 2719 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6729 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 978/978 constraints, ReadFeed: 1686/1686 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 892/894 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/894 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/912 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/912 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:10:33] [INFO ] Deduced a trap composed of 85 places in 492 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/912 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/912 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/940 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/940 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:10:34] [INFO ] Deduced a trap composed of 27 places in 422 ms of which 6 ms to minimize.
[2024-05-24 16:10:34] [INFO ] Deduced a trap composed of 46 places in 415 ms of which 6 ms to minimize.
[2024-05-24 16:10:35] [INFO ] Deduced a trap composed of 62 places in 439 ms of which 6 ms to minimize.
[2024-05-24 16:10:35] [INFO ] Deduced a trap composed of 139 places in 454 ms of which 6 ms to minimize.
[2024-05-24 16:10:35] [INFO ] Deduced a trap composed of 62 places in 414 ms of which 6 ms to minimize.
[2024-05-24 16:10:36] [INFO ] Deduced a trap composed of 82 places in 422 ms of which 6 ms to minimize.
[2024-05-24 16:10:36] [INFO ] Deduced a trap composed of 168 places in 411 ms of which 6 ms to minimize.
[2024-05-24 16:10:37] [INFO ] Deduced a trap composed of 161 places in 419 ms of which 6 ms to minimize.
[2024-05-24 16:10:37] [INFO ] Deduced a trap composed of 159 places in 416 ms of which 5 ms to minimize.
[2024-05-24 16:10:38] [INFO ] Deduced a trap composed of 162 places in 405 ms of which 6 ms to minimize.
[2024-05-24 16:10:38] [INFO ] Deduced a trap composed of 162 places in 408 ms of which 6 ms to minimize.
[2024-05-24 16:10:38] [INFO ] Deduced a trap composed of 170 places in 406 ms of which 6 ms to minimize.
[2024-05-24 16:10:39] [INFO ] Deduced a trap composed of 203 places in 410 ms of which 6 ms to minimize.
[2024-05-24 16:10:39] [INFO ] Deduced a trap composed of 171 places in 417 ms of which 6 ms to minimize.
[2024-05-24 16:10:40] [INFO ] Deduced a trap composed of 46 places in 427 ms of which 6 ms to minimize.
[2024-05-24 16:10:40] [INFO ] Deduced a trap composed of 62 places in 441 ms of which 6 ms to minimize.
[2024-05-24 16:10:41] [INFO ] Deduced a trap composed of 159 places in 432 ms of which 5 ms to minimize.
[2024-05-24 16:10:41] [INFO ] Deduced a trap composed of 159 places in 425 ms of which 5 ms to minimize.
[2024-05-24 16:10:42] [INFO ] Deduced a trap composed of 159 places in 414 ms of which 6 ms to minimize.
[2024-05-24 16:10:42] [INFO ] Deduced a trap composed of 162 places in 423 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:10:42] [INFO ] Deduced a trap composed of 164 places in 424 ms of which 6 ms to minimize.
[2024-05-24 16:10:43] [INFO ] Deduced a trap composed of 165 places in 416 ms of which 6 ms to minimize.
[2024-05-24 16:10:43] [INFO ] Deduced a trap composed of 71 places in 437 ms of which 5 ms to minimize.
[2024-05-24 16:10:44] [INFO ] Deduced a trap composed of 97 places in 418 ms of which 6 ms to minimize.
[2024-05-24 16:10:44] [INFO ] Deduced a trap composed of 203 places in 417 ms of which 6 ms to minimize.
[2024-05-24 16:10:45] [INFO ] Deduced a trap composed of 205 places in 408 ms of which 6 ms to minimize.
[2024-05-24 16:10:45] [INFO ] Deduced a trap composed of 208 places in 424 ms of which 5 ms to minimize.
[2024-05-24 16:10:46] [INFO ] Deduced a trap composed of 205 places in 413 ms of which 5 ms to minimize.
[2024-05-24 16:10:46] [INFO ] Deduced a trap composed of 205 places in 401 ms of which 5 ms to minimize.
[2024-05-24 16:10:46] [INFO ] Deduced a trap composed of 206 places in 395 ms of which 5 ms to minimize.
[2024-05-24 16:10:47] [INFO ] Deduced a trap composed of 205 places in 403 ms of which 5 ms to minimize.
[2024-05-24 16:10:47] [INFO ] Deduced a trap composed of 142 places in 431 ms of which 6 ms to minimize.
[2024-05-24 16:10:48] [INFO ] Deduced a trap composed of 62 places in 414 ms of which 6 ms to minimize.
[2024-05-24 16:10:48] [INFO ] Deduced a trap composed of 88 places in 398 ms of which 6 ms to minimize.
[2024-05-24 16:10:49] [INFO ] Deduced a trap composed of 216 places in 407 ms of which 5 ms to minimize.
[2024-05-24 16:10:49] [INFO ] Deduced a trap composed of 223 places in 415 ms of which 6 ms to minimize.
[2024-05-24 16:10:49] [INFO ] Deduced a trap composed of 221 places in 405 ms of which 5 ms to minimize.
[2024-05-24 16:10:50] [INFO ] Deduced a trap composed of 104 places in 396 ms of which 6 ms to minimize.
[2024-05-24 16:10:50] [INFO ] Deduced a trap composed of 162 places in 406 ms of which 5 ms to minimize.
[2024-05-24 16:10:51] [INFO ] Deduced a trap composed of 163 places in 402 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/940 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:10:51] [INFO ] Deduced a trap composed of 155 places in 412 ms of which 6 ms to minimize.
[2024-05-24 16:10:51] [INFO ] Deduced a trap composed of 159 places in 403 ms of which 5 ms to minimize.
[2024-05-24 16:10:52] [INFO ] Deduced a trap composed of 166 places in 401 ms of which 6 ms to minimize.
[2024-05-24 16:10:52] [INFO ] Deduced a trap composed of 236 places in 409 ms of which 5 ms to minimize.
[2024-05-24 16:10:53] [INFO ] Deduced a trap composed of 236 places in 409 ms of which 6 ms to minimize.
[2024-05-24 16:10:53] [INFO ] Deduced a trap composed of 240 places in 404 ms of which 5 ms to minimize.
[2024-05-24 16:10:54] [INFO ] Deduced a trap composed of 240 places in 394 ms of which 5 ms to minimize.
[2024-05-24 16:10:54] [INFO ] Deduced a trap composed of 181 places in 404 ms of which 5 ms to minimize.
[2024-05-24 16:10:54] [INFO ] Deduced a trap composed of 166 places in 409 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/940 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/940 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 28/968 variables, 28/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:10:55] [INFO ] Deduced a trap composed of 161 places in 441 ms of which 6 ms to minimize.
[2024-05-24 16:10:55] [INFO ] Deduced a trap composed of 71 places in 508 ms of which 6 ms to minimize.
[2024-05-24 16:10:56] [INFO ] Deduced a trap composed of 82 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:10:57] [INFO ] Deduced a trap composed of 124 places in 488 ms of which 6 ms to minimize.
[2024-05-24 16:10:57] [INFO ] Deduced a trap composed of 98 places in 504 ms of which 7 ms to minimize.
[2024-05-24 16:10:58] [INFO ] Deduced a trap composed of 81 places in 498 ms of which 6 ms to minimize.
[2024-05-24 16:10:58] [INFO ] Deduced a trap composed of 83 places in 513 ms of which 16 ms to minimize.
[2024-05-24 16:10:59] [INFO ] Deduced a trap composed of 90 places in 500 ms of which 6 ms to minimize.
[2024-05-24 16:10:59] [INFO ] Deduced a trap composed of 91 places in 502 ms of which 6 ms to minimize.
[2024-05-24 16:11:00] [INFO ] Deduced a trap composed of 68 places in 512 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/968 variables, 10/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/968 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/978 variables, 10/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/978 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2857/3835 variables, 978/1093 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3835 variables, 1686/2779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3835 variables, 1/2780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:11:06] [INFO ] Deduced a trap composed of 86 places in 514 ms of which 6 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/3835 variables, 1/2781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3835 variables, 0/2781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:11:06] [INFO ] Deduced a trap composed of 185 places in 482 ms of which 6 ms to minimize.
At refinement iteration 23 (OVERLAPS) 0/3835 variables, 1/2782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3835 variables, 0/2782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:11:07] [INFO ] Deduced a trap composed of 70 places in 512 ms of which 6 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/3835 variables, 1/2783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:11:08] [INFO ] Deduced a trap composed of 90 places in 507 ms of which 6 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/3835 variables, 1/2784 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:11:09] [INFO ] Deduced a trap composed of 70 places in 506 ms of which 6 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/3835 variables, 1/2785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3835 variables, 0/2785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/3835 variables, 0/2785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3835/3835 variables, and 2785 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37440 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 978/978 constraints, ReadFeed: 1686/1686 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 77/77 constraints]
After SMT, in 44200ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 2 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 3249/3249 transitions.
Applied a total of 0 rules in 76 ms. Remains 978 /978 variables (removed 0) and now considering 3249/3249 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 978/978 places, 3249/3249 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 3249/3249 transitions.
Applied a total of 0 rules in 74 ms. Remains 978 /978 variables (removed 0) and now considering 3249/3249 (removed 0) transitions.
[2024-05-24 16:11:10] [INFO ] Flow matrix only has 2857 transitions (discarded 392 similar events)
[2024-05-24 16:11:10] [INFO ] Invariant cache hit.
[2024-05-24 16:11:11] [INFO ] Implicit Places using invariants in 968 ms returned []
[2024-05-24 16:11:11] [INFO ] Flow matrix only has 2857 transitions (discarded 392 similar events)
[2024-05-24 16:11:11] [INFO ] Invariant cache hit.
[2024-05-24 16:11:12] [INFO ] State equation strengthened by 1686 read => feed constraints.
[2024-05-24 16:11:35] [INFO ] Implicit Places using invariants and state equation in 24119 ms returned []
Implicit Place search using SMT with State Equation took 25088 ms to find 0 implicit places.
[2024-05-24 16:11:35] [INFO ] Redundant transitions in 137 ms returned []
Running 3187 sub problems to find dead transitions.
[2024-05-24 16:11:35] [INFO ] Flow matrix only has 2857 transitions (discarded 392 similar events)
[2024-05-24 16:11:35] [INFO ] Invariant cache hit.
[2024-05-24 16:11:35] [INFO ] State equation strengthened by 1686 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 0.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 0.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 0.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 0.0)
(s538 0.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 0.0)
(s549 0.0)
(s550 1.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 0.0)
(s567 0.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 0.0)
(s577 0.0)
(s578 1.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 1.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 1.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 0.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 0.0)
(s604 0.0)
(s605 1.0)
(s606 0.0)
(s607 1.0)
(s608 0.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 0.0)
(s616 0.0)
(s617 1.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 1.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 1.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 1.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 1.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 0.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 0.0)
(s660 0.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 0.0)
(s668 0.0)
(s669 1.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 1.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 1.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 1.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 1.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 1.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 1.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 1.0)
(s722 0.0)
(s723 0.0)
(s724 1.0)
(s725 0.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 0.0)
(s732 0.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 0.0)
(s739 0.0)
(s740 1.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3187 unsolved
SMT process timed out in 46136ms, After SMT, problems are : Problem set: 0 solved, 3187 unsolved
Search for dead transitions found 0 dead transitions in 46167ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71483 ms. Remains : 978/978 places, 3249/3249 transitions.
RANDOM walk for 400000 steps (13202 resets) in 4882 ms. (81 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-24 16:12:23] [INFO ] Flow matrix only has 2857 transitions (discarded 392 similar events)
[2024-05-24 16:12:23] [INFO ] Invariant cache hit.
[2024-05-24 16:12:23] [INFO ] [Real]Absence check using 31 positive place invariants in 13 ms returned sat
[2024-05-24 16:12:23] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-24 16:12:24] [INFO ] After 651ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 16:12:24] [INFO ] State equation strengthened by 1686 read => feed constraints.
[2024-05-24 16:12:24] [INFO ] After 128ms SMT Verify possible using 1686 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 16:12:24] [INFO ] After 245ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 16:12:24] [INFO ] After 1027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 16:12:24] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-24 16:12:24] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-24 16:12:25] [INFO ] After 643ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 16:12:25] [INFO ] After 809ms SMT Verify possible using 1686 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 16:12:26] [INFO ] Deduced a trap composed of 77 places in 494 ms of which 5 ms to minimize.
[2024-05-24 16:12:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 631 ms
TRAPS : Iteration 1
[2024-05-24 16:12:26] [INFO ] After 1628ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 16:12:26] [INFO ] After 2393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4790 steps (156 resets) in 73 ms. (64 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (1321 resets) in 553 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (159 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 80487 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 1
Probabilistic random walk after 80487 steps, saw 33746 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-24 16:12:30] [INFO ] Flow matrix only has 2857 transitions (discarded 392 similar events)
[2024-05-24 16:12:30] [INFO ] Invariant cache hit.
[2024-05-24 16:12:30] [INFO ] State equation strengthened by 1686 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 569/570 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 324/894 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/894 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/912 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:12:30] [INFO ] Deduced a trap composed of 85 places in 446 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/912 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/912 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/940 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/940 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/968 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/968 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/978 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/978 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2857/3835 variables, 978/1022 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3835 variables, 1686/2708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3835 variables, 0/2708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3835 variables, 0/2708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3835/3835 variables, and 2708 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1509 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 978/978 constraints, ReadFeed: 1686/1686 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 569/570 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 324/894 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/894 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/912 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/912 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:12:32] [INFO ] Deduced a trap composed of 170 places in 452 ms of which 5 ms to minimize.
[2024-05-24 16:12:32] [INFO ] Deduced a trap composed of 86 places in 453 ms of which 5 ms to minimize.
[2024-05-24 16:12:33] [INFO ] Deduced a trap composed of 92 places in 447 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/912 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/912 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/940 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:12:33] [INFO ] Deduced a trap composed of 5 places in 400 ms of which 6 ms to minimize.
[2024-05-24 16:12:33] [INFO ] Deduced a trap composed of 46 places in 401 ms of which 6 ms to minimize.
[2024-05-24 16:12:34] [INFO ] Deduced a trap composed of 46 places in 411 ms of which 6 ms to minimize.
[2024-05-24 16:12:34] [INFO ] Deduced a trap composed of 57 places in 398 ms of which 5 ms to minimize.
[2024-05-24 16:12:35] [INFO ] Deduced a trap composed of 88 places in 403 ms of which 5 ms to minimize.
[2024-05-24 16:12:35] [INFO ] Deduced a trap composed of 152 places in 407 ms of which 5 ms to minimize.
[2024-05-24 16:12:36] [INFO ] Deduced a trap composed of 148 places in 408 ms of which 6 ms to minimize.
[2024-05-24 16:12:36] [INFO ] Deduced a trap composed of 135 places in 403 ms of which 5 ms to minimize.
[2024-05-24 16:12:36] [INFO ] Deduced a trap composed of 62 places in 402 ms of which 5 ms to minimize.
SMT process timed out in 6914ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 3249/3249 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 978 transition count 3468
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 977 transition count 3468
Applied a total of 2 rules in 157 ms. Remains 977 /978 variables (removed 1) and now considering 3468/3249 (removed -219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 977/978 places, 3468/3249 transitions.
RANDOM walk for 40000 steps (1360 resets) in 690 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (160 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 78934 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 1
Probabilistic random walk after 78934 steps, saw 33023 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-24 16:12:40] [INFO ] Flow matrix only has 3076 transitions (discarded 392 similar events)
// Phase 1: matrix 3076 rows 977 cols
[2024-05-24 16:12:40] [INFO ] Computed 43 invariants in 33 ms
[2024-05-24 16:12:40] [INFO ] State equation strengthened by 1906 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 569/570 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 323/893 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/893 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/911 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:12:41] [INFO ] Deduced a trap composed of 688 places in 465 ms of which 5 ms to minimize.
[2024-05-24 16:12:41] [INFO ] Deduced a trap composed of 93 places in 474 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/911 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/911 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/939 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:12:42] [INFO ] Deduced a trap composed of 27 places in 493 ms of which 5 ms to minimize.
[2024-05-24 16:12:42] [INFO ] Deduced a trap composed of 71 places in 508 ms of which 6 ms to minimize.
[2024-05-24 16:12:43] [INFO ] Deduced a trap composed of 5 places in 505 ms of which 6 ms to minimize.
[2024-05-24 16:12:43] [INFO ] Deduced a trap composed of 65 places in 498 ms of which 6 ms to minimize.
[2024-05-24 16:12:44] [INFO ] Deduced a trap composed of 46 places in 488 ms of which 6 ms to minimize.
[2024-05-24 16:12:44] [INFO ] Deduced a trap composed of 60 places in 500 ms of which 6 ms to minimize.
[2024-05-24 16:12:45] [INFO ] Deduced a trap composed of 72 places in 512 ms of which 6 ms to minimize.
[2024-05-24 16:12:45] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 2 ms to minimize.
[2024-05-24 16:12:45] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 2 ms to minimize.
[2024-05-24 16:12:45] [INFO ] Deduced a trap composed of 27 places in 478 ms of which 5 ms to minimize.
[2024-05-24 16:12:46] [INFO ] Deduced a trap composed of 77 places in 493 ms of which 5 ms to minimize.
[2024-05-24 16:12:46] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2024-05-24 16:12:47] [INFO ] Deduced a trap composed of 93 places in 488 ms of which 5 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/939 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/967 variables, 28/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/967 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/977 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:12:47] [INFO ] Deduced a trap composed of 173 places in 505 ms of which 5 ms to minimize.
[2024-05-24 16:12:48] [INFO ] Deduced a trap composed of 94 places in 513 ms of which 5 ms to minimize.
[2024-05-24 16:12:48] [INFO ] Deduced a trap composed of 57 places in 506 ms of which 6 ms to minimize.
[2024-05-24 16:12:49] [INFO ] Deduced a trap composed of 79 places in 502 ms of which 6 ms to minimize.
[2024-05-24 16:12:49] [INFO ] Deduced a trap composed of 83 places in 508 ms of which 6 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/977 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/977 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3076/4053 variables, 977/1040 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4053 variables, 1906/2946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/4053 variables, 0/2946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/4053 variables, 0/2946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4053/4053 variables, and 2946 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10865 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 977/977 constraints, ReadFeed: 1906/1906 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 569/570 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 323/893 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/893 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/911 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/911 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:12:51] [INFO ] Deduced a trap composed of 207 places in 460 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/911 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/911 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 28/939 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/939 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 16:12:52] [INFO ] Deduced a trap composed of 46 places in 411 ms of which 5 ms to minimize.
[2024-05-24 16:12:52] [INFO ] Deduced a trap composed of 46 places in 397 ms of which 6 ms to minimize.
[2024-05-24 16:12:53] [INFO ] Deduced a trap composed of 88 places in 397 ms of which 6 ms to minimize.
[2024-05-24 16:12:53] [INFO ] Deduced a trap composed of 138 places in 397 ms of which 6 ms to minimize.
[2024-05-24 16:12:53] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 2 ms to minimize.
[2024-05-24 16:12:54] [INFO ] Deduced a trap composed of 138 places in 398 ms of which 6 ms to minimize.
[2024-05-24 16:12:54] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 2 ms to minimize.
[2024-05-24 16:12:54] [INFO ] Deduced a trap composed of 160 places in 417 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/939 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/939 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 28/967 variables, 28/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/967 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/967 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/977 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/977 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/977 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3076/4053 variables, 977/1049 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/4053 variables, 1906/2955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/4053 variables, 1/2956 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/4053 variables, 0/2956 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/4053 variables, 0/2956 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4053/4053 variables, and 2956 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6538 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 977/977 constraints, ReadFeed: 1906/1906 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 29/29 constraints]
After SMT, in 17468ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 977 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 3468/3468 transitions.
Applied a total of 0 rules in 79 ms. Remains 977 /977 variables (removed 0) and now considering 3468/3468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 977/977 places, 3468/3468 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 977/977 places, 3468/3468 transitions.
Applied a total of 0 rules in 78 ms. Remains 977 /977 variables (removed 0) and now considering 3468/3468 (removed 0) transitions.
[2024-05-24 16:12:58] [INFO ] Flow matrix only has 3076 transitions (discarded 392 similar events)
[2024-05-24 16:12:58] [INFO ] Invariant cache hit.
[2024-05-24 16:12:59] [INFO ] Implicit Places using invariants in 1054 ms returned []
[2024-05-24 16:12:59] [INFO ] Flow matrix only has 3076 transitions (discarded 392 similar events)
[2024-05-24 16:12:59] [INFO ] Invariant cache hit.
[2024-05-24 16:12:59] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-24 16:13:26] [INFO ] Implicit Places using invariants and state equation in 27413 ms returned []
Implicit Place search using SMT with State Equation took 28468 ms to find 0 implicit places.
[2024-05-24 16:13:26] [INFO ] Redundant transitions in 143 ms returned []
Running 3406 sub problems to find dead transitions.
[2024-05-24 16:13:26] [INFO ] Flow matrix only has 3076 transitions (discarded 392 similar events)
[2024-05-24 16:13:26] [INFO ] Invariant cache hit.
[2024-05-24 16:13:26] [INFO ] State equation strengthened by 1906 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/975 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3406 unsolved
SMT process timed out in 49866ms, After SMT, problems are : Problem set: 0 solved, 3406 unsolved
Search for dead transitions found 0 dead transitions in 49901ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78609 ms. Remains : 977/977 places, 3468/3468 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1046 edges and 978 vertex of which 16 / 978 are part of one of the 1 SCC in 3 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 267 transitions
Ensure Unique test removed 379 transitions
Reduce isomorphic transitions removed 646 transitions.
Graph (complete) has 3824 edges and 963 vertex of which 949 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2279 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 83 rules applied. Total rules applied 85 place count 932 transition count 2520
Reduce places removed 81 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 1 with 224 rules applied. Total rules applied 309 place count 851 transition count 2377
Reduce places removed 71 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 2 with 177 rules applied. Total rules applied 486 place count 780 transition count 2271
Reduce places removed 44 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 3 with 112 rules applied. Total rules applied 598 place count 736 transition count 2203
Reduce places removed 33 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 24 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 4 with 71 rules applied. Total rules applied 669 place count 703 transition count 2165
Reduce places removed 14 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 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 5 with 22 rules applied. Total rules applied 691 place count 689 transition count 2157
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 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 6 with 7 rules applied. Total rules applied 698 place count 686 transition count 2153
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 7 with 7 rules applied. Total rules applied 705 place count 685 transition count 2147
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 710 place count 680 transition count 2147
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 18 Pre rules applied. Total rules applied 710 place count 680 transition count 2129
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 746 place count 662 transition count 2129
Discarding 214 places :
Symmetric choice reduction at 9 with 214 rule applications. Total rules 960 place count 448 transition count 1287
Iterating global reduction 9 with 214 rules applied. Total rules applied 1174 place count 448 transition count 1287
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 9 with 92 rules applied. Total rules applied 1266 place count 448 transition count 1195
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1266 place count 448 transition count 1194
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1268 place count 447 transition count 1194
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 1282 place count 433 transition count 1124
Iterating global reduction 10 with 14 rules applied. Total rules applied 1296 place count 433 transition count 1124
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 10 with 78 rules applied. Total rules applied 1374 place count 433 transition count 1046
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 1377 place count 430 transition count 1042
Iterating global reduction 11 with 3 rules applied. Total rules applied 1380 place count 430 transition count 1042
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 11 with 1 rules applied. Total rules applied 1381 place count 430 transition count 1041
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1382 place count 429 transition count 1041
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 1384 place count 427 transition count 1039
Iterating global reduction 13 with 2 rules applied. Total rules applied 1386 place count 427 transition count 1039
Performed 307 Post agglomeration using F-continuation condition.Transition count delta: 307
Deduced a syphon composed of 307 places in 0 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 13 with 614 rules applied. Total rules applied 2000 place count 120 transition count 732
Drop transitions (Empty/Sink Transition effects.) removed 298 transitions
Reduce isomorphic transitions removed 298 transitions.
Iterating post reduction 13 with 298 rules applied. Total rules applied 2298 place count 120 transition count 434
Discarding 54 places :
Symmetric choice reduction at 14 with 54 rule applications. Total rules 2352 place count 66 transition count 174
Iterating global reduction 14 with 54 rules applied. Total rules applied 2406 place count 66 transition count 174
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 14 with 25 rules applied. Total rules applied 2431 place count 66 transition count 149
Discarding 6 places :
Symmetric choice reduction at 15 with 6 rule applications. Total rules 2437 place count 60 transition count 116
Iterating global reduction 15 with 6 rules applied. Total rules applied 2443 place count 60 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 15 with 13 rules applied. Total rules applied 2456 place count 60 transition count 103
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2456 place count 60 transition count 102
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2458 place count 59 transition count 102
Discarding 13 places :
Symmetric choice reduction at 15 with 13 rule applications. Total rules 2471 place count 46 transition count 61
Iterating global reduction 15 with 13 rules applied. Total rules applied 2484 place count 46 transition count 61
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 15 with 17 rules applied. Total rules applied 2501 place count 46 transition count 44
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 2503 place count 44 transition count 41
Iterating global reduction 16 with 2 rules applied. Total rules applied 2505 place count 44 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2507 place count 43 transition count 44
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2508 place count 42 transition count 39
Iterating global reduction 16 with 1 rules applied. Total rules applied 2509 place count 42 transition count 39
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 2512 place count 42 transition count 36
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 17 with 6 rules applied. Total rules applied 2518 place count 42 transition count 30
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 2524 place count 36 transition count 30
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 18 with 5 rules applied. Total rules applied 2529 place count 36 transition count 30
Applied a total of 2529 rules in 909 ms. Remains 36 /978 variables (removed 942) and now considering 30/3249 (removed 3219) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 36 cols
[2024-05-24 16:14:17] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 16:14:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 16:14:17] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-24 16:14:17] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 16:14:17] [INFO ] After 14ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-24 16:14:17] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 955 ms.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 3025/3025 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1336 transition count 2931
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1336 transition count 2931
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 126 place count 1302 transition count 2841
Iterating global reduction 0 with 34 rules applied. Total rules applied 160 place count 1302 transition count 2841
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 178 place count 1284 transition count 2751
Iterating global reduction 0 with 18 rules applied. Total rules applied 196 place count 1284 transition count 2751
Applied a total of 196 rules in 197 ms. Remains 1284 /1382 variables (removed 98) and now considering 2751/3025 (removed 274) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 1284/1382 places, 2751/3025 transitions.
[2024-05-24 16:14:17] [INFO ] Flatten gal took : 66 ms
[2024-05-24 16:14:17] [INFO ] Flatten gal took : 75 ms
[2024-05-24 16:14:17] [INFO ] Input system was already deterministic with 2751 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1382/1382 places, 3025/3025 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 1382 transition count 3002
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 1359 transition count 3002
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 46 place count 1359 transition count 2967
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 116 place count 1324 transition count 2967
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 145 place count 1295 transition count 2894
Iterating global reduction 2 with 29 rules applied. Total rules applied 174 place count 1295 transition count 2894
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 174 place count 1295 transition count 2893
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 176 place count 1294 transition count 2893
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 194 place count 1276 transition count 2815
Iterating global reduction 2 with 18 rules applied. Total rules applied 212 place count 1276 transition count 2815
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 214 place count 1274 transition count 2805
Iterating global reduction 2 with 2 rules applied. Total rules applied 216 place count 1274 transition count 2805
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 282 place count 1241 transition count 2772
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 297 place count 1226 transition count 2757
Iterating global reduction 2 with 15 rules applied. Total rules applied 312 place count 1226 transition count 2757
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 326 place count 1212 transition count 2687
Iterating global reduction 2 with 14 rules applied. Total rules applied 340 place count 1212 transition count 2687
Applied a total of 340 rules in 469 ms. Remains 1212 /1382 variables (removed 170) and now considering 2687/3025 (removed 338) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 469 ms. Remains : 1212/1382 places, 2687/3025 transitions.
[2024-05-24 16:14:18] [INFO ] Flatten gal took : 59 ms
[2024-05-24 16:14:18] [INFO ] Flatten gal took : 67 ms
[2024-05-24 16:14:18] [INFO ] Input system was already deterministic with 2687 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1382/1382 places, 3025/3025 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1382 transition count 2999
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 1356 transition count 2999
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 52 place count 1356 transition count 2964
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 122 place count 1321 transition count 2964
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 152 place count 1291 transition count 2890
Iterating global reduction 2 with 30 rules applied. Total rules applied 182 place count 1291 transition count 2890
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 182 place count 1291 transition count 2889
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 184 place count 1290 transition count 2889
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 202 place count 1272 transition count 2811
Iterating global reduction 2 with 18 rules applied. Total rules applied 220 place count 1272 transition count 2811
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 222 place count 1270 transition count 2801
Iterating global reduction 2 with 2 rules applied. Total rules applied 224 place count 1270 transition count 2801
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 290 place count 1237 transition count 2768
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 307 place count 1220 transition count 2751
Iterating global reduction 2 with 17 rules applied. Total rules applied 324 place count 1220 transition count 2751
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 341 place count 1203 transition count 2666
Iterating global reduction 2 with 17 rules applied. Total rules applied 358 place count 1203 transition count 2666
Applied a total of 358 rules in 439 ms. Remains 1203 /1382 variables (removed 179) and now considering 2666/3025 (removed 359) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 441 ms. Remains : 1203/1382 places, 2666/3025 transitions.
[2024-05-24 16:14:19] [INFO ] Flatten gal took : 56 ms
[2024-05-24 16:14:19] [INFO ] Flatten gal took : 65 ms
[2024-05-24 16:14:19] [INFO ] Input system was already deterministic with 2666 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1382/1382 places, 3025/3025 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 1382 transition count 3001
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 1358 transition count 3001
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 48 place count 1358 transition count 2966
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 118 place count 1323 transition count 2966
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 148 place count 1293 transition count 2892
Iterating global reduction 2 with 30 rules applied. Total rules applied 178 place count 1293 transition count 2892
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 178 place count 1293 transition count 2891
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 180 place count 1292 transition count 2891
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 198 place count 1274 transition count 2813
Iterating global reduction 2 with 18 rules applied. Total rules applied 216 place count 1274 transition count 2813
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 218 place count 1272 transition count 2803
Iterating global reduction 2 with 2 rules applied. Total rules applied 220 place count 1272 transition count 2803
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 286 place count 1239 transition count 2770
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 301 place count 1224 transition count 2755
Iterating global reduction 2 with 15 rules applied. Total rules applied 316 place count 1224 transition count 2755
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 331 place count 1209 transition count 2680
Iterating global reduction 2 with 15 rules applied. Total rules applied 346 place count 1209 transition count 2680
Applied a total of 346 rules in 422 ms. Remains 1209 /1382 variables (removed 173) and now considering 2680/3025 (removed 345) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 423 ms. Remains : 1209/1382 places, 2680/3025 transitions.
[2024-05-24 16:14:19] [INFO ] Flatten gal took : 55 ms
[2024-05-24 16:14:19] [INFO ] Flatten gal took : 61 ms
[2024-05-24 16:14:20] [INFO ] Input system was already deterministic with 2680 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 3025/3025 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 1338 transition count 2941
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 1338 transition count 2941
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 122 place count 1304 transition count 2847
Iterating global reduction 0 with 34 rules applied. Total rules applied 156 place count 1304 transition count 2847
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 174 place count 1286 transition count 2757
Iterating global reduction 0 with 18 rules applied. Total rules applied 192 place count 1286 transition count 2757
Applied a total of 192 rules in 190 ms. Remains 1286 /1382 variables (removed 96) and now considering 2757/3025 (removed 268) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 1286/1382 places, 2757/3025 transitions.
[2024-05-24 16:14:20] [INFO ] Flatten gal took : 62 ms
[2024-05-24 16:14:20] [INFO ] Flatten gal took : 73 ms
[2024-05-24 16:14:20] [INFO ] Input system was already deterministic with 2757 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 3025/3025 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1336 transition count 2935
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1336 transition count 2935
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 127 place count 1301 transition count 2840
Iterating global reduction 0 with 35 rules applied. Total rules applied 162 place count 1301 transition count 2840
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 180 place count 1283 transition count 2750
Iterating global reduction 0 with 18 rules applied. Total rules applied 198 place count 1283 transition count 2750
Applied a total of 198 rules in 189 ms. Remains 1283 /1382 variables (removed 99) and now considering 2750/3025 (removed 275) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 1283/1382 places, 2750/3025 transitions.
[2024-05-24 16:14:20] [INFO ] Flatten gal took : 64 ms
[2024-05-24 16:14:20] [INFO ] Flatten gal took : 71 ms
[2024-05-24 16:14:20] [INFO ] Input system was already deterministic with 2750 transitions.
[2024-05-24 16:14:21] [INFO ] Flatten gal took : 74 ms
[2024-05-24 16:14:21] [INFO ] Flatten gal took : 78 ms
[2024-05-24 16:14:21] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-24 16:14:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1382 places, 3025 transitions and 13271 arcs took 14 ms.
Total runtime 722877 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running MultiCrashLeafsetExtension-PT-S16C05
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1382
TRANSITIONS: 3025
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.076s, Sys 0.000s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.010s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 2203
MODEL NAME: /home/mcc/execution/411/model
1382 places, 3025 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
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 CTLFireability -timeout 360 -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="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654349000026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C05.tgz
mv MultiCrashLeafsetExtension-PT-S16C05 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;