fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r245-tall-171654349000019
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for MultiCrashLeafsetExtension-PT-S16C04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15737.355 1894245.00 4589434.00 2590.90 FFFFTTFFFFTFTF?F normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r245-tall-171654349000019.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-S16C04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349000019
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 05:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 12 05:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 12 05:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 05:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K 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.1M 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-S16C04-LTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716565460180

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 15:44:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 15:44:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:44:21] [INFO ] Load time of PNML (sax parser for PT used): 345 ms
[2024-05-24 15:44:21] [INFO ] Transformed 4260 places.
[2024-05-24 15:44:21] [INFO ] Transformed 6027 transitions.
[2024-05-24 15:44:21] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 472 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 4260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 4232 transition count 6027
Discarding 1067 places :
Symmetric choice reduction at 1 with 1067 rule applications. Total rules 1095 place count 3165 transition count 4960
Iterating global reduction 1 with 1067 rules applied. Total rules applied 2162 place count 3165 transition count 4960
Discarding 926 places :
Symmetric choice reduction at 1 with 926 rule applications. Total rules 3088 place count 2239 transition count 4034
Iterating global reduction 1 with 926 rules applied. Total rules applied 4014 place count 2239 transition count 4034
Discarding 211 places :
Symmetric choice reduction at 1 with 211 rule applications. Total rules 4225 place count 2028 transition count 3190
Iterating global reduction 1 with 211 rules applied. Total rules applied 4436 place count 2028 transition count 3190
Applied a total of 4436 rules in 818 ms. Remains 2028 /4260 variables (removed 2232) and now considering 3190/6027 (removed 2837) transitions.
[2024-05-24 15:44:22] [INFO ] Flow matrix only has 2918 transitions (discarded 272 similar events)
// Phase 1: matrix 2918 rows 2028 cols
[2024-05-24 15:44:23] [INFO ] Computed 469 invariants in 147 ms
[2024-05-24 15:44:25] [INFO ] Implicit Places using invariants in 2994 ms returned [4, 8, 12, 14, 16, 18, 20, 25, 32, 41, 52, 65, 80, 96, 112, 114, 116, 120, 133, 144, 153, 160, 167, 170, 189, 196, 201, 203, 204, 214, 221, 232, 243, 256, 270, 284, 285, 286, 287, 288, 299, 308, 315, 320, 323, 325, 344, 351, 356, 357, 358, 362, 366, 371, 378, 387, 401, 413, 425, 426, 427, 429, 438, 445, 450, 453, 455, 460, 479, 486, 489, 490, 491, 492, 493, 495, 497, 500, 505, 512, 521, 531, 541, 542, 543, 546, 555, 560, 563, 565, 567, 569, 588, 599, 600, 601, 602, 604, 606, 608, 613, 618, 625, 633, 641, 642, 643, 645, 650, 653, 655, 659, 661, 663, 682, 689, 692, 693, 694, 695, 696, 698, 700, 702, 704, 707, 712, 718, 725, 726, 727, 728, 731, 733, 735, 737, 739, 743, 762, 769, 772, 773, 774, 775, 776, 778, 780, 782, 784, 786, 789, 793, 797, 798, 799, 800, 801, 803, 805, 807, 809, 811, 813, 832, 839, 844, 845, 846, 850, 854, 856, 858, 860, 862, 864, 867, 868, 869, 870, 871, 873, 875, 877, 879, 881, 883, 902, 904, 908, 911, 912, 915, 917, 919, 921, 923, 925, 927, 933, 938, 939, 940, 942, 944, 946, 948, 953, 958, 977, 984, 987, 988, 989, 990, 991, 993, 995, 997, 999, 1001, 1003, 1005, 1008, 1009, 1010, 1011, 1012, 1014, 1016, 1018, 1020, 1022, 1024, 1043, 1050, 1053, 1054, 1056, 1057, 1062, 1064, 1066, 1068, 1070, 1072, 1075, 1080, 1081, 1082, 1083, 1084, 1087, 1089, 1091, 1093, 1095, 1097, 1116, 1123, 1126, 1127, 1128, 1129, 1130, 1132, 1134, 1136, 1138, 1140, 1143, 1148, 1155, 1156, 1157, 1159, 1164, 1167, 1169, 1171, 1173, 1175, 1197, 1204, 1207, 1208, 1209, 1211, 1213, 1215, 1217, 1221, 1224, 1229, 1236, 1245, 1246, 1247, 1249, 1256, 1264, 1267, 1269, 1271, 1273, 1299, 1303, 1304, 1305, 1306, 1308, 1312, 1314, 1318, 1323, 1330, 1339, 1350, 1353, 1354, 1366, 1373, 1378, 1381, 1386, 1388, 1407, 1414, 1417, 1418, 1419, 1420, 1421, 1423, 1425, 1428, 1433, 1440, 1449, 1460, 1473, 1474, 1475, 1476, 1477, 1488, 1497, 1504, 1509, 1512, 1514, 1533, 1540, 1543, 1544, 1545, 1547, 1551, 1554, 1559, 1566, 1575, 1588, 1601, 1616, 1617, 1619, 1620, 1633, 1644, 1656, 1663, 1668, 1671, 1690, 1692, 1696, 1699, 1700, 1701, 1702, 1703, 1706, 1711, 1718, 1727, 1738, 1751, 1766, 1783, 1784, 1785, 1786, 1787, 1802, 1815, 1826, 1835, 1842, 1847, 1867]
[2024-05-24 15:44:25] [INFO ] Actually due to overlaps returned [189, 344, 479, 588, 682, 762, 832, 902, 977, 1043, 1116, 1197, 1407, 1533, 1690, 1867, 4, 12, 14, 16, 18, 112, 114, 116, 144, 201, 203, 284, 285, 286, 287, 308, 356, 357, 425, 426, 427, 445, 489, 490, 491, 492, 541, 542, 543, 560, 599, 600, 601, 641, 642, 643, 653, 692, 693, 694, 695, 725, 726, 727, 733, 772, 773, 774, 775, 797, 798, 799, 800, 805, 844, 845, 867, 868, 869, 870, 875, 904, 911, 912, 938, 939, 944, 987, 988, 989, 990, 1008, 1009, 1010, 1011, 1016, 1053, 1054, 1056, 1080, 1081, 1082, 1083, 1089, 1126, 1127, 1128, 1129, 1155, 1156, 1157, 1167, 1207, 1208, 1209, 1245, 1246, 1247, 1303, 1304, 1305, 1350, 1353, 1378, 1417, 1418, 1419, 1420, 1473, 1474, 1475, 1476, 1504, 1543, 1544, 1545, 1616, 1617, 1619, 1656, 1692, 1699, 1700, 1701, 1702, 1783, 1784, 1785, 1786, 1826]
Discarding 146 places :
Implicit Place search using SMT only with invariants took 3034 ms to find 146 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1882/4260 places, 3190/6027 transitions.
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 100 place count 1782 transition count 3090
Iterating global reduction 0 with 100 rules applied. Total rules applied 200 place count 1782 transition count 3090
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 299 place count 1683 transition count 2991
Iterating global reduction 0 with 99 rules applied. Total rules applied 398 place count 1683 transition count 2991
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 497 place count 1584 transition count 2892
Iterating global reduction 0 with 99 rules applied. Total rules applied 596 place count 1584 transition count 2892
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 608 place count 1572 transition count 2844
Iterating global reduction 0 with 12 rules applied. Total rules applied 620 place count 1572 transition count 2844
Applied a total of 620 rules in 233 ms. Remains 1572 /1882 variables (removed 310) and now considering 2844/3190 (removed 346) transitions.
[2024-05-24 15:44:26] [INFO ] Flow matrix only has 2572 transitions (discarded 272 similar events)
// Phase 1: matrix 2572 rows 1572 cols
[2024-05-24 15:44:26] [INFO ] Computed 323 invariants in 77 ms
[2024-05-24 15:44:28] [INFO ] Implicit Places using invariants in 1842 ms returned [7, 15, 20, 27, 36, 47, 60, 75, 91, 112, 125, 144, 151, 158, 161, 186, 192, 202, 209, 220, 231, 244, 258, 272, 283, 298, 303, 306, 308, 325, 330, 334, 338, 343, 350, 359, 373, 385, 398, 407, 418, 421, 423, 428, 445, 447, 449, 451, 454, 459, 466, 475, 485, 497, 506, 513, 515, 517, 519, 534, 536, 538, 540, 545, 550, 557, 565, 574, 579, 583, 587, 589, 591, 604, 606, 608, 610, 612, 614, 617, 622, 628, 635, 638, 641, 643, 645, 649, 660, 662, 664, 666, 668, 670, 672, 675, 679, 682, 684, 687, 689, 691, 693, 702, 707, 711, 715, 717, 719, 721, 723, 725, 727, 729, 732, 734, 736, 738, 749, 754, 756, 758, 760, 762, 764, 766, 772, 777, 779, 782, 784, 789, 794, 811, 813, 815, 817, 819, 821, 823, 825, 827, 829, 831, 834, 836, 838, 840, 849, 853, 858, 860, 862, 864, 866, 868, 871, 875, 878, 881, 883, 885, 887, 899, 901, 903, 905, 907, 909, 911, 914, 919, 927, 932, 936, 938, 940, 942, 956, 960, 962, 964, 966, 970, 973, 978, 985, 995, 1002, 1010, 1013, 1015, 1017, 1019, 1033, 1037, 1039, 1043, 1045, 1049, 1054, 1061, 1070, 1083, 1095, 1102, 1109, 1114, 1116, 1131, 1133, 1135, 1137, 1140, 1145, 1152, 1161, 1172, 1184, 1195, 1204, 1215, 1218, 1220, 1229, 1233, 1237, 1240, 1245, 1252, 1261, 1274, 1287, 1303, 1316, 1327, 1345, 1350, 1353, 1364, 1366, 1369, 1374, 1381, 1390, 1401, 1414, 1429, 1446, 1461, 1474, 1493, 1500, 1505]
Discarding 254 places :
Implicit Place search using SMT only with invariants took 1847 ms to find 254 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1318/4260 places, 2844/6027 transitions.
Applied a total of 0 rules in 42 ms. Remains 1318 /1318 variables (removed 0) and now considering 2844/2844 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 5992 ms. Remains : 1318/4260 places, 2844/6027 transitions.
Support contains 42 out of 1318 places after structural reductions.
[2024-05-24 15:44:28] [INFO ] Flatten gal took : 201 ms
[2024-05-24 15:44:28] [INFO ] Flatten gal took : 142 ms
[2024-05-24 15:44:28] [INFO ] Input system was already deterministic with 2844 transitions.
RANDOM walk for 40000 steps (957 resets) in 1977 ms. (20 steps per ms) remains 18/27 properties
BEST_FIRST walk for 4004 steps (24 resets) in 75 ms. (52 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 87 ms. (45 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 100 ms. (39 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 57 ms. (69 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 51 ms. (77 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 42 ms. (93 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 42 ms. (93 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (24 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (24 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
[2024-05-24 15:44:29] [INFO ] Flow matrix only has 2572 transitions (discarded 272 similar events)
// Phase 1: matrix 2572 rows 1318 cols
[2024-05-24 15:44:29] [INFO ] Computed 69 invariants in 50 ms
[2024-05-24 15:44:29] [INFO ] State equation strengthened by 965 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 1171/1194 variables, 4/4 constraints. Problems are: Problem set: 10 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1194 variables, 0/4 constraints. Problems are: Problem set: 10 solved, 8 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 3 (OVERLAPS) 88/1282 variables, 29/33 constraints. Problems are: Problem set: 13 solved, 5 unsolved
[2024-05-24 15:44:31] [INFO ] Deduced a trap composed of 50 places in 826 ms of which 77 ms to minimize.
[2024-05-24 15:44:32] [INFO ] Deduced a trap composed of 177 places in 750 ms of which 11 ms to minimize.
[2024-05-24 15:44:32] [INFO ] Deduced a trap composed of 200 places in 637 ms of which 9 ms to minimize.
[2024-05-24 15:44:33] [INFO ] Deduced a trap composed of 177 places in 667 ms of which 9 ms to minimize.
[2024-05-24 15:44:34] [INFO ] Deduced a trap composed of 183 places in 727 ms of which 8 ms to minimize.
[2024-05-24 15:44:34] [INFO ] Deduced a trap composed of 197 places in 646 ms of which 8 ms to minimize.
[2024-05-24 15:44:35] [INFO ] Deduced a trap composed of 231 places in 636 ms of which 8 ms to minimize.
SMT process timed out in 5627ms, After SMT, problems are : Problem set: 13 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 1318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 1318 transition count 2825
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 1299 transition count 2825
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 38 place count 1299 transition count 2799
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 90 place count 1273 transition count 2799
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 104 place count 1259 transition count 2779
Iterating global reduction 2 with 14 rules applied. Total rules applied 118 place count 1259 transition count 2779
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 130 place count 1247 transition count 2737
Iterating global reduction 2 with 12 rules applied. Total rules applied 142 place count 1247 transition count 2737
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 143 place count 1246 transition count 2733
Iterating global reduction 2 with 1 rules applied. Total rules applied 144 place count 1246 transition count 2733
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 210 place count 1213 transition count 2700
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 220 place count 1203 transition count 2690
Iterating global reduction 2 with 10 rules applied. Total rules applied 230 place count 1203 transition count 2690
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 239 place count 1194 transition count 2654
Iterating global reduction 2 with 9 rules applied. Total rules applied 248 place count 1194 transition count 2654
Free-agglomeration rule (complex) applied 156 times.
Iterating global reduction 2 with 156 rules applied. Total rules applied 404 place count 1194 transition count 3233
Reduce places removed 156 places and 0 transitions.
Iterating post reduction 2 with 156 rules applied. Total rules applied 560 place count 1038 transition count 3233
Partial Free-agglomeration rule applied 25 times.
Drop transitions (Partial Free agglomeration) removed 25 transitions
Iterating global reduction 3 with 25 rules applied. Total rules applied 585 place count 1038 transition count 3233
Applied a total of 585 rules in 927 ms. Remains 1038 /1318 variables (removed 280) and now considering 3233/2844 (removed -389) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 927 ms. Remains : 1038/1318 places, 3233/2844 transitions.
RANDOM walk for 40000 steps (1702 resets) in 1077 ms. (37 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (183 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (184 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (186 resets) in 172 ms. (231 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (187 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
[2024-05-24 15:44:36] [INFO ] Flow matrix only has 2835 transitions (discarded 398 similar events)
// Phase 1: matrix 2835 rows 1038 cols
[2024-05-24 15:44:37] [INFO ] Computed 69 invariants in 29 ms
[2024-05-24 15:44:37] [INFO ] State equation strengthened by 1634 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 938/946 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/946 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 56/1002 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1002 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 28/1030 variables, 28/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1030 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 8/1038 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1038 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2835/3873 variables, 1038/1107 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3873 variables, 1634/2741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3873 variables, 0/2741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/3873 variables, 0/2741 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3873/3873 variables, and 2741 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1891 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 1038/1038 constraints, ReadFeed: 1634/1634 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 938/946 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 15:44:39] [INFO ] Deduced a trap composed of 122 places in 509 ms of which 7 ms to minimize.
[2024-05-24 15:44:40] [INFO ] Deduced a trap composed of 139 places in 540 ms of which 6 ms to minimize.
[2024-05-24 15:44:40] [INFO ] Deduced a trap composed of 122 places in 544 ms of which 6 ms to minimize.
[2024-05-24 15:44:41] [INFO ] Deduced a trap composed of 129 places in 510 ms of which 6 ms to minimize.
[2024-05-24 15:44:41] [INFO ] Deduced a trap composed of 139 places in 528 ms of which 6 ms to minimize.
[2024-05-24 15:44:42] [INFO ] Deduced a trap composed of 153 places in 520 ms of which 6 ms to minimize.
[2024-05-24 15:44:42] [INFO ] Deduced a trap composed of 123 places in 547 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/946 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/946 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 56/1002 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 15:44:43] [INFO ] Deduced a trap composed of 5 places in 579 ms of which 7 ms to minimize.
[2024-05-24 15:44:44] [INFO ] Deduced a trap composed of 76 places in 580 ms of which 7 ms to minimize.
[2024-05-24 15:44:44] [INFO ] Deduced a trap composed of 80 places in 575 ms of which 7 ms to minimize.
[2024-05-24 15:44:45] [INFO ] Deduced a trap composed of 27 places in 461 ms of which 7 ms to minimize.
[2024-05-24 15:44:45] [INFO ] Deduced a trap composed of 129 places in 470 ms of which 7 ms to minimize.
[2024-05-24 15:44:46] [INFO ] Deduced a trap composed of 136 places in 482 ms of which 6 ms to minimize.
[2024-05-24 15:44:46] [INFO ] Deduced a trap composed of 146 places in 466 ms of which 6 ms to minimize.
[2024-05-24 15:44:47] [INFO ] Deduced a trap composed of 137 places in 476 ms of which 7 ms to minimize.
[2024-05-24 15:44:48] [INFO ] Deduced a trap composed of 76 places in 593 ms of which 7 ms to minimize.
[2024-05-24 15:44:48] [INFO ] Deduced a trap composed of 81 places in 588 ms of which 7 ms to minimize.
[2024-05-24 15:44:49] [INFO ] Deduced a trap composed of 68 places in 569 ms of which 7 ms to minimize.
[2024-05-24 15:44:49] [INFO ] Deduced a trap composed of 78 places in 566 ms of which 7 ms to minimize.
[2024-05-24 15:44:50] [INFO ] Deduced a trap composed of 76 places in 601 ms of which 7 ms to minimize.
[2024-05-24 15:44:51] [INFO ] Deduced a trap composed of 138 places in 575 ms of which 7 ms to minimize.
[2024-05-24 15:44:51] [INFO ] Deduced a trap composed of 94 places in 608 ms of which 7 ms to minimize.
[2024-05-24 15:44:52] [INFO ] Deduced a trap composed of 93 places in 593 ms of which 7 ms to minimize.
[2024-05-24 15:44:52] [INFO ] Deduced a trap composed of 142 places in 492 ms of which 7 ms to minimize.
[2024-05-24 15:44:53] [INFO ] Deduced a trap composed of 156 places in 477 ms of which 7 ms to minimize.
[2024-05-24 15:44:53] [INFO ] Deduced a trap composed of 146 places in 463 ms of which 7 ms to minimize.
[2024-05-24 15:44:54] [INFO ] Deduced a trap composed of 132 places in 481 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1002 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 15:44:54] [INFO ] Deduced a trap composed of 153 places in 462 ms of which 8 ms to minimize.
[2024-05-24 15:44:55] [INFO ] Deduced a trap composed of 142 places in 461 ms of which 6 ms to minimize.
[2024-05-24 15:44:55] [INFO ] Deduced a trap composed of 103 places in 511 ms of which 7 ms to minimize.
[2024-05-24 15:44:56] [INFO ] Deduced a trap composed of 93 places in 564 ms of which 6 ms to minimize.
[2024-05-24 15:44:57] [INFO ] Deduced a trap composed of 89 places in 532 ms of which 6 ms to minimize.
[2024-05-24 15:44:57] [INFO ] Deduced a trap composed of 46 places in 528 ms of which 6 ms to minimize.
[2024-05-24 15:44:58] [INFO ] Deduced a trap composed of 82 places in 567 ms of which 6 ms to minimize.
[2024-05-24 15:44:58] [INFO ] Deduced a trap composed of 96 places in 570 ms of which 7 ms to minimize.
[2024-05-24 15:44:59] [INFO ] Deduced a trap composed of 46 places in 572 ms of which 6 ms to minimize.
[2024-05-24 15:44:59] [INFO ] Deduced a trap composed of 101 places in 557 ms of which 6 ms to minimize.
[2024-05-24 15:45:00] [INFO ] Deduced a trap composed of 93 places in 561 ms of which 7 ms to minimize.
[2024-05-24 15:45:01] [INFO ] Deduced a trap composed of 57 places in 580 ms of which 7 ms to minimize.
[2024-05-24 15:45:01] [INFO ] Deduced a trap composed of 95 places in 556 ms of which 6 ms to minimize.
[2024-05-24 15:45:02] [INFO ] Deduced a trap composed of 78 places in 539 ms of which 6 ms to minimize.
[2024-05-24 15:45:02] [INFO ] Deduced a trap composed of 77 places in 559 ms of which 7 ms to minimize.
[2024-05-24 15:45:03] [INFO ] Deduced a trap composed of 101 places in 573 ms of which 7 ms to minimize.
[2024-05-24 15:45:04] [INFO ] Deduced a trap composed of 89 places in 564 ms of which 7 ms to minimize.
[2024-05-24 15:45:04] [INFO ] Deduced a trap composed of 83 places in 567 ms of which 7 ms to minimize.
[2024-05-24 15:45:05] [INFO ] Deduced a trap composed of 75 places in 521 ms of which 7 ms to minimize.
[2024-05-24 15:45:05] [INFO ] Deduced a trap composed of 101 places in 563 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1002 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 15:45:06] [INFO ] Deduced a trap composed of 78 places in 562 ms of which 6 ms to minimize.
[2024-05-24 15:45:06] [INFO ] Deduced a trap composed of 99 places in 557 ms of which 8 ms to minimize.
[2024-05-24 15:45:07] [INFO ] Deduced a trap composed of 72 places in 566 ms of which 6 ms to minimize.
[2024-05-24 15:45:08] [INFO ] Deduced a trap composed of 114 places in 569 ms of which 7 ms to minimize.
[2024-05-24 15:45:08] [INFO ] Deduced a trap composed of 90 places in 504 ms of which 7 ms to minimize.
[2024-05-24 15:45:09] [INFO ] Deduced a trap composed of 159 places in 467 ms of which 9 ms to minimize.
[2024-05-24 15:45:09] [INFO ] Deduced a trap composed of 166 places in 467 ms of which 7 ms to minimize.
[2024-05-24 15:45:10] [INFO ] Deduced a trap composed of 176 places in 455 ms of which 7 ms to minimize.
[2024-05-24 15:45:10] [INFO ] Deduced a trap composed of 175 places in 434 ms of which 6 ms to minimize.
[2024-05-24 15:45:11] [INFO ] Deduced a trap composed of 85 places in 558 ms of which 7 ms to minimize.
[2024-05-24 15:45:11] [INFO ] Deduced a trap composed of 77 places in 545 ms of which 7 ms to minimize.
[2024-05-24 15:45:12] [INFO ] Deduced a trap composed of 63 places in 575 ms of which 7 ms to minimize.
[2024-05-24 15:45:12] [INFO ] Deduced a trap composed of 97 places in 567 ms of which 6 ms to minimize.
[2024-05-24 15:45:13] [INFO ] Deduced a trap composed of 121 places in 581 ms of which 7 ms to minimize.
[2024-05-24 15:45:13] [INFO ] Deduced a trap composed of 187 places in 461 ms of which 6 ms to minimize.
[2024-05-24 15:45:14] [INFO ] Deduced a trap composed of 171 places in 468 ms of which 6 ms to minimize.
[2024-05-24 15:45:14] [INFO ] Deduced a trap composed of 106 places in 463 ms of which 6 ms to minimize.
[2024-05-24 15:45:15] [INFO ] Deduced a trap composed of 199 places in 462 ms of which 7 ms to minimize.
[2024-05-24 15:45:15] [INFO ] Deduced a trap composed of 203 places in 433 ms of which 6 ms to minimize.
[2024-05-24 15:45:16] [INFO ] Deduced a trap composed of 102 places in 520 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1002 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 15:45:16] [INFO ] Deduced a trap composed of 116 places in 534 ms of which 7 ms to minimize.
[2024-05-24 15:45:17] [INFO ] Deduced a trap composed of 140 places in 477 ms of which 7 ms to minimize.
[2024-05-24 15:45:17] [INFO ] Deduced a trap composed of 175 places in 470 ms of which 7 ms to minimize.
[2024-05-24 15:45:18] [INFO ] Deduced a trap composed of 131 places in 465 ms of which 6 ms to minimize.
[2024-05-24 15:45:18] [INFO ] Deduced a trap composed of 148 places in 449 ms of which 6 ms to minimize.
[2024-05-24 15:45:19] [INFO ] Deduced a trap composed of 130 places in 493 ms of which 6 ms to minimize.
[2024-05-24 15:45:19] [INFO ] Deduced a trap composed of 148 places in 484 ms of which 6 ms to minimize.
[2024-05-24 15:45:20] [INFO ] Deduced a trap composed of 133 places in 459 ms of which 6 ms to minimize.
[2024-05-24 15:45:20] [INFO ] Deduced a trap composed of 170 places in 456 ms of which 7 ms to minimize.
[2024-05-24 15:45:21] [INFO ] Deduced a trap composed of 162 places in 464 ms of which 6 ms to minimize.
[2024-05-24 15:45:21] [INFO ] Deduced a trap composed of 135 places in 464 ms of which 6 ms to minimize.
[2024-05-24 15:45:22] [INFO ] Deduced a trap composed of 161 places in 468 ms of which 7 ms to minimize.
[2024-05-24 15:45:22] [INFO ] Deduced a trap composed of 137 places in 459 ms of which 6 ms to minimize.
[2024-05-24 15:45:23] [INFO ] Deduced a trap composed of 169 places in 451 ms of which 6 ms to minimize.
[2024-05-24 15:45:23] [INFO ] Deduced a trap composed of 84 places in 582 ms of which 6 ms to minimize.
[2024-05-24 15:45:24] [INFO ] Deduced a trap composed of 102 places in 585 ms of which 7 ms to minimize.
SMT process timed out in 47586ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1038 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1038/1038 places, 3233/3233 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 0 with 1 rules applied. Total rules applied 1 place count 1038 transition count 3232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1037 transition count 3232
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1037 transition count 3232
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 1036 transition count 3231
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1036 transition count 3231
Applied a total of 5 rules in 231 ms. Remains 1036 /1038 variables (removed 2) and now considering 3231/3233 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 1036/1038 places, 3231/3233 transitions.
RANDOM walk for 40000 steps (1700 resets) in 1248 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (185 resets) in 139 ms. (285 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (183 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (185 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (185 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 68384 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :1 out of 4
Probabilistic random walk after 68384 steps, saw 28903 distinct states, run finished after 3004 ms. (steps per millisecond=22 ) properties seen :1
[2024-05-24 15:45:28] [INFO ] Flow matrix only has 2833 transitions (discarded 398 similar events)
// Phase 1: matrix 2833 rows 1036 cols
[2024-05-24 15:45:28] [INFO ] Computed 69 invariants in 27 ms
[2024-05-24 15:45:28] [INFO ] State equation strengthened by 1634 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 938/943 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/943 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 57/1000 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 28/1028 variables, 28/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1028 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/1036 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1036 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2833/3869 variables, 1036/1105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3869 variables, 1634/2739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3869 variables, 0/2739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/3869 variables, 0/2739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3869/3869 variables, and 2739 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1516 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 1036/1036 constraints, ReadFeed: 1634/1634 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 938/943 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 15:45:30] [INFO ] Deduced a trap composed of 121 places in 485 ms of which 6 ms to minimize.
[2024-05-24 15:45:31] [INFO ] Deduced a trap composed of 134 places in 490 ms of which 6 ms to minimize.
[2024-05-24 15:45:31] [INFO ] Deduced a trap composed of 181 places in 496 ms of which 6 ms to minimize.
[2024-05-24 15:45:32] [INFO ] Deduced a trap composed of 201 places in 475 ms of which 5 ms to minimize.
[2024-05-24 15:45:32] [INFO ] Deduced a trap composed of 137 places in 472 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/943 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/943 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 57/1000 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 15:45:33] [INFO ] Deduced a trap composed of 5 places in 546 ms of which 6 ms to minimize.
[2024-05-24 15:45:33] [INFO ] Deduced a trap composed of 81 places in 552 ms of which 7 ms to minimize.
[2024-05-24 15:45:34] [INFO ] Deduced a trap composed of 78 places in 551 ms of which 6 ms to minimize.
[2024-05-24 15:45:35] [INFO ] Deduced a trap composed of 78 places in 566 ms of which 6 ms to minimize.
[2024-05-24 15:45:35] [INFO ] Deduced a trap composed of 87 places in 566 ms of which 7 ms to minimize.
[2024-05-24 15:45:36] [INFO ] Deduced a trap composed of 138 places in 536 ms of which 7 ms to minimize.
[2024-05-24 15:45:36] [INFO ] Deduced a trap composed of 87 places in 548 ms of which 6 ms to minimize.
[2024-05-24 15:45:37] [INFO ] Deduced a trap composed of 98 places in 546 ms of which 7 ms to minimize.
[2024-05-24 15:45:37] [INFO ] Deduced a trap composed of 73 places in 565 ms of which 7 ms to minimize.
[2024-05-24 15:45:38] [INFO ] Deduced a trap composed of 79 places in 566 ms of which 7 ms to minimize.
[2024-05-24 15:45:39] [INFO ] Deduced a trap composed of 119 places in 594 ms of which 7 ms to minimize.
[2024-05-24 15:45:39] [INFO ] Deduced a trap composed of 81 places in 572 ms of which 7 ms to minimize.
[2024-05-24 15:45:40] [INFO ] Deduced a trap composed of 131 places in 584 ms of which 7 ms to minimize.
[2024-05-24 15:45:40] [INFO ] Deduced a trap composed of 72 places in 563 ms of which 7 ms to minimize.
[2024-05-24 15:45:41] [INFO ] Deduced a trap composed of 78 places in 547 ms of which 6 ms to minimize.
[2024-05-24 15:45:42] [INFO ] Deduced a trap composed of 64 places in 548 ms of which 6 ms to minimize.
[2024-05-24 15:45:42] [INFO ] Deduced a trap composed of 71 places in 542 ms of which 6 ms to minimize.
[2024-05-24 15:45:43] [INFO ] Deduced a trap composed of 66 places in 542 ms of which 6 ms to minimize.
[2024-05-24 15:45:43] [INFO ] Deduced a trap composed of 83 places in 540 ms of which 6 ms to minimize.
[2024-05-24 15:45:44] [INFO ] Deduced a trap composed of 64 places in 555 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1000 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 15:45:44] [INFO ] Deduced a trap composed of 98 places in 549 ms of which 7 ms to minimize.
[2024-05-24 15:45:45] [INFO ] Deduced a trap composed of 64 places in 521 ms of which 6 ms to minimize.
[2024-05-24 15:45:45] [INFO ] Deduced a trap composed of 79 places in 544 ms of which 7 ms to minimize.
[2024-05-24 15:45:46] [INFO ] Deduced a trap composed of 72 places in 520 ms of which 7 ms to minimize.
[2024-05-24 15:45:47] [INFO ] Deduced a trap composed of 83 places in 549 ms of which 6 ms to minimize.
[2024-05-24 15:45:47] [INFO ] Deduced a trap composed of 103 places in 527 ms of which 7 ms to minimize.
[2024-05-24 15:45:48] [INFO ] Deduced a trap composed of 71 places in 534 ms of which 7 ms to minimize.
[2024-05-24 15:45:48] [INFO ] Deduced a trap composed of 63 places in 546 ms of which 6 ms to minimize.
[2024-05-24 15:45:49] [INFO ] Deduced a trap composed of 78 places in 538 ms of which 7 ms to minimize.
[2024-05-24 15:45:49] [INFO ] Deduced a trap composed of 91 places in 531 ms of which 6 ms to minimize.
[2024-05-24 15:45:50] [INFO ] Deduced a trap composed of 64 places in 541 ms of which 6 ms to minimize.
[2024-05-24 15:45:50] [INFO ] Deduced a trap composed of 183 places in 519 ms of which 7 ms to minimize.
[2024-05-24 15:45:51] [INFO ] Deduced a trap composed of 74 places in 542 ms of which 7 ms to minimize.
[2024-05-24 15:45:52] [INFO ] Deduced a trap composed of 204 places in 515 ms of which 7 ms to minimize.
[2024-05-24 15:45:52] [INFO ] Deduced a trap composed of 65 places in 530 ms of which 6 ms to minimize.
[2024-05-24 15:45:53] [INFO ] Deduced a trap composed of 109 places in 536 ms of which 6 ms to minimize.
[2024-05-24 15:45:53] [INFO ] Deduced a trap composed of 82 places in 514 ms of which 6 ms to minimize.
[2024-05-24 15:45:54] [INFO ] Deduced a trap composed of 84 places in 536 ms of which 6 ms to minimize.
[2024-05-24 15:45:54] [INFO ] Deduced a trap composed of 71 places in 554 ms of which 7 ms to minimize.
[2024-05-24 15:45:55] [INFO ] Deduced a trap composed of 76 places in 548 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 15:45:55] [INFO ] Deduced a trap composed of 75 places in 527 ms of which 6 ms to minimize.
[2024-05-24 15:45:56] [INFO ] Deduced a trap composed of 77 places in 538 ms of which 7 ms to minimize.
[2024-05-24 15:45:57] [INFO ] Deduced a trap composed of 77 places in 526 ms of which 6 ms to minimize.
[2024-05-24 15:45:57] [INFO ] Deduced a trap composed of 112 places in 458 ms of which 6 ms to minimize.
[2024-05-24 15:45:57] [INFO ] Deduced a trap composed of 130 places in 445 ms of which 6 ms to minimize.
[2024-05-24 15:45:58] [INFO ] Deduced a trap composed of 111 places in 459 ms of which 7 ms to minimize.
[2024-05-24 15:45:58] [INFO ] Deduced a trap composed of 99 places in 470 ms of which 7 ms to minimize.
[2024-05-24 15:45:59] [INFO ] Deduced a trap composed of 125 places in 458 ms of which 6 ms to minimize.
[2024-05-24 15:45:59] [INFO ] Deduced a trap composed of 130 places in 462 ms of which 6 ms to minimize.
[2024-05-24 15:46:00] [INFO ] Deduced a trap composed of 120 places in 445 ms of which 6 ms to minimize.
[2024-05-24 15:46:00] [INFO ] Deduced a trap composed of 114 places in 440 ms of which 6 ms to minimize.
[2024-05-24 15:46:01] [INFO ] Deduced a trap composed of 135 places in 474 ms of which 7 ms to minimize.
[2024-05-24 15:46:01] [INFO ] Deduced a trap composed of 142 places in 462 ms of which 7 ms to minimize.
[2024-05-24 15:46:02] [INFO ] Deduced a trap composed of 145 places in 441 ms of which 6 ms to minimize.
[2024-05-24 15:46:02] [INFO ] Deduced a trap composed of 146 places in 445 ms of which 6 ms to minimize.
[2024-05-24 15:46:03] [INFO ] Deduced a trap composed of 131 places in 494 ms of which 6 ms to minimize.
[2024-05-24 15:46:03] [INFO ] Deduced a trap composed of 139 places in 471 ms of which 7 ms to minimize.
[2024-05-24 15:46:04] [INFO ] Deduced a trap composed of 156 places in 473 ms of which 7 ms to minimize.
[2024-05-24 15:46:04] [INFO ] Deduced a trap composed of 133 places in 467 ms of which 6 ms to minimize.
[2024-05-24 15:46:05] [INFO ] Deduced a trap composed of 153 places in 463 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 15:46:05] [INFO ] Deduced a trap composed of 85 places in 540 ms of which 7 ms to minimize.
[2024-05-24 15:46:06] [INFO ] Deduced a trap composed of 87 places in 554 ms of which 7 ms to minimize.
[2024-05-24 15:46:07] [INFO ] Deduced a trap composed of 86 places in 542 ms of which 6 ms to minimize.
[2024-05-24 15:46:07] [INFO ] Deduced a trap composed of 100 places in 536 ms of which 6 ms to minimize.
[2024-05-24 15:46:08] [INFO ] Deduced a trap composed of 167 places in 548 ms of which 6 ms to minimize.
[2024-05-24 15:46:08] [INFO ] Deduced a trap composed of 85 places in 557 ms of which 6 ms to minimize.
[2024-05-24 15:46:09] [INFO ] Deduced a trap composed of 83 places in 599 ms of which 7 ms to minimize.
[2024-05-24 15:46:09] [INFO ] Deduced a trap composed of 92 places in 578 ms of which 7 ms to minimize.
[2024-05-24 15:46:10] [INFO ] Deduced a trap composed of 102 places in 582 ms of which 7 ms to minimize.
[2024-05-24 15:46:11] [INFO ] Deduced a trap composed of 148 places in 591 ms of which 10 ms to minimize.
[2024-05-24 15:46:11] [INFO ] Deduced a trap composed of 140 places in 566 ms of which 7 ms to minimize.
[2024-05-24 15:46:12] [INFO ] Deduced a trap composed of 27 places in 552 ms of which 6 ms to minimize.
[2024-05-24 15:46:12] [INFO ] Deduced a trap composed of 27 places in 550 ms of which 7 ms to minimize.
[2024-05-24 15:46:13] [INFO ] Deduced a trap composed of 102 places in 574 ms of which 7 ms to minimize.
[2024-05-24 15:46:14] [INFO ] Deduced a trap composed of 103 places in 546 ms of which 6 ms to minimize.
[2024-05-24 15:46:14] [INFO ] Deduced a trap composed of 128 places in 548 ms of which 7 ms to minimize.
[2024-05-24 15:46:15] [INFO ] Deduced a trap composed of 210 places in 553 ms of which 6 ms to minimize.
[2024-05-24 15:46:15] [INFO ] Deduced a trap composed of 90 places in 522 ms of which 6 ms to minimize.
[2024-05-24 15:46:16] [INFO ] Deduced a trap composed of 89 places in 577 ms of which 7 ms to minimize.
[2024-05-24 15:46:16] [INFO ] Deduced a trap composed of 90 places in 551 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 15:46:17] [INFO ] Deduced a trap composed of 72 places in 557 ms of which 6 ms to minimize.
[2024-05-24 15:46:18] [INFO ] Deduced a trap composed of 69 places in 532 ms of which 7 ms to minimize.
[2024-05-24 15:46:18] [INFO ] Deduced a trap composed of 77 places in 584 ms of which 6 ms to minimize.
[2024-05-24 15:46:19] [INFO ] Deduced a trap composed of 75 places in 565 ms of which 7 ms to minimize.
[2024-05-24 15:46:19] [INFO ] Deduced a trap composed of 93 places in 564 ms of which 7 ms to minimize.
[2024-05-24 15:46:20] [INFO ] Deduced a trap composed of 81 places in 578 ms of which 7 ms to minimize.
[2024-05-24 15:46:21] [INFO ] Deduced a trap composed of 188 places in 502 ms of which 6 ms to minimize.
[2024-05-24 15:46:21] [INFO ] Deduced a trap composed of 57 places in 452 ms of which 6 ms to minimize.
[2024-05-24 15:46:22] [INFO ] Deduced a trap composed of 108 places in 567 ms of which 6 ms to minimize.
[2024-05-24 15:46:22] [INFO ] Deduced a trap composed of 104 places in 557 ms of which 6 ms to minimize.
[2024-05-24 15:46:23] [INFO ] Deduced a trap composed of 46 places in 509 ms of which 6 ms to minimize.
[2024-05-24 15:46:23] [INFO ] Deduced a trap composed of 98 places in 563 ms of which 6 ms to minimize.
[2024-05-24 15:46:24] [INFO ] Deduced a trap composed of 109 places in 555 ms of which 6 ms to minimize.
[2024-05-24 15:46:24] [INFO ] Deduced a trap composed of 109 places in 560 ms of which 7 ms to minimize.
[2024-05-24 15:46:25] [INFO ] Deduced a trap composed of 46 places in 488 ms of which 6 ms to minimize.
[2024-05-24 15:46:26] [INFO ] Deduced a trap composed of 118 places in 558 ms of which 6 ms to minimize.
[2024-05-24 15:46:26] [INFO ] Deduced a trap composed of 105 places in 555 ms of which 6 ms to minimize.
[2024-05-24 15:46:27] [INFO ] Deduced a trap composed of 122 places in 569 ms of which 7 ms to minimize.
[2024-05-24 15:46:27] [INFO ] Deduced a trap composed of 88 places in 493 ms of which 7 ms to minimize.
[2024-05-24 15:46:28] [INFO ] Deduced a trap composed of 104 places in 563 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1000 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 15:46:28] [INFO ] Deduced a trap composed of 139 places in 530 ms of which 6 ms to minimize.
[2024-05-24 15:46:29] [INFO ] Deduced a trap composed of 68 places in 542 ms of which 7 ms to minimize.
[2024-05-24 15:46:30] [INFO ] Deduced a trap composed of 104 places in 555 ms of which 7 ms to minimize.
[2024-05-24 15:46:30] [INFO ] Deduced a trap composed of 91 places in 554 ms of which 6 ms to minimize.
[2024-05-24 15:46:31] [INFO ] Deduced a trap composed of 75 places in 546 ms of which 9 ms to minimize.
[2024-05-24 15:46:31] [INFO ] Deduced a trap composed of 100 places in 536 ms of which 7 ms to minimize.
[2024-05-24 15:46:32] [INFO ] Deduced a trap composed of 119 places in 555 ms of which 7 ms to minimize.
[2024-05-24 15:46:32] [INFO ] Deduced a trap composed of 126 places in 526 ms of which 6 ms to minimize.
[2024-05-24 15:46:33] [INFO ] Deduced a trap composed of 95 places in 539 ms of which 6 ms to minimize.
[2024-05-24 15:46:33] [INFO ] Deduced a trap composed of 122 places in 532 ms of which 6 ms to minimize.
[2024-05-24 15:46:34] [INFO ] Deduced a trap composed of 96 places in 549 ms of which 6 ms to minimize.
[2024-05-24 15:46:35] [INFO ] Deduced a trap composed of 68 places in 560 ms of which 7 ms to minimize.
[2024-05-24 15:46:35] [INFO ] Deduced a trap composed of 102 places in 566 ms of which 6 ms to minimize.
[2024-05-24 15:46:36] [INFO ] Deduced a trap composed of 85 places in 573 ms of which 7 ms to minimize.
[2024-05-24 15:46:36] [INFO ] Deduced a trap composed of 77 places in 558 ms of which 6 ms to minimize.
[2024-05-24 15:46:37] [INFO ] Deduced a trap composed of 46 places in 506 ms of which 6 ms to minimize.
[2024-05-24 15:46:38] [INFO ] Deduced a trap composed of 113 places in 542 ms of which 6 ms to minimize.
[2024-05-24 15:46:38] [INFO ] Deduced a trap composed of 88 places in 501 ms of which 6 ms to minimize.
[2024-05-24 15:46:39] [INFO ] Deduced a trap composed of 109 places in 556 ms of which 9 ms to minimize.
[2024-05-24 15:46:39] [INFO ] Deduced a trap composed of 110 places in 566 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1000 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 15:46:40] [INFO ] Deduced a trap composed of 66 places in 513 ms of which 7 ms to minimize.
[2024-05-24 15:46:40] [INFO ] Deduced a trap composed of 72 places in 542 ms of which 7 ms to minimize.
[2024-05-24 15:46:41] [INFO ] Deduced a trap composed of 106 places in 528 ms of which 6 ms to minimize.
[2024-05-24 15:46:41] [INFO ] Deduced a trap composed of 101 places in 520 ms of which 6 ms to minimize.
[2024-05-24 15:46:42] [INFO ] Deduced a trap composed of 116 places in 533 ms of which 6 ms to minimize.
[2024-05-24 15:46:43] [INFO ] Deduced a trap composed of 101 places in 536 ms of which 6 ms to minimize.
[2024-05-24 15:46:43] [INFO ] Deduced a trap composed of 89 places in 565 ms of which 7 ms to minimize.
[2024-05-24 15:46:44] [INFO ] Deduced a trap composed of 83 places in 556 ms of which 7 ms to minimize.
[2024-05-24 15:46:44] [INFO ] Deduced a trap composed of 77 places in 547 ms of which 7 ms to minimize.
[2024-05-24 15:46:45] [INFO ] Deduced a trap composed of 93 places in 545 ms of which 6 ms to minimize.
SMT process timed out in 77049ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 1036 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1036/1036 places, 3231/3231 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 0 with 1 rules applied. Total rules applied 1 place count 1036 transition count 3230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1035 transition count 3230
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1034 transition count 3229
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1033 transition count 3228
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1033 transition count 3228
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 8 place count 1033 transition count 3228
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 1031 transition count 3226
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1031 transition count 3226
Applied a total of 12 rules in 250 ms. Remains 1031 /1036 variables (removed 5) and now considering 3226/3231 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 1031/1036 places, 3226/3231 transitions.
Successfully simplified 13 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 486 stabilizing places and 1211 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 1318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1287 transition count 2807
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1287 transition count 2807
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 90 place count 1259 transition count 2743
Iterating global reduction 0 with 28 rules applied. Total rules applied 118 place count 1259 transition count 2743
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 133 place count 1244 transition count 2692
Iterating global reduction 0 with 15 rules applied. Total rules applied 148 place count 1244 transition count 2692
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 149 place count 1243 transition count 2688
Iterating global reduction 0 with 1 rules applied. Total rules applied 150 place count 1243 transition count 2688
Applied a total of 150 rules in 164 ms. Remains 1243 /1318 variables (removed 75) and now considering 2688/2844 (removed 156) transitions.
[2024-05-24 15:46:46] [INFO ] Flow matrix only has 2416 transitions (discarded 272 similar events)
// Phase 1: matrix 2416 rows 1243 cols
[2024-05-24 15:46:46] [INFO ] Computed 69 invariants in 28 ms
[2024-05-24 15:46:47] [INFO ] Implicit Places using invariants in 1224 ms returned [101, 171, 172, 175, 289, 347, 425, 454, 484, 528, 575, 576, 603, 604, 614, 615, 663, 710, 733, 758, 780, 789, 823, 824, 946, 1004]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 1226 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1217/1318 places, 2688/2844 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1193 transition count 2664
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1193 transition count 2664
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 72 place count 1169 transition count 2640
Iterating global reduction 0 with 24 rules applied. Total rules applied 96 place count 1169 transition count 2640
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 120 place count 1145 transition count 2616
Iterating global reduction 0 with 24 rules applied. Total rules applied 144 place count 1145 transition count 2616
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 162 place count 1127 transition count 2544
Iterating global reduction 0 with 18 rules applied. Total rules applied 180 place count 1127 transition count 2544
Applied a total of 180 rules in 158 ms. Remains 1127 /1217 variables (removed 90) and now considering 2544/2688 (removed 144) transitions.
[2024-05-24 15:46:47] [INFO ] Flow matrix only has 2272 transitions (discarded 272 similar events)
// Phase 1: matrix 2272 rows 1127 cols
[2024-05-24 15:46:47] [INFO ] Computed 43 invariants in 32 ms
[2024-05-24 15:46:48] [INFO ] Implicit Places using invariants in 1036 ms returned []
[2024-05-24 15:46:48] [INFO ] Flow matrix only has 2272 transitions (discarded 272 similar events)
[2024-05-24 15:46:48] [INFO ] Invariant cache hit.
[2024-05-24 15:46:49] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 15:47:01] [INFO ] Implicit Places using invariants and state equation in 12850 ms returned [1116]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13899 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1126/1318 places, 2544/2844 transitions.
Applied a total of 0 rules in 37 ms. Remains 1126 /1126 variables (removed 0) and now considering 2544/2544 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 15486 ms. Remains : 1126/1318 places, 2544/2844 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 697 ms.
Product exploration explored 100000 steps with 50000 reset in 673 ms.
Computed a total of 294 stabilizing places and 911 stable transitions
Computed a total of 294 stabilizing places and 911 stable transitions
Detected a total of 294/1126 stabilizing places and 911/2544 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-04 finished in 17184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 1318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1289 transition count 2809
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1289 transition count 2809
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 84 place count 1263 transition count 2753
Iterating global reduction 0 with 26 rules applied. Total rules applied 110 place count 1263 transition count 2753
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 125 place count 1248 transition count 2699
Iterating global reduction 0 with 15 rules applied. Total rules applied 140 place count 1248 transition count 2699
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 141 place count 1247 transition count 2695
Iterating global reduction 0 with 1 rules applied. Total rules applied 142 place count 1247 transition count 2695
Applied a total of 142 rules in 172 ms. Remains 1247 /1318 variables (removed 71) and now considering 2695/2844 (removed 149) transitions.
[2024-05-24 15:47:03] [INFO ] Flow matrix only has 2423 transitions (discarded 272 similar events)
// Phase 1: matrix 2423 rows 1247 cols
[2024-05-24 15:47:03] [INFO ] Computed 69 invariants in 30 ms
[2024-05-24 15:47:04] [INFO ] Implicit Places using invariants in 1140 ms returned [173, 174, 177, 293, 294, 348, 426, 452, 455, 531, 578, 579, 606, 607, 617, 618, 666, 713, 736, 761, 783, 792, 826, 827, 949, 1007]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 1143 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1221/1318 places, 2695/2844 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1198 transition count 2672
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1198 transition count 2672
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 1175 transition count 2649
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 1175 transition count 2649
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 115 place count 1152 transition count 2626
Iterating global reduction 0 with 23 rules applied. Total rules applied 138 place count 1152 transition count 2626
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 155 place count 1135 transition count 2558
Iterating global reduction 0 with 17 rules applied. Total rules applied 172 place count 1135 transition count 2558
Applied a total of 172 rules in 175 ms. Remains 1135 /1221 variables (removed 86) and now considering 2558/2695 (removed 137) transitions.
[2024-05-24 15:47:04] [INFO ] Flow matrix only has 2286 transitions (discarded 272 similar events)
// Phase 1: matrix 2286 rows 1135 cols
[2024-05-24 15:47:04] [INFO ] Computed 43 invariants in 22 ms
[2024-05-24 15:47:05] [INFO ] Implicit Places using invariants in 975 ms returned []
[2024-05-24 15:47:05] [INFO ] Flow matrix only has 2286 transitions (discarded 272 similar events)
[2024-05-24 15:47:05] [INFO ] Invariant cache hit.
[2024-05-24 15:47:06] [INFO ] State equation strengthened by 836 read => feed constraints.
[2024-05-24 15:47:17] [INFO ] Implicit Places using invariants and state equation in 11975 ms returned [1109]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12955 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1134/1318 places, 2558/2844 transitions.
Applied a total of 0 rules in 30 ms. Remains 1134 /1134 variables (removed 0) and now considering 2558/2558 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 14476 ms. Remains : 1134/1318 places, 2558/2844 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-06
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-06 finished in 14574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 1318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1287 transition count 2810
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1287 transition count 2810
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 91 place count 1258 transition count 2745
Iterating global reduction 0 with 29 rules applied. Total rules applied 120 place count 1258 transition count 2745
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 136 place count 1242 transition count 2690
Iterating global reduction 0 with 16 rules applied. Total rules applied 152 place count 1242 transition count 2690
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 153 place count 1241 transition count 2686
Iterating global reduction 0 with 1 rules applied. Total rules applied 154 place count 1241 transition count 2686
Applied a total of 154 rules in 166 ms. Remains 1241 /1318 variables (removed 77) and now considering 2686/2844 (removed 158) transitions.
[2024-05-24 15:47:17] [INFO ] Flow matrix only has 2414 transitions (discarded 272 similar events)
// Phase 1: matrix 2414 rows 1241 cols
[2024-05-24 15:47:17] [INFO ] Computed 69 invariants in 33 ms
[2024-05-24 15:47:18] [INFO ] Implicit Places using invariants in 1104 ms returned [101, 171, 172, 175, 289, 290, 345, 423, 449, 452, 482, 526, 573, 574, 601, 602, 612, 613, 661, 708, 731, 756, 778, 787, 821, 822, 944, 1002]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 1106 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1213/1318 places, 2686/2844 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1188 transition count 2661
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1188 transition count 2661
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 75 place count 1163 transition count 2636
Iterating global reduction 0 with 25 rules applied. Total rules applied 100 place count 1163 transition count 2636
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 125 place count 1138 transition count 2611
Iterating global reduction 0 with 25 rules applied. Total rules applied 150 place count 1138 transition count 2611
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 169 place count 1119 transition count 2535
Iterating global reduction 0 with 19 rules applied. Total rules applied 188 place count 1119 transition count 2535
Applied a total of 188 rules in 155 ms. Remains 1119 /1213 variables (removed 94) and now considering 2535/2686 (removed 151) transitions.
[2024-05-24 15:47:19] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
// Phase 1: matrix 2263 rows 1119 cols
[2024-05-24 15:47:19] [INFO ] Computed 41 invariants in 24 ms
[2024-05-24 15:47:19] [INFO ] Implicit Places using invariants in 930 ms returned []
[2024-05-24 15:47:19] [INFO ] Flow matrix only has 2263 transitions (discarded 272 similar events)
[2024-05-24 15:47:19] [INFO ] Invariant cache hit.
[2024-05-24 15:47:20] [INFO ] State equation strengthened by 827 read => feed constraints.
[2024-05-24 15:47:32] [INFO ] Implicit Places using invariants and state equation in 12846 ms returned [1108]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13781 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1118/1318 places, 2535/2844 transitions.
Applied a total of 0 rules in 37 ms. Remains 1118 /1118 variables (removed 0) and now considering 2535/2535 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 15247 ms. Remains : 1118/1318 places, 2535/2844 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-08 finished in 15413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0||F(p1)))'
Support contains 3 out of 1318 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1318 transition count 2823
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1297 transition count 2823
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 42 place count 1297 transition count 2796
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 96 place count 1270 transition count 2796
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 114 place count 1252 transition count 2772
Iterating global reduction 2 with 18 rules applied. Total rules applied 132 place count 1252 transition count 2772
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 132 place count 1252 transition count 2771
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 134 place count 1251 transition count 2771
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 149 place count 1236 transition count 2723
Iterating global reduction 2 with 15 rules applied. Total rules applied 164 place count 1236 transition count 2723
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 165 place count 1235 transition count 2719
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 1235 transition count 2719
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 228 place count 1204 transition count 2688
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 239 place count 1193 transition count 2677
Iterating global reduction 2 with 11 rules applied. Total rules applied 250 place count 1193 transition count 2677
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 261 place count 1182 transition count 2633
Iterating global reduction 2 with 11 rules applied. Total rules applied 272 place count 1182 transition count 2633
Applied a total of 272 rules in 399 ms. Remains 1182 /1318 variables (removed 136) and now considering 2633/2844 (removed 211) transitions.
[2024-05-24 15:47:33] [INFO ] Flow matrix only has 2361 transitions (discarded 272 similar events)
// Phase 1: matrix 2361 rows 1182 cols
[2024-05-24 15:47:33] [INFO ] Computed 69 invariants in 31 ms
[2024-05-24 15:47:34] [INFO ] Implicit Places using invariants in 1071 ms returned [93, 153, 157, 269, 270, 324, 398, 422, 425, 455, 496, 540, 541, 565, 566, 576, 577, 619, 664, 685, 733, 741, 775, 896, 954]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 1073 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1157/1318 places, 2633/2844 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1142 transition count 2618
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1142 transition count 2618
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1127 transition count 2603
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1127 transition count 2603
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 69 place count 1118 transition count 2567
Iterating global reduction 0 with 9 rules applied. Total rules applied 78 place count 1118 transition count 2567
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 92 place count 1111 transition count 2560
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 1104 transition count 2553
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 1104 transition count 2553
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 113 place count 1097 transition count 2525
Iterating global reduction 0 with 7 rules applied. Total rules applied 120 place count 1097 transition count 2525
Applied a total of 120 rules in 324 ms. Remains 1097 /1157 variables (removed 60) and now considering 2525/2633 (removed 108) transitions.
[2024-05-24 15:47:34] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
// Phase 1: matrix 2253 rows 1097 cols
[2024-05-24 15:47:34] [INFO ] Computed 44 invariants in 20 ms
[2024-05-24 15:47:35] [INFO ] Implicit Places using invariants in 994 ms returned []
[2024-05-24 15:47:35] [INFO ] Flow matrix only has 2253 transitions (discarded 272 similar events)
[2024-05-24 15:47:35] [INFO ] Invariant cache hit.
[2024-05-24 15:47:36] [INFO ] State equation strengthened by 842 read => feed constraints.
[2024-05-24 15:47:46] [INFO ] Implicit Places using invariants and state equation in 10620 ms returned []
Implicit Place search using SMT with State Equation took 11615 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1097/1318 places, 2525/2844 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13413 ms. Remains : 1097/1318 places, 2525/2844 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-09
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-09 finished in 13516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 1318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1287 transition count 2807
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1287 transition count 2807
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 91 place count 1258 transition count 2742
Iterating global reduction 0 with 29 rules applied. Total rules applied 120 place count 1258 transition count 2742
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 135 place count 1243 transition count 2691
Iterating global reduction 0 with 15 rules applied. Total rules applied 150 place count 1243 transition count 2691
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 151 place count 1242 transition count 2687
Iterating global reduction 0 with 1 rules applied. Total rules applied 152 place count 1242 transition count 2687
Applied a total of 152 rules in 162 ms. Remains 1242 /1318 variables (removed 76) and now considering 2687/2844 (removed 157) transitions.
[2024-05-24 15:47:46] [INFO ] Flow matrix only has 2415 transitions (discarded 272 similar events)
// Phase 1: matrix 2415 rows 1242 cols
[2024-05-24 15:47:46] [INFO ] Computed 69 invariants in 29 ms
[2024-05-24 15:47:47] [INFO ] Implicit Places using invariants in 1126 ms returned [101, 171, 172, 175, 289, 290, 344, 422, 448, 451, 481, 525, 572, 573, 600, 613, 614, 662, 709, 732, 757, 779, 788, 822, 823, 945, 1003]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 1128 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1215/1318 places, 2687/2844 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1191 transition count 2663
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1191 transition count 2663
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 72 place count 1167 transition count 2639
Iterating global reduction 0 with 24 rules applied. Total rules applied 96 place count 1167 transition count 2639
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 120 place count 1143 transition count 2615
Iterating global reduction 0 with 24 rules applied. Total rules applied 144 place count 1143 transition count 2615
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 162 place count 1125 transition count 2543
Iterating global reduction 0 with 18 rules applied. Total rules applied 180 place count 1125 transition count 2543
Applied a total of 180 rules in 159 ms. Remains 1125 /1215 variables (removed 90) and now considering 2543/2687 (removed 144) transitions.
[2024-05-24 15:47:47] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
// Phase 1: matrix 2271 rows 1125 cols
[2024-05-24 15:47:47] [INFO ] Computed 42 invariants in 30 ms
[2024-05-24 15:47:48] [INFO ] Implicit Places using invariants in 978 ms returned []
[2024-05-24 15:47:48] [INFO ] Flow matrix only has 2271 transitions (discarded 272 similar events)
[2024-05-24 15:47:48] [INFO ] Invariant cache hit.
[2024-05-24 15:47:49] [INFO ] State equation strengthened by 830 read => feed constraints.
[2024-05-24 15:48:02] [INFO ] Implicit Places using invariants and state equation in 13061 ms returned [1114]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 14042 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1124/1318 places, 2543/2844 transitions.
Applied a total of 0 rules in 33 ms. Remains 1124 /1124 variables (removed 0) and now considering 2543/2543 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 15526 ms. Remains : 1124/1318 places, 2543/2844 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-11
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-11 finished in 15652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 4 out of 1318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 1289 transition count 2809
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 1289 transition count 2809
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 84 place count 1263 transition count 2747
Iterating global reduction 0 with 26 rules applied. Total rules applied 110 place count 1263 transition count 2747
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 124 place count 1249 transition count 2700
Iterating global reduction 0 with 14 rules applied. Total rules applied 138 place count 1249 transition count 2700
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 139 place count 1248 transition count 2696
Iterating global reduction 0 with 1 rules applied. Total rules applied 140 place count 1248 transition count 2696
Applied a total of 140 rules in 159 ms. Remains 1248 /1318 variables (removed 70) and now considering 2696/2844 (removed 148) transitions.
[2024-05-24 15:48:02] [INFO ] Flow matrix only has 2424 transitions (discarded 272 similar events)
// Phase 1: matrix 2424 rows 1248 cols
[2024-05-24 15:48:02] [INFO ] Computed 69 invariants in 28 ms
[2024-05-24 15:48:03] [INFO ] Implicit Places using invariants in 1090 ms returned [101, 171, 172, 175, 289, 290, 344, 422, 448, 451, 481, 525, 572, 573, 600, 601, 611, 612, 660, 734, 759, 781, 790, 825, 950, 1008]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 1095 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1222/1318 places, 2696/2844 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 1199 transition count 2673
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 1199 transition count 2673
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 69 place count 1176 transition count 2650
Iterating global reduction 0 with 23 rules applied. Total rules applied 92 place count 1176 transition count 2650
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 115 place count 1153 transition count 2627
Iterating global reduction 0 with 23 rules applied. Total rules applied 138 place count 1153 transition count 2627
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 154 place count 1137 transition count 2563
Iterating global reduction 0 with 16 rules applied. Total rules applied 170 place count 1137 transition count 2563
Applied a total of 170 rules in 158 ms. Remains 1137 /1222 variables (removed 85) and now considering 2563/2696 (removed 133) transitions.
[2024-05-24 15:48:03] [INFO ] Flow matrix only has 2291 transitions (discarded 272 similar events)
// Phase 1: matrix 2291 rows 1137 cols
[2024-05-24 15:48:03] [INFO ] Computed 43 invariants in 28 ms
[2024-05-24 15:48:04] [INFO ] Implicit Places using invariants in 971 ms returned []
[2024-05-24 15:48:04] [INFO ] Flow matrix only has 2291 transitions (discarded 272 similar events)
[2024-05-24 15:48:04] [INFO ] Invariant cache hit.
[2024-05-24 15:48:05] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 15:48:16] [INFO ] Implicit Places using invariants and state equation in 12329 ms returned [1111]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13303 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1136/1318 places, 2563/2844 transitions.
Applied a total of 0 rules in 30 ms. Remains 1136 /1136 variables (removed 0) and now considering 2563/2563 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 14746 ms. Remains : 1136/1318 places, 2563/2844 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-13
Stuttering criterion allowed to conclude after 40 steps with 0 reset in 0 ms.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-13 finished in 14886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G(p1))))'
Support contains 5 out of 1318 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1290 transition count 2810
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1290 transition count 2810
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 81 place count 1265 transition count 2755
Iterating global reduction 0 with 25 rules applied. Total rules applied 106 place count 1265 transition count 2755
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 120 place count 1251 transition count 2705
Iterating global reduction 0 with 14 rules applied. Total rules applied 134 place count 1251 transition count 2705
Applied a total of 134 rules in 132 ms. Remains 1251 /1318 variables (removed 67) and now considering 2705/2844 (removed 139) transitions.
[2024-05-24 15:48:17] [INFO ] Flow matrix only has 2433 transitions (discarded 272 similar events)
// Phase 1: matrix 2433 rows 1251 cols
[2024-05-24 15:48:17] [INFO ] Computed 69 invariants in 32 ms
[2024-05-24 15:48:18] [INFO ] Implicit Places using invariants in 1161 ms returned [101, 171, 172, 289, 290, 425, 451, 454, 484, 577, 578, 605, 606, 616, 617, 665, 712, 735, 760, 782, 827, 828, 950, 1008]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 1163 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1227/1318 places, 2705/2844 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1205 transition count 2683
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1205 transition count 2683
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 66 place count 1183 transition count 2661
Iterating global reduction 0 with 22 rules applied. Total rules applied 88 place count 1183 transition count 2661
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 110 place count 1161 transition count 2639
Iterating global reduction 0 with 22 rules applied. Total rules applied 132 place count 1161 transition count 2639
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 148 place count 1145 transition count 2575
Iterating global reduction 0 with 16 rules applied. Total rules applied 164 place count 1145 transition count 2575
Applied a total of 164 rules in 155 ms. Remains 1145 /1227 variables (removed 82) and now considering 2575/2705 (removed 130) transitions.
[2024-05-24 15:48:18] [INFO ] Flow matrix only has 2303 transitions (discarded 272 similar events)
// Phase 1: matrix 2303 rows 1145 cols
[2024-05-24 15:48:18] [INFO ] Computed 45 invariants in 33 ms
[2024-05-24 15:48:19] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2024-05-24 15:48:19] [INFO ] Flow matrix only has 2303 transitions (discarded 272 similar events)
[2024-05-24 15:48:19] [INFO ] Invariant cache hit.
[2024-05-24 15:48:20] [INFO ] State equation strengthened by 845 read => feed constraints.
[2024-05-24 15:48:32] [INFO ] Implicit Places using invariants and state equation in 13475 ms returned []
Implicit Place search using SMT with State Equation took 14496 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1145/1318 places, 2575/2844 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15948 ms. Remains : 1145/1318 places, 2575/2844 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-14
Product exploration explored 100000 steps with 2408 reset in 477 ms.
Product exploration explored 100000 steps with 2400 reset in 559 ms.
Computed a total of 313 stabilizing places and 942 stable transitions
Computed a total of 313 stabilizing places and 942 stable transitions
Detected a total of 313/1145 stabilizing places and 942/2575 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 180 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (957 resets) in 444 ms. (89 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (244 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
[2024-05-24 15:48:34] [INFO ] Flow matrix only has 2303 transitions (discarded 272 similar events)
[2024-05-24 15:48:34] [INFO ] Invariant cache hit.
[2024-05-24 15:48:34] [INFO ] State equation strengthened by 845 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1040/1045 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1045 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/1079 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1079 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/1109 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/1137 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1137 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1145 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1145 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2303/3448 variables, 1145/1190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3448 variables, 845/2035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3448 variables, 0/2035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/3448 variables, 0/2035 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3448/3448 variables, and 2035 constraints, problems are : Problem set: 0 solved, 1 unsolved in 886 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 1145/1145 constraints, ReadFeed: 845/845 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1040/1045 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1045 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/1079 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1079 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 1109/3448 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 4/32 constraints, Generalized P Invariants (flows): 5/13 constraints, State Equation: 0/1145 constraints, ReadFeed: 0/845 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1100ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 265 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Support contains 3 out of 1145 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1145/1145 places, 2575/2575 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1145 transition count 2563
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 1133 transition count 2563
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 24 place count 1133 transition count 2553
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 44 place count 1123 transition count 2553
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 88 place count 1101 transition count 2531
Applied a total of 88 rules in 125 ms. Remains 1101 /1145 variables (removed 44) and now considering 2531/2575 (removed 44) transitions.
[2024-05-24 15:48:36] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
// Phase 1: matrix 2259 rows 1101 cols
[2024-05-24 15:48:36] [INFO ] Computed 45 invariants in 29 ms
[2024-05-24 15:48:37] [INFO ] Implicit Places using invariants in 998 ms returned []
[2024-05-24 15:48:37] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2024-05-24 15:48:37] [INFO ] Invariant cache hit.
[2024-05-24 15:48:38] [INFO ] State equation strengthened by 845 read => feed constraints.
[2024-05-24 15:48:48] [INFO ] Implicit Places using invariants and state equation in 11342 ms returned []
Implicit Place search using SMT with State Equation took 12346 ms to find 0 implicit places.
[2024-05-24 15:48:48] [INFO ] Redundant transitions in 116 ms returned []
Running 2514 sub problems to find dead transitions.
[2024-05-24 15:48:48] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2024-05-24 15:48:48] [INFO ] Invariant cache hit.
[2024-05-24 15:48:48] [INFO ] State equation strengthened by 845 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/1099 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2514 unsolved
SMT process timed out in 33239ms, After SMT, problems are : Problem set: 0 solved, 2514 unsolved
Search for dead transitions found 0 dead transitions in 33270ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1101/1145 places, 2531/2575 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45889 ms. Remains : 1101/1145 places, 2531/2575 transitions.
Computed a total of 286 stabilizing places and 915 stable transitions
Computed a total of 286 stabilizing places and 915 stable transitions
Detected a total of 286/1101 stabilizing places and 915/2531 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
RANDOM walk for 2024 steps (65 resets) in 22 ms. (88 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 3365 reset in 547 ms.
Product exploration explored 100000 steps with 3366 reset in 517 ms.
Support contains 3 out of 1101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1101/1101 places, 2531/2531 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1100 transition count 2530
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1100 transition count 2530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1099 transition count 2526
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1099 transition count 2526
Applied a total of 4 rules in 137 ms. Remains 1099 /1101 variables (removed 2) and now considering 2526/2531 (removed 5) transitions.
[2024-05-24 15:49:23] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
// Phase 1: matrix 2254 rows 1099 cols
[2024-05-24 15:49:23] [INFO ] Computed 45 invariants in 30 ms
[2024-05-24 15:49:24] [INFO ] Implicit Places using invariants in 965 ms returned [156, 693]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1006 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1097/1101 places, 2526/2531 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1096 transition count 2525
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1095 transition count 2524
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1095 transition count 2524
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1094 transition count 2520
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1094 transition count 2520
Applied a total of 6 rules in 173 ms. Remains 1094 /1097 variables (removed 3) and now considering 2520/2526 (removed 6) transitions.
[2024-05-24 15:49:24] [INFO ] Flow matrix only has 2248 transitions (discarded 272 similar events)
// Phase 1: matrix 2248 rows 1094 cols
[2024-05-24 15:49:24] [INFO ] Computed 43 invariants in 31 ms
[2024-05-24 15:49:25] [INFO ] Implicit Places using invariants in 1030 ms returned []
[2024-05-24 15:49:25] [INFO ] Flow matrix only has 2248 transitions (discarded 272 similar events)
[2024-05-24 15:49:25] [INFO ] Invariant cache hit.
[2024-05-24 15:49:26] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 15:49:36] [INFO ] Implicit Places using invariants and state equation in 10789 ms returned [1078]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11824 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1093/1101 places, 2520/2531 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1093 transition count 2519
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1092 transition count 2519
Applied a total of 2 rules in 70 ms. Remains 1092 /1093 variables (removed 1) and now considering 2519/2520 (removed 1) transitions.
[2024-05-24 15:49:36] [INFO ] Flow matrix only has 2247 transitions (discarded 272 similar events)
// Phase 1: matrix 2247 rows 1092 cols
[2024-05-24 15:49:36] [INFO ] Computed 42 invariants in 26 ms
[2024-05-24 15:49:37] [INFO ] Implicit Places using invariants in 969 ms returned []
[2024-05-24 15:49:37] [INFO ] Flow matrix only has 2247 transitions (discarded 272 similar events)
[2024-05-24 15:49:37] [INFO ] Invariant cache hit.
[2024-05-24 15:49:38] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 15:49:48] [INFO ] Implicit Places using invariants and state equation in 10383 ms returned []
Implicit Place search using SMT with State Equation took 11354 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1092/1101 places, 2519/2531 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 24566 ms. Remains : 1092/1101 places, 2519/2531 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-14 finished in 91212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G(p1))))'
Found a Lengthening insensitive property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-14
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 5 out of 1318 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1318/1318 places, 2844/2844 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 1318 transition count 2823
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 1297 transition count 2823
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 42 place count 1297 transition count 2796
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 96 place count 1270 transition count 2796
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 112 place count 1254 transition count 2774
Iterating global reduction 2 with 16 rules applied. Total rules applied 128 place count 1254 transition count 2774
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 128 place count 1254 transition count 2773
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 130 place count 1253 transition count 2773
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 143 place count 1240 transition count 2730
Iterating global reduction 2 with 13 rules applied. Total rules applied 156 place count 1240 transition count 2730
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 218 place count 1209 transition count 2699
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 230 place count 1197 transition count 2687
Iterating global reduction 2 with 12 rules applied. Total rules applied 242 place count 1197 transition count 2687
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 254 place count 1185 transition count 2639
Iterating global reduction 2 with 12 rules applied. Total rules applied 266 place count 1185 transition count 2639
Applied a total of 266 rules in 281 ms. Remains 1185 /1318 variables (removed 133) and now considering 2639/2844 (removed 205) transitions.
[2024-05-24 15:49:48] [INFO ] Flow matrix only has 2367 transitions (discarded 272 similar events)
// Phase 1: matrix 2367 rows 1185 cols
[2024-05-24 15:49:48] [INFO ] Computed 69 invariants in 28 ms
[2024-05-24 15:49:49] [INFO ] Implicit Places using invariants in 1058 ms returned [93, 153, 154, 267, 268, 399, 423, 426, 456, 543, 544, 568, 569, 579, 580, 622, 667, 688, 713, 733, 777, 778, 895, 953]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 1061 ms to find 24 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1161/1318 places, 2639/2844 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1146 transition count 2624
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1146 transition count 2624
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 45 place count 1131 transition count 2609
Iterating global reduction 0 with 15 rules applied. Total rules applied 60 place count 1131 transition count 2609
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 1123 transition count 2577
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 1123 transition count 2577
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 90 place count 1116 transition count 2570
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 1109 transition count 2563
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 1109 transition count 2563
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 112 place count 1101 transition count 2531
Iterating global reduction 0 with 8 rules applied. Total rules applied 120 place count 1101 transition count 2531
Applied a total of 120 rules in 270 ms. Remains 1101 /1161 variables (removed 60) and now considering 2531/2639 (removed 108) transitions.
[2024-05-24 15:49:50] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
// Phase 1: matrix 2259 rows 1101 cols
[2024-05-24 15:49:50] [INFO ] Computed 45 invariants in 45 ms
[2024-05-24 15:49:51] [INFO ] Implicit Places using invariants in 991 ms returned []
[2024-05-24 15:49:51] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2024-05-24 15:49:51] [INFO ] Invariant cache hit.
[2024-05-24 15:49:51] [INFO ] State equation strengthened by 845 read => feed constraints.
[2024-05-24 15:50:02] [INFO ] Implicit Places using invariants and state equation in 10990 ms returned []
Implicit Place search using SMT with State Equation took 11983 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 1101/1318 places, 2531/2844 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 13595 ms. Remains : 1101/1318 places, 2531/2844 transitions.
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-14
Product exploration explored 100000 steps with 3377 reset in 513 ms.
Product exploration explored 100000 steps with 3374 reset in 545 ms.
Computed a total of 286 stabilizing places and 915 stable transitions
Computed a total of 286 stabilizing places and 915 stable transitions
Detected a total of 286/1101 stabilizing places and 915/2531 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 174 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (1343 resets) in 368 ms. (108 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (264 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
[2024-05-24 15:50:03] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2024-05-24 15:50:03] [INFO ] Invariant cache hit.
[2024-05-24 15:50:03] [INFO ] State equation strengthened by 845 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1018 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1018 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/1035 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/1065 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1065 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 28/1093 variables, 28/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1093 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1101 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1101 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2259/3360 variables, 1101/1146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3360 variables, 845/1991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3360 variables, 0/1991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/3360 variables, 0/1991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3360/3360 variables, and 1991 constraints, problems are : Problem set: 0 solved, 1 unsolved in 928 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 1101/1101 constraints, ReadFeed: 845/845 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1013/1018 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1018 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/1035 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 1065/3360 variables, and 9 constraints, problems are : Problem set: 1 solved, 0 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 4/32 constraints, Generalized P Invariants (flows): 5/13 constraints, State Equation: 0/1101 constraints, ReadFeed: 0/845 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1134ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 271 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1)]
Support contains 3 out of 1101 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1101/1101 places, 2531/2531 transitions.
Applied a total of 0 rules in 64 ms. Remains 1101 /1101 variables (removed 0) and now considering 2531/2531 (removed 0) transitions.
[2024-05-24 15:50:05] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2024-05-24 15:50:05] [INFO ] Invariant cache hit.
[2024-05-24 15:50:06] [INFO ] Implicit Places using invariants in 949 ms returned []
[2024-05-24 15:50:06] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2024-05-24 15:50:06] [INFO ] Invariant cache hit.
[2024-05-24 15:50:07] [INFO ] State equation strengthened by 845 read => feed constraints.
[2024-05-24 15:50:18] [INFO ] Implicit Places using invariants and state equation in 12104 ms returned []
Implicit Place search using SMT with State Equation took 13054 ms to find 0 implicit places.
[2024-05-24 15:50:18] [INFO ] Redundant transitions in 119 ms returned []
Running 2514 sub problems to find dead transitions.
[2024-05-24 15:50:18] [INFO ] Flow matrix only has 2259 transitions (discarded 272 similar events)
[2024-05-24 15:50:18] [INFO ] Invariant cache hit.
[2024-05-24 15:50:18] [INFO ] State equation strengthened by 845 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 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.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 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 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 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.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 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.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 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 1.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.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 0.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 1.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 1.0)
(s475 1.0)
(s476 0.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 0.0)
(s488 0.0)
(s489 1.0)
(s490 0.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 1.0)
(s504 0.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 0.0)
(s514 0.0)
(s515 1.0)
(s516 0.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 1.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 0.0)
(s537 1.0)
(s538 1.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 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 0.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.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 1.0)
(s577 0.0)
(s578 0.0)
(s579 1.0)
(s580 0.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 0.0)
(s591 1.0)
(s592 0.0)
(s593 0.0)
(s594 1.0)
(s595 0.0)
(s596 1.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 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 0.0)
(s616 1.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 1.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 1.0)
(s630 0.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 0.0)
(s638 0.0)
(s639 1.0)
(s640 0.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 0.0)
(s649 1.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 1.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 1.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 1.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 1.0)
(s672 1.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 1.0)
(s677 0.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 0.0)
(s684 0.0)
(s685 1.0)
(s686 0.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 0.0)
(s698 1.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 1.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 1.0)
(s709 0.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 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 1.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 1.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 1.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 1.0)
(s744 0.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 0.0)
(s751 0.0)
(s752 1.0)
(s753 0.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 0.0)
(s760 1.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 1.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 1.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 1.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 1.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 1.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 1.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 1.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 1.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 1.0)
(s828 0.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 0.0)
(s833 0.0)
(s834 1.0)
(s835 0.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 0.0)
(s841 1.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 1.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 1.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 1.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 1.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 1.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 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 1.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 0.0)
(s904 0.0)
(s905 0.0)
(s906 1.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 1.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 1.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1099 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 2514 unsolved
SMT process timed out in 32934ms, After SMT, problems are : Problem set: 0 solved, 2514 unsolved
Search for dead transitions found 0 dead transitions in 32962ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46214 ms. Remains : 1101/1101 places, 2531/2531 transitions.
Computed a total of 286 stabilizing places and 915 stable transitions
Computed a total of 286 stabilizing places and 915 stable transitions
Detected a total of 286/1101 stabilizing places and 915/2531 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
RANDOM walk for 2282 steps (74 resets) in 25 ms. (87 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 3368 reset in 495 ms.
Product exploration explored 100000 steps with 3365 reset in 538 ms.
Support contains 3 out of 1101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1101/1101 places, 2531/2531 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1100 transition count 2530
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1100 transition count 2530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1099 transition count 2526
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1099 transition count 2526
Applied a total of 4 rules in 123 ms. Remains 1099 /1101 variables (removed 2) and now considering 2526/2531 (removed 5) transitions.
[2024-05-24 15:50:53] [INFO ] Flow matrix only has 2254 transitions (discarded 272 similar events)
// Phase 1: matrix 2254 rows 1099 cols
[2024-05-24 15:50:53] [INFO ] Computed 45 invariants in 32 ms
[2024-05-24 15:50:54] [INFO ] Implicit Places using invariants in 988 ms returned [153, 690]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 990 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1097/1101 places, 2526/2531 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1096 transition count 2525
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1095 transition count 2524
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1095 transition count 2524
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1094 transition count 2520
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1094 transition count 2520
Applied a total of 6 rules in 176 ms. Remains 1094 /1097 variables (removed 3) and now considering 2520/2526 (removed 6) transitions.
[2024-05-24 15:50:54] [INFO ] Flow matrix only has 2248 transitions (discarded 272 similar events)
// Phase 1: matrix 2248 rows 1094 cols
[2024-05-24 15:50:54] [INFO ] Computed 43 invariants in 27 ms
[2024-05-24 15:50:55] [INFO ] Implicit Places using invariants in 1004 ms returned []
[2024-05-24 15:50:55] [INFO ] Flow matrix only has 2248 transitions (discarded 272 similar events)
[2024-05-24 15:50:55] [INFO ] Invariant cache hit.
[2024-05-24 15:50:55] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 15:51:06] [INFO ] Implicit Places using invariants and state equation in 11152 ms returned [1073]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 12158 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 1093/1101 places, 2520/2531 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1093 transition count 2519
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1092 transition count 2519
Applied a total of 2 rules in 78 ms. Remains 1092 /1093 variables (removed 1) and now considering 2519/2520 (removed 1) transitions.
[2024-05-24 15:51:06] [INFO ] Flow matrix only has 2247 transitions (discarded 272 similar events)
// Phase 1: matrix 2247 rows 1092 cols
[2024-05-24 15:51:06] [INFO ] Computed 42 invariants in 31 ms
[2024-05-24 15:51:07] [INFO ] Implicit Places using invariants in 962 ms returned []
[2024-05-24 15:51:07] [INFO ] Flow matrix only has 2247 transitions (discarded 272 similar events)
[2024-05-24 15:51:07] [INFO ] Invariant cache hit.
[2024-05-24 15:51:08] [INFO ] State equation strengthened by 839 read => feed constraints.
[2024-05-24 15:51:18] [INFO ] Implicit Places using invariants and state equation in 11134 ms returned []
Implicit Place search using SMT with State Equation took 12097 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 1092/1101 places, 2519/2531 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 25622 ms. Remains : 1092/1101 places, 2519/2531 transitions.
Treatment of property MultiCrashLeafsetExtension-PT-S16C04-LTLCardinality-14 finished in 90416 ms.
[2024-05-24 15:51:18] [INFO ] Flatten gal took : 110 ms
[2024-05-24 15:51:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-24 15:51:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1318 places, 2844 transitions and 12522 arcs took 21 ms.
Total runtime 417507 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MultiCrashLeafsetExtension-PT-S16C04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1318
TRANSITIONS: 2844
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.063s, Sys 0.008s]


SAVING FILE /home/mcc/execution/405/model (.net / .def) ...
EXPORT TIME: [User 0.009s, 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: 1680
MODEL NAME: /home/mcc/execution/405/model
1318 places, 2844 transitions.

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..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
EXITCODE: 80
----------------------------------------------------------------------

BK_STOP 1716567354425

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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-S16C04"
export BK_EXAMINATION="LTLCardinality"
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-S16C04, examination is LTLCardinality"
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-171654349000019"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C04.tgz
mv MultiCrashLeafsetExtension-PT-S16C04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;