Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r179-tall-165277027000241.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is PolyORBLF-PT-S04J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277027000241
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 21K Apr 29 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 29 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 29 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 141K Apr 29 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 12K May 9 08:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 46K May 9 08:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 9 08:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 86K May 9 08:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K May 9 08:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 3.3M May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652834549241

Running Version 0
[2022-05-18 00:42:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 00:42:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:42:31] [INFO ] Load time of PNML (sax parser for PT used): 269 ms
[2022-05-18 00:42:31] [INFO ] Transformed 712 places.
[2022-05-18 00:42:31] [INFO ] Transformed 4012 transitions.
[2022-05-18 00:42:31] [INFO ] Parsed PT model containing 712 places and 4012 transitions in 352 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Normalized transition count is 1812 out of 1844 initially.
// Phase 1: matrix 1812 rows 712 cols
[2022-05-18 00:42:31] [INFO ] Computed 54 place invariants in 164 ms
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 15) seen :36
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 15) seen :34
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 15) seen :32
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 15) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 15) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 15) seen :32
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 15) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 15) seen :33
[2022-05-18 00:42:32] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 712 cols
[2022-05-18 00:42:32] [INFO ] Computed 54 place invariants in 96 ms
[2022-05-18 00:42:33] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2022-05-18 00:42:33] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 33 ms returned unsat
[2022-05-18 00:42:33] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2022-05-18 00:42:33] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 30 ms returned unsat
[2022-05-18 00:42:33] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned unsat
[2022-05-18 00:42:33] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-18 00:42:33] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 57 ms returned unsat
[2022-05-18 00:42:33] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-18 00:42:33] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 82 ms returned unsat
[2022-05-18 00:42:33] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-18 00:42:33] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 35 ms returned unsat
[2022-05-18 00:42:34] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-18 00:42:34] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 26 ms returned unsat
[2022-05-18 00:42:34] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2022-05-18 00:42:34] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 38 ms returned unsat
[2022-05-18 00:42:34] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-18 00:42:34] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 36 ms returned sat
[2022-05-18 00:42:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:42:36] [INFO ] [Real]Absence check using state equation in 2262 ms returned sat
[2022-05-18 00:42:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:42:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-18 00:42:36] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 32 ms returned sat
[2022-05-18 00:42:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:42:41] [INFO ] [Nat]Absence check using state equation in 4912 ms returned unknown
[2022-05-18 00:42:41] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-18 00:42:41] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 34 ms returned sat
[2022-05-18 00:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:42:43] [INFO ] [Real]Absence check using state equation in 1450 ms returned sat
[2022-05-18 00:42:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:42:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-18 00:42:43] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 34 ms returned sat
[2022-05-18 00:42:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:42:48] [INFO ] [Nat]Absence check using state equation in 4903 ms returned unknown
[2022-05-18 00:42:48] [INFO ] [Real]Absence check using 13 positive place invariants in 37 ms returned sat
[2022-05-18 00:42:48] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 36 ms returned unsat
[2022-05-18 00:42:48] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-18 00:42:48] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 38 ms returned unsat
[2022-05-18 00:42:48] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-18 00:42:48] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 39 ms returned unsat
[2022-05-18 00:42:48] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-18 00:42:48] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 25 ms returned unsat
[2022-05-18 00:42:48] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-18 00:42:49] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 47 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 4, 1, 1, 1, 4, 10, 4, -1, -1, 1, 1, 1, 4, 1] Max seen :[1, 4, 1, 1, 1, 4, 10, 4, 1, 1, 1, 1, 1, 4, 1]
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 712 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 708 transition count 1774
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 145 place count 638 transition count 1773
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 637 transition count 1773
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 146 place count 637 transition count 1693
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 306 place count 557 transition count 1693
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 464 place count 478 transition count 1614
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 3 with 16 rules applied. Total rules applied 480 place count 478 transition count 1598
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 496 place count 462 transition count 1598
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 497 place count 462 transition count 1598
Applied a total of 497 rules in 373 ms. Remains 462 /712 variables (removed 250) and now considering 1598/1844 (removed 246) transitions.
[2022-05-18 00:42:49] [INFO ] Flow matrix only has 1566 transitions (discarded 32 similar events)
// Phase 1: matrix 1566 rows 462 cols
[2022-05-18 00:42:49] [INFO ] Computed 50 place invariants in 35 ms
[2022-05-18 00:42:50] [INFO ] Dead Transitions using invariants and state equation in 990 ms returned [1017, 1019, 1020, 1021, 1022, 1024, 1025, 1026, 1028, 1029, 1030, 1031, 1032, 1033, 1035, 1036, 1037, 1038, 1039, 1040, 1042, 1043, 1044, 1045, 1047, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1060, 1061, 1062, 1063, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1073, 1074, 1075, 1076, 1077, 1079, 1081, 1082, 1084, 1085, 1090, 1091, 1094, 1095, 1096, 1097, 1098, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1113, 1115, 1117, 1118, 1120, 1121, 1123, 1125, 1126, 1127, 1129, 1130, 1132, 1135, 1136, 1137, 1138, 1139, 1140, 1141, 1142, 1143, 1144, 1145, 1147, 1148, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1158, 1159, 1160, 1162, 1163, 1165, 1166, 1167, 1168, 1169, 1172, 1175, 1176, 1178, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1193, 1196, 1197, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1214, 1215, 1216, 1218, 1219, 1220, 1222, 1224, 1225, 1226, 1227, 1236, 1237, 1239, 1240, 1242, 1243, 1245, 1246, 1247, 1248, 1249, 1250, 1252, 1255, 1256, 1257, 1258, 1259, 1261, 1262, 1264, 1265, 1266, 1267, 1269, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1280, 1281, 1282, 1284, 1285, 1286, 1287, 1288, 1289, 1291, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1301, 1302, 1303, 1304, 1306, 1307, 1308, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1318, 1320, 1323, 1324, 1325, 1326, 1330, 1331, 1332, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1343, 1344, 1345, 1346, 1347, 1348, 1349, 1350, 1351, 1352, 1353, 1356, 1358, 1359, 1360, 1361, 1362, 1364, 1365, 1366, 1367, 1368, 1370, 1371, 1372, 1373, 1378, 1379, 1380, 1381, 1382, 1384, 1385, 1386, 1390, 1391, 1392, 1393, 1394, 1396, 1397, 1398, 1399, 1400, 1402, 1403, 1404, 1406, 1407, 1408, 1409, 1411, 1413, 1414, 1415, 1416, 1417, 1418, 1419, 1420, 1422, 1424, 1425, 1426, 1427, 1429, 1431, 1432, 1433, 1434, 1435, 1436, 1437, 1439, 1441, 1442, 1443, 1444, 1445, 1446, 1448, 1449, 1450, 1451, 1452, 1453, 1455, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, 1467, 1471, 1473, 1474, 1475, 1476, 1477, 1478, 1480, 1481, 1482, 1483, 1484, 1486, 1487, 1490, 1491, 1492, 1493, 1494, 1495, 1496, 1497, 1498, 1500, 1501, 1502, 1503, 1504, 1505, 1506, 1507, 1508, 1509, 1511, 1512, 1513, 1514, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1529, 1530, 1531, 1533, 1534, 1536, 1538, 1539, 1540, 1544, 1545, 1546, 1547, 1548, 1549, 1550, 1551, 1552, 1553, 1554, 1555, 1559, 1560, 1561, 1562, 1563, 1564, 1565, 1567, 1569, 1570, 1571, 1572, 1574, 1575, 1576, 1578, 1579, 1580, 1582, 1583, 1584, 1586, 1587, 1588]
Found 432 dead transitions using SMT.
Drop transitions removed 432 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 432 transitions :[1588, 1587, 1586, 1584, 1583, 1582, 1580, 1579, 1578, 1576, 1575, 1574, 1572, 1571, 1570, 1569, 1567, 1565, 1564, 1563, 1562, 1561, 1560, 1559, 1555, 1554, 1553, 1552, 1551, 1550, 1549, 1548, 1547, 1546, 1545, 1544, 1540, 1539, 1538, 1536, 1534, 1533, 1531, 1530, 1529, 1528, 1527, 1526, 1525, 1524, 1523, 1522, 1521, 1520, 1514, 1513, 1512, 1511, 1509, 1508, 1507, 1506, 1505, 1504, 1503, 1502, 1501, 1500, 1498, 1497, 1496, 1495, 1494, 1493, 1492, 1491, 1490, 1487, 1486, 1484, 1483, 1482, 1481, 1480, 1478, 1477, 1476, 1475, 1474, 1473, 1471, 1467, 1465, 1464, 1463, 1462, 1461, 1460, 1459, 1458, 1457, 1455, 1453, 1452, 1451, 1450, 1449, 1448, 1446, 1445, 1444, 1443, 1442, 1441, 1439, 1437, 1436, 1435, 1434, 1433, 1432, 1431, 1429, 1427, 1426, 1425, 1424, 1422, 1420, 1419, 1418, 1417, 1416, 1415, 1414, 1413, 1411, 1409, 1408, 1407, 1406, 1404, 1403, 1402, 1400, 1399, 1398, 1397, 1396, 1394, 1393, 1392, 1391, 1390, 1386, 1385, 1384, 1382, 1381, 1380, 1379, 1378, 1373, 1372, 1371, 1370, 1368, 1367, 1366, 1365, 1364, 1362, 1361, 1360, 1359, 1358, 1356, 1353, 1352, 1351, 1350, 1349, 1348, 1347, 1346, 1345, 1344, 1343, 1341, 1340, 1339, 1338, 1337, 1336, 1335, 1334, 1332, 1331, 1330, 1326, 1325, 1324, 1323, 1320, 1318, 1316, 1315, 1314, 1313, 1312, 1311, 1310, 1309, 1308, 1307, 1306, 1304, 1303, 1302, 1301, 1299, 1298, 1297, 1296, 1295, 1294, 1293, 1291, 1289, 1288, 1287, 1286, 1285, 1284, 1282, 1281, 1280, 1278, 1277, 1276, 1275, 1274, 1273, 1272, 1271, 1269, 1267, 1266, 1265, 1264, 1262, 1261, 1259, 1258, 1257, 1256, 1255, 1252, 1250, 1249, 1248, 1247, 1246, 1245, 1243, 1242, 1240, 1239, 1237, 1236, 1227, 1226, 1225, 1224, 1222, 1220, 1219, 1218, 1216, 1215, 1214, 1212, 1211, 1210, 1209, 1208, 1207, 1206, 1205, 1204, 1203, 1202, 1201, 1200, 1199, 1198, 1197, 1196, 1193, 1191, 1190, 1189, 1188, 1187, 1186, 1185, 1184, 1183, 1182, 1181, 1180, 1178, 1176, 1175, 1172, 1169, 1168, 1167, 1166, 1165, 1163, 1162, 1160, 1159, 1158, 1156, 1155, 1154, 1153, 1152, 1151, 1150, 1148, 1147, 1145, 1144, 1143, 1142, 1141, 1140, 1139, 1138, 1137, 1136, 1135, 1132, 1130, 1129, 1127, 1126, 1125, 1123, 1121, 1120, 1118, 1117, 1115, 1113, 1112, 1111, 1110, 1109, 1108, 1107, 1106, 1105, 1104, 1103, 1102, 1101, 1100, 1098, 1097, 1096, 1095, 1094, 1091, 1090, 1085, 1084, 1082, 1081, 1079, 1077, 1076, 1075, 1074, 1073, 1071, 1070, 1069, 1068, 1067, 1066, 1065, 1063, 1062, 1061, 1060, 1056, 1055, 1054, 1053, 1052, 1051, 1050, 1049, 1047, 1045, 1044, 1043, 1042, 1040, 1039, 1038, 1037, 1036, 1035, 1033, 1032, 1031, 1030, 1029, 1028, 1026, 1025, 1024, 1022, 1021, 1020, 1019, 1017]
Starting structural reductions, iteration 1 : 462/712 places, 1166/1844 transitions.
Applied a total of 0 rules in 30 ms. Remains 462 /462 variables (removed 0) and now considering 1166/1166 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 462/712 places, 1166/1844 transitions.
Normalized transition count is 1134 out of 1166 initially.
// Phase 1: matrix 1134 rows 462 cols
[2022-05-18 00:42:50] [INFO ] Computed 50 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 78 resets, run finished after 5573 ms. (steps per millisecond=179 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1567 ms. (steps per millisecond=638 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1982 ms. (steps per millisecond=504 ) properties (out of 2) seen :2
[2022-05-18 00:42:59] [INFO ] Flow matrix only has 1134 transitions (discarded 32 similar events)
// Phase 1: matrix 1134 rows 462 cols
[2022-05-18 00:42:59] [INFO ] Computed 50 place invariants in 20 ms
[2022-05-18 00:42:59] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-18 00:42:59] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 19 ms returned sat
[2022-05-18 00:42:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:43:00] [INFO ] [Real]Absence check using state equation in 890 ms returned sat
[2022-05-18 00:43:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:43:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-18 00:43:00] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 26 ms returned sat
[2022-05-18 00:43:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:43:45] [INFO ] [Nat]Absence check using state equation in 44874 ms returned unknown
[2022-05-18 00:43:45] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-18 00:43:45] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 18 ms returned sat
[2022-05-18 00:43:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:43:46] [INFO ] [Real]Absence check using state equation in 1161 ms returned sat
[2022-05-18 00:43:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:43:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-18 00:43:47] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 16 ms returned sat
[2022-05-18 00:43:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:44:31] [INFO ] [Nat]Absence check using state equation in 44889 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[1, 1]
Support contains 2 out of 462 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 462/462 places, 1166/1166 transitions.
Applied a total of 0 rules in 34 ms. Remains 462 /462 variables (removed 0) and now considering 1166/1166 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 462/462 places, 1166/1166 transitions.
Starting structural reductions, iteration 0 : 462/462 places, 1166/1166 transitions.
Applied a total of 0 rules in 36 ms. Remains 462 /462 variables (removed 0) and now considering 1166/1166 (removed 0) transitions.
[2022-05-18 00:44:32] [INFO ] Flow matrix only has 1134 transitions (discarded 32 similar events)
// Phase 1: matrix 1134 rows 462 cols
[2022-05-18 00:44:32] [INFO ] Computed 50 place invariants in 19 ms
[2022-05-18 00:44:32] [INFO ] Implicit Places using invariants in 680 ms returned [93, 145, 164, 229, 314, 353, 361, 449]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 684 ms to find 8 implicit places.
[2022-05-18 00:44:32] [INFO ] Redundant transitions in 83 ms returned []
[2022-05-18 00:44:32] [INFO ] Flow matrix only has 1134 transitions (discarded 32 similar events)
// Phase 1: matrix 1134 rows 454 cols
[2022-05-18 00:44:32] [INFO ] Computed 42 place invariants in 21 ms
[2022-05-18 00:44:33] [INFO ] Dead Transitions using invariants and state equation in 947 ms returned []
Starting structural reductions, iteration 1 : 454/462 places, 1166/1166 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 448 transition count 1160
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 448 transition count 1160
Applied a total of 12 rules in 57 ms. Remains 448 /454 variables (removed 6) and now considering 1160/1166 (removed 6) transitions.
[2022-05-18 00:44:33] [INFO ] Flow matrix only has 1128 transitions (discarded 32 similar events)
// Phase 1: matrix 1128 rows 448 cols
[2022-05-18 00:44:33] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 00:44:34] [INFO ] Implicit Places using invariants in 683 ms returned []
[2022-05-18 00:44:34] [INFO ] Flow matrix only has 1128 transitions (discarded 32 similar events)
// Phase 1: matrix 1128 rows 448 cols
[2022-05-18 00:44:34] [INFO ] Computed 42 place invariants in 21 ms
[2022-05-18 00:44:35] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 00:44:46] [INFO ] Implicit Places using invariants and state equation in 12347 ms returned []
Implicit Place search using SMT with State Equation took 13033 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 448/462 places, 1160/1166 transitions.
Normalized transition count is 1128 out of 1160 initially.
// Phase 1: matrix 1128 rows 448 cols
[2022-05-18 00:44:46] [INFO ] Computed 42 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 82 resets, run finished after 5292 ms. (steps per millisecond=188 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1486 ms. (steps per millisecond=672 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1970 ms. (steps per millisecond=507 ) properties (out of 2) seen :2
[2022-05-18 00:44:55] [INFO ] Flow matrix only has 1128 transitions (discarded 32 similar events)
// Phase 1: matrix 1128 rows 448 cols
[2022-05-18 00:44:55] [INFO ] Computed 42 place invariants in 21 ms
[2022-05-18 00:44:55] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2022-05-18 00:44:55] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 16 ms returned sat
[2022-05-18 00:44:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:44:56] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2022-05-18 00:44:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:44:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2022-05-18 00:44:56] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 16 ms returned sat
[2022-05-18 00:44:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:44:59] [INFO ] [Nat]Absence check using state equation in 2348 ms returned sat
[2022-05-18 00:44:59] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 00:44:59] [INFO ] [Nat]Added 168 Read/Feed constraints in 527 ms returned sat
[2022-05-18 00:45:00] [INFO ] Deduced a trap composed of 98 places in 372 ms of which 17 ms to minimize.
[2022-05-18 00:45:00] [INFO ] Deduced a trap composed of 83 places in 331 ms of which 19 ms to minimize.
[2022-05-18 00:45:00] [INFO ] Deduced a trap composed of 72 places in 384 ms of which 1 ms to minimize.
[2022-05-18 00:45:01] [INFO ] Deduced a trap composed of 108 places in 270 ms of which 2 ms to minimize.
[2022-05-18 00:45:01] [INFO ] Deduced a trap composed of 66 places in 323 ms of which 1 ms to minimize.
[2022-05-18 00:45:01] [INFO ] Deduced a trap composed of 137 places in 213 ms of which 1 ms to minimize.
[2022-05-18 00:45:02] [INFO ] Deduced a trap composed of 104 places in 213 ms of which 3 ms to minimize.
[2022-05-18 00:45:02] [INFO ] Deduced a trap composed of 119 places in 359 ms of which 1 ms to minimize.
[2022-05-18 00:45:03] [INFO ] Deduced a trap composed of 71 places in 366 ms of which 2 ms to minimize.
[2022-05-18 00:45:03] [INFO ] Deduced a trap composed of 108 places in 429 ms of which 1 ms to minimize.
[2022-05-18 00:45:03] [INFO ] Deduced a trap composed of 108 places in 198 ms of which 0 ms to minimize.
[2022-05-18 00:45:04] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 0 ms to minimize.
[2022-05-18 00:45:04] [INFO ] Deduced a trap composed of 71 places in 244 ms of which 1 ms to minimize.
[2022-05-18 00:45:04] [INFO ] Deduced a trap composed of 103 places in 227 ms of which 2 ms to minimize.
[2022-05-18 00:45:05] [INFO ] Deduced a trap composed of 117 places in 270 ms of which 1 ms to minimize.
[2022-05-18 00:45:05] [INFO ] Deduced a trap composed of 71 places in 226 ms of which 0 ms to minimize.
[2022-05-18 00:45:05] [INFO ] Deduced a trap composed of 108 places in 225 ms of which 0 ms to minimize.
[2022-05-18 00:45:06] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 0 ms to minimize.
[2022-05-18 00:45:06] [INFO ] Deduced a trap composed of 193 places in 219 ms of which 0 ms to minimize.
[2022-05-18 00:45:06] [INFO ] Deduced a trap composed of 89 places in 249 ms of which 0 ms to minimize.
[2022-05-18 00:45:06] [INFO ] Deduced a trap composed of 119 places in 221 ms of which 0 ms to minimize.
[2022-05-18 00:45:07] [INFO ] Deduced a trap composed of 93 places in 213 ms of which 1 ms to minimize.
[2022-05-18 00:45:07] [INFO ] Deduced a trap composed of 187 places in 213 ms of which 0 ms to minimize.
[2022-05-18 00:45:07] [INFO ] Deduced a trap composed of 134 places in 240 ms of which 0 ms to minimize.
[2022-05-18 00:45:08] [INFO ] Deduced a trap composed of 149 places in 224 ms of which 0 ms to minimize.
[2022-05-18 00:45:08] [INFO ] Deduced a trap composed of 111 places in 209 ms of which 1 ms to minimize.
[2022-05-18 00:45:08] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 0 ms to minimize.
[2022-05-18 00:45:08] [INFO ] Deduced a trap composed of 169 places in 222 ms of which 0 ms to minimize.
[2022-05-18 00:45:09] [INFO ] Deduced a trap composed of 128 places in 215 ms of which 0 ms to minimize.
[2022-05-18 00:45:09] [INFO ] Deduced a trap composed of 138 places in 213 ms of which 1 ms to minimize.
[2022-05-18 00:45:09] [INFO ] Deduced a trap composed of 71 places in 199 ms of which 3 ms to minimize.
[2022-05-18 00:45:09] [INFO ] Deduced a trap composed of 78 places in 215 ms of which 1 ms to minimize.
[2022-05-18 00:45:10] [INFO ] Deduced a trap composed of 79 places in 221 ms of which 0 ms to minimize.
[2022-05-18 00:45:10] [INFO ] Deduced a trap composed of 71 places in 221 ms of which 0 ms to minimize.
[2022-05-18 00:45:10] [INFO ] Deduced a trap composed of 112 places in 241 ms of which 4 ms to minimize.
[2022-05-18 00:45:10] [INFO ] Deduced a trap composed of 127 places in 222 ms of which 0 ms to minimize.
[2022-05-18 00:45:11] [INFO ] Deduced a trap composed of 71 places in 212 ms of which 1 ms to minimize.
[2022-05-18 00:45:11] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 0 ms to minimize.
[2022-05-18 00:45:12] [INFO ] Deduced a trap composed of 85 places in 213 ms of which 0 ms to minimize.
[2022-05-18 00:45:12] [INFO ] Deduced a trap composed of 70 places in 228 ms of which 1 ms to minimize.
[2022-05-18 00:45:12] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 0 ms to minimize.
[2022-05-18 00:45:12] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 18 ms to minimize.
[2022-05-18 00:45:13] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 2 ms to minimize.
[2022-05-18 00:45:13] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2022-05-18 00:45:13] [INFO ] Deduced a trap composed of 82 places in 220 ms of which 0 ms to minimize.
[2022-05-18 00:45:13] [INFO ] Deduced a trap composed of 112 places in 232 ms of which 0 ms to minimize.
[2022-05-18 00:45:14] [INFO ] Deduced a trap composed of 93 places in 198 ms of which 0 ms to minimize.
[2022-05-18 00:45:14] [INFO ] Deduced a trap composed of 148 places in 216 ms of which 0 ms to minimize.
[2022-05-18 00:45:14] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 0 ms to minimize.
[2022-05-18 00:45:14] [INFO ] Deduced a trap composed of 108 places in 216 ms of which 0 ms to minimize.
[2022-05-18 00:45:15] [INFO ] Deduced a trap composed of 115 places in 188 ms of which 1 ms to minimize.
[2022-05-18 00:45:15] [INFO ] Deduced a trap composed of 71 places in 221 ms of which 1 ms to minimize.
[2022-05-18 00:45:15] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 1 ms to minimize.
[2022-05-18 00:45:16] [INFO ] Deduced a trap composed of 67 places in 201 ms of which 0 ms to minimize.
[2022-05-18 00:45:16] [INFO ] Deduced a trap composed of 63 places in 230 ms of which 0 ms to minimize.
[2022-05-18 00:45:16] [INFO ] Deduced a trap composed of 119 places in 253 ms of which 1 ms to minimize.
[2022-05-18 00:45:17] [INFO ] Deduced a trap composed of 85 places in 210 ms of which 7 ms to minimize.
[2022-05-18 00:45:17] [INFO ] Deduced a trap composed of 97 places in 193 ms of which 0 ms to minimize.
[2022-05-18 00:45:18] [INFO ] Deduced a trap composed of 122 places in 249 ms of which 1 ms to minimize.
[2022-05-18 00:45:18] [INFO ] Deduced a trap composed of 108 places in 201 ms of which 0 ms to minimize.
[2022-05-18 00:45:18] [INFO ] Deduced a trap composed of 121 places in 223 ms of which 0 ms to minimize.
[2022-05-18 00:45:19] [INFO ] Deduced a trap composed of 74 places in 229 ms of which 0 ms to minimize.
[2022-05-18 00:45:19] [INFO ] Deduced a trap composed of 78 places in 239 ms of which 1 ms to minimize.
[2022-05-18 00:45:19] [INFO ] Deduced a trap composed of 145 places in 275 ms of which 1 ms to minimize.
[2022-05-18 00:45:19] [INFO ] Deduced a trap composed of 91 places in 215 ms of which 0 ms to minimize.
[2022-05-18 00:45:20] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 3 ms to minimize.
[2022-05-18 00:45:20] [INFO ] Deduced a trap composed of 79 places in 220 ms of which 13 ms to minimize.
[2022-05-18 00:45:20] [INFO ] Deduced a trap composed of 182 places in 209 ms of which 5 ms to minimize.
[2022-05-18 00:45:21] [INFO ] Deduced a trap composed of 71 places in 219 ms of which 1 ms to minimize.
[2022-05-18 00:45:21] [INFO ] Deduced a trap composed of 98 places in 226 ms of which 1 ms to minimize.
[2022-05-18 00:45:21] [INFO ] Deduced a trap composed of 93 places in 210 ms of which 1 ms to minimize.
[2022-05-18 00:45:21] [INFO ] Deduced a trap composed of 97 places in 204 ms of which 1 ms to minimize.
[2022-05-18 00:45:22] [INFO ] Deduced a trap composed of 89 places in 209 ms of which 1 ms to minimize.
[2022-05-18 00:45:22] [INFO ] Deduced a trap composed of 91 places in 209 ms of which 1 ms to minimize.
[2022-05-18 00:45:22] [INFO ] Deduced a trap composed of 147 places in 224 ms of which 1 ms to minimize.
[2022-05-18 00:45:22] [INFO ] Deduced a trap composed of 120 places in 211 ms of which 0 ms to minimize.
[2022-05-18 00:45:23] [INFO ] Deduced a trap composed of 115 places in 212 ms of which 0 ms to minimize.
[2022-05-18 00:45:23] [INFO ] Deduced a trap composed of 103 places in 254 ms of which 0 ms to minimize.
[2022-05-18 00:45:23] [INFO ] Deduced a trap composed of 116 places in 206 ms of which 0 ms to minimize.
[2022-05-18 00:45:23] [INFO ] Deduced a trap composed of 140 places in 214 ms of which 1 ms to minimize.
[2022-05-18 00:45:24] [INFO ] Deduced a trap composed of 159 places in 223 ms of which 0 ms to minimize.
[2022-05-18 00:45:24] [INFO ] Deduced a trap composed of 105 places in 231 ms of which 1 ms to minimize.
[2022-05-18 00:45:24] [INFO ] Deduced a trap composed of 71 places in 226 ms of which 1 ms to minimize.
[2022-05-18 00:45:25] [INFO ] Deduced a trap composed of 114 places in 193 ms of which 0 ms to minimize.
[2022-05-18 00:45:25] [INFO ] Deduced a trap composed of 115 places in 212 ms of which 1 ms to minimize.
[2022-05-18 00:45:25] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 0 ms to minimize.
[2022-05-18 00:45:26] [INFO ] Deduced a trap composed of 85 places in 221 ms of which 1 ms to minimize.
[2022-05-18 00:45:26] [INFO ] Deduced a trap composed of 89 places in 219 ms of which 0 ms to minimize.
[2022-05-18 00:45:26] [INFO ] Deduced a trap composed of 97 places in 237 ms of which 1 ms to minimize.
[2022-05-18 00:45:26] [INFO ] Deduced a trap composed of 112 places in 221 ms of which 0 ms to minimize.
[2022-05-18 00:45:27] [INFO ] Deduced a trap composed of 82 places in 202 ms of which 0 ms to minimize.
[2022-05-18 00:45:27] [INFO ] Deduced a trap composed of 118 places in 208 ms of which 0 ms to minimize.
[2022-05-18 00:45:27] [INFO ] Deduced a trap composed of 158 places in 255 ms of which 1 ms to minimize.
[2022-05-18 00:45:28] [INFO ] Deduced a trap composed of 132 places in 199 ms of which 0 ms to minimize.
[2022-05-18 00:45:28] [INFO ] Deduced a trap composed of 105 places in 204 ms of which 1 ms to minimize.
[2022-05-18 00:45:28] [INFO ] Deduced a trap composed of 108 places in 213 ms of which 1 ms to minimize.
[2022-05-18 00:45:29] [INFO ] Deduced a trap composed of 114 places in 241 ms of which 1 ms to minimize.
[2022-05-18 00:45:29] [INFO ] Deduced a trap composed of 116 places in 236 ms of which 1 ms to minimize.
[2022-05-18 00:45:29] [INFO ] Deduced a trap composed of 123 places in 260 ms of which 0 ms to minimize.
[2022-05-18 00:45:30] [INFO ] Deduced a trap composed of 108 places in 220 ms of which 1 ms to minimize.
[2022-05-18 00:45:30] [INFO ] Deduced a trap composed of 118 places in 218 ms of which 1 ms to minimize.
[2022-05-18 00:45:31] [INFO ] Deduced a trap composed of 124 places in 221 ms of which 1 ms to minimize.
[2022-05-18 00:45:31] [INFO ] Deduced a trap composed of 109 places in 239 ms of which 1 ms to minimize.
[2022-05-18 00:45:31] [INFO ] Deduced a trap composed of 219 places in 200 ms of which 1 ms to minimize.
[2022-05-18 00:45:32] [INFO ] Deduced a trap composed of 112 places in 219 ms of which 1 ms to minimize.
[2022-05-18 00:45:32] [INFO ] Deduced a trap composed of 105 places in 222 ms of which 1 ms to minimize.
[2022-05-18 00:45:32] [INFO ] Deduced a trap composed of 112 places in 232 ms of which 0 ms to minimize.
[2022-05-18 00:45:33] [INFO ] Deduced a trap composed of 139 places in 199 ms of which 0 ms to minimize.
[2022-05-18 00:45:33] [INFO ] Deduced a trap composed of 203 places in 236 ms of which 1 ms to minimize.
[2022-05-18 00:45:33] [INFO ] Deduced a trap composed of 114 places in 223 ms of which 1 ms to minimize.
[2022-05-18 00:45:33] [INFO ] Deduced a trap composed of 94 places in 214 ms of which 0 ms to minimize.
[2022-05-18 00:45:34] [INFO ] Deduced a trap composed of 119 places in 219 ms of which 0 ms to minimize.
[2022-05-18 00:45:34] [INFO ] Deduced a trap composed of 214 places in 187 ms of which 0 ms to minimize.
[2022-05-18 00:45:34] [INFO ] Deduced a trap composed of 121 places in 215 ms of which 0 ms to minimize.
[2022-05-18 00:45:34] [INFO ] Deduced a trap composed of 125 places in 225 ms of which 0 ms to minimize.
[2022-05-18 00:45:35] [INFO ] Deduced a trap composed of 209 places in 225 ms of which 0 ms to minimize.
[2022-05-18 00:45:35] [INFO ] Deduced a trap composed of 125 places in 211 ms of which 1 ms to minimize.
[2022-05-18 00:45:35] [INFO ] Deduced a trap composed of 145 places in 212 ms of which 1 ms to minimize.
[2022-05-18 00:45:36] [INFO ] Deduced a trap composed of 119 places in 217 ms of which 1 ms to minimize.
[2022-05-18 00:45:36] [INFO ] Deduced a trap composed of 118 places in 209 ms of which 0 ms to minimize.
[2022-05-18 00:45:36] [INFO ] Deduced a trap composed of 123 places in 214 ms of which 1 ms to minimize.
[2022-05-18 00:45:36] [INFO ] Deduced a trap composed of 141 places in 205 ms of which 0 ms to minimize.
[2022-05-18 00:45:37] [INFO ] Deduced a trap composed of 146 places in 193 ms of which 1 ms to minimize.
[2022-05-18 00:45:37] [INFO ] Deduced a trap composed of 86 places in 190 ms of which 0 ms to minimize.
[2022-05-18 00:45:37] [INFO ] Deduced a trap composed of 119 places in 192 ms of which 0 ms to minimize.
[2022-05-18 00:45:38] [INFO ] Deduced a trap composed of 113 places in 193 ms of which 0 ms to minimize.
[2022-05-18 00:45:38] [INFO ] Deduced a trap composed of 133 places in 196 ms of which 0 ms to minimize.
[2022-05-18 00:45:38] [INFO ] Deduced a trap composed of 112 places in 230 ms of which 0 ms to minimize.
[2022-05-18 00:45:39] [INFO ] Deduced a trap composed of 93 places in 200 ms of which 1 ms to minimize.
[2022-05-18 00:45:39] [INFO ] Deduced a trap composed of 101 places in 220 ms of which 1 ms to minimize.
[2022-05-18 00:45:39] [INFO ] Deduced a trap composed of 117 places in 194 ms of which 1 ms to minimize.
[2022-05-18 00:45:40] [INFO ] Deduced a trap composed of 67 places in 216 ms of which 1 ms to minimize.
[2022-05-18 00:45:40] [INFO ] Deduced a trap composed of 85 places in 227 ms of which 0 ms to minimize.
[2022-05-18 00:45:40] [INFO ] Deduced a trap composed of 125 places in 210 ms of which 0 ms to minimize.
[2022-05-18 00:45:41] [INFO ] Deduced a trap composed of 98 places in 223 ms of which 1 ms to minimize.
[2022-05-18 00:45:41] [INFO ] Deduced a trap composed of 119 places in 233 ms of which 1 ms to minimize.
[2022-05-18 00:45:41] [INFO ] Deduced a trap composed of 117 places in 223 ms of which 0 ms to minimize.
[2022-05-18 00:45:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-18 00:45:41] [INFO ] [Real]Absence check using 15 positive place invariants in 26 ms returned sat
[2022-05-18 00:45:41] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 27 ms returned sat
[2022-05-18 00:45:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:45:42] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2022-05-18 00:45:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:45:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 32 ms returned sat
[2022-05-18 00:45:42] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 23 ms returned sat
[2022-05-18 00:45:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:45:45] [INFO ] [Nat]Absence check using state equation in 2097 ms returned sat
[2022-05-18 00:45:45] [INFO ] [Nat]Added 168 Read/Feed constraints in 786 ms returned sat
[2022-05-18 00:45:46] [INFO ] Deduced a trap composed of 128 places in 218 ms of which 0 ms to minimize.
[2022-05-18 00:45:46] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 0 ms to minimize.
[2022-05-18 00:45:46] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 0 ms to minimize.
[2022-05-18 00:45:46] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 0 ms to minimize.
[2022-05-18 00:45:47] [INFO ] Deduced a trap composed of 44 places in 23 ms of which 0 ms to minimize.
[2022-05-18 00:45:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1382 ms
[2022-05-18 00:45:47] [INFO ] Computed and/alt/rep : 566/2929/542 causal constraints (skipped 582 transitions) in 87 ms.
[2022-05-18 00:45:53] [INFO ] Deduced a trap composed of 44 places in 179 ms of which 0 ms to minimize.
[2022-05-18 00:45:53] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 0 ms to minimize.
[2022-05-18 00:45:53] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 0 ms to minimize.
[2022-05-18 00:45:54] [INFO ] Deduced a trap composed of 201 places in 188 ms of which 0 ms to minimize.
[2022-05-18 00:45:54] [INFO ] Deduced a trap composed of 180 places in 214 ms of which 0 ms to minimize.
[2022-05-18 00:45:54] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 1 ms to minimize.
[2022-05-18 00:45:55] [INFO ] Deduced a trap composed of 214 places in 194 ms of which 0 ms to minimize.
[2022-05-18 00:45:55] [INFO ] Deduced a trap composed of 186 places in 191 ms of which 0 ms to minimize.
[2022-05-18 00:45:55] [INFO ] Deduced a trap composed of 169 places in 217 ms of which 0 ms to minimize.
[2022-05-18 00:45:55] [INFO ] Deduced a trap composed of 181 places in 225 ms of which 0 ms to minimize.
[2022-05-18 00:45:56] [INFO ] Deduced a trap composed of 167 places in 195 ms of which 0 ms to minimize.
[2022-05-18 00:45:56] [INFO ] Deduced a trap composed of 211 places in 217 ms of which 0 ms to minimize.
[2022-05-18 00:45:56] [INFO ] Deduced a trap composed of 206 places in 201 ms of which 0 ms to minimize.
[2022-05-18 00:45:57] [INFO ] Deduced a trap composed of 203 places in 213 ms of which 0 ms to minimize.
[2022-05-18 00:45:57] [INFO ] Deduced a trap composed of 166 places in 181 ms of which 0 ms to minimize.
[2022-05-18 00:45:58] [INFO ] Deduced a trap composed of 202 places in 198 ms of which 0 ms to minimize.
[2022-05-18 00:45:59] [INFO ] Deduced a trap composed of 208 places in 190 ms of which 1 ms to minimize.
[2022-05-18 00:45:59] [INFO ] Deduced a trap composed of 212 places in 189 ms of which 1 ms to minimize.
[2022-05-18 00:46:00] [INFO ] Deduced a trap composed of 207 places in 210 ms of which 1 ms to minimize.
[2022-05-18 00:46:00] [INFO ] Deduced a trap composed of 191 places in 233 ms of which 1 ms to minimize.
[2022-05-18 00:46:00] [INFO ] Deduced a trap composed of 157 places in 237 ms of which 1 ms to minimize.
[2022-05-18 00:46:01] [INFO ] Deduced a trap composed of 215 places in 206 ms of which 1 ms to minimize.
[2022-05-18 00:46:01] [INFO ] Deduced a trap composed of 209 places in 198 ms of which 0 ms to minimize.
[2022-05-18 00:46:02] [INFO ] Deduced a trap composed of 210 places in 183 ms of which 0 ms to minimize.
[2022-05-18 00:46:02] [INFO ] Deduced a trap composed of 182 places in 211 ms of which 1 ms to minimize.
[2022-05-18 00:46:02] [INFO ] Deduced a trap composed of 217 places in 211 ms of which 1 ms to minimize.
[2022-05-18 00:46:03] [INFO ] Deduced a trap composed of 195 places in 194 ms of which 0 ms to minimize.
[2022-05-18 00:46:03] [INFO ] Deduced a trap composed of 194 places in 214 ms of which 0 ms to minimize.
[2022-05-18 00:46:04] [INFO ] Deduced a trap composed of 203 places in 211 ms of which 0 ms to minimize.
[2022-05-18 00:46:04] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 11498 ms
[2022-05-18 00:46:10] [INFO ] Added : 246 causal constraints over 50 iterations in 23172 ms.(timeout) Result :unknown
Current structural bounds on expressions (after SMT) : [-1, -1] Max seen :[1, 1]
Incomplete Parikh walk after 317500 steps, including 1002 resets, run finished after 1666 ms. (steps per millisecond=190 ) properties (out of 2) seen :2 could not realise parikh vector
Support contains 2 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 1160/1160 transitions.
Applied a total of 0 rules in 22 ms. Remains 448 /448 variables (removed 0) and now considering 1160/1160 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 448/448 places, 1160/1160 transitions.
Starting structural reductions, iteration 0 : 448/448 places, 1160/1160 transitions.
Applied a total of 0 rules in 21 ms. Remains 448 /448 variables (removed 0) and now considering 1160/1160 (removed 0) transitions.
[2022-05-18 00:46:12] [INFO ] Flow matrix only has 1128 transitions (discarded 32 similar events)
// Phase 1: matrix 1128 rows 448 cols
[2022-05-18 00:46:12] [INFO ] Computed 42 place invariants in 41 ms
[2022-05-18 00:46:13] [INFO ] Implicit Places using invariants in 1229 ms returned []
[2022-05-18 00:46:13] [INFO ] Flow matrix only has 1128 transitions (discarded 32 similar events)
// Phase 1: matrix 1128 rows 448 cols
[2022-05-18 00:46:13] [INFO ] Computed 42 place invariants in 17 ms
[2022-05-18 00:46:13] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 00:46:28] [INFO ] Implicit Places using invariants and state equation in 15059 ms returned []
Implicit Place search using SMT with State Equation took 16290 ms to find 0 implicit places.
[2022-05-18 00:46:28] [INFO ] Redundant transitions in 71 ms returned []
[2022-05-18 00:46:28] [INFO ] Flow matrix only has 1128 transitions (discarded 32 similar events)
// Phase 1: matrix 1128 rows 448 cols
[2022-05-18 00:46:28] [INFO ] Computed 42 place invariants in 15 ms
[2022-05-18 00:46:29] [INFO ] Dead Transitions using invariants and state equation in 798 ms returned []
Finished structural reductions, in 1 iterations. Remains : 448/448 places, 1160/1160 transitions.
Starting property specific reduction for PolyORBLF-PT-S04J04T08-UpperBounds-09
Normalized transition count is 1128 out of 1160 initially.
// Phase 1: matrix 1128 rows 448 cols
[2022-05-18 00:46:29] [INFO ] Computed 42 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :1
[2022-05-18 00:46:29] [INFO ] Flow matrix only has 1128 transitions (discarded 32 similar events)
// Phase 1: matrix 1128 rows 448 cols
[2022-05-18 00:46:29] [INFO ] Computed 42 place invariants in 27 ms
[2022-05-18 00:46:29] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-05-18 00:46:29] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 16 ms returned sat
[2022-05-18 00:46:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:46:30] [INFO ] [Real]Absence check using state equation in 887 ms returned sat
[2022-05-18 00:46:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:46:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-05-18 00:46:30] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 17 ms returned sat
[2022-05-18 00:46:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:46:32] [INFO ] [Nat]Absence check using state equation in 2455 ms returned sat
[2022-05-18 00:46:32] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 00:46:33] [INFO ] [Nat]Added 168 Read/Feed constraints in 524 ms returned sat
[2022-05-18 00:46:33] [INFO ] Deduced a trap composed of 98 places in 203 ms of which 0 ms to minimize.
[2022-05-18 00:46:33] [INFO ] Deduced a trap composed of 83 places in 233 ms of which 0 ms to minimize.
[2022-05-18 00:46:34] [INFO ] Deduced a trap composed of 72 places in 245 ms of which 0 ms to minimize.
[2022-05-18 00:46:34] [INFO ] Deduced a trap composed of 108 places in 222 ms of which 0 ms to minimize.
[2022-05-18 00:46:34] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 0 ms to minimize.
[2022-05-18 00:46:35] [INFO ] Deduced a trap composed of 137 places in 227 ms of which 1 ms to minimize.
[2022-05-18 00:46:35] [INFO ] Deduced a trap composed of 104 places in 206 ms of which 0 ms to minimize.
[2022-05-18 00:46:35] [INFO ] Deduced a trap composed of 185 places in 266 ms of which 0 ms to minimize.
[2022-05-18 00:46:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 1160/1160 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 447 transition count 1159
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 447 transition count 1159
Applied a total of 2 rules in 29 ms. Remains 447 /448 variables (removed 1) and now considering 1159/1160 (removed 1) transitions.
[2022-05-18 00:46:35] [INFO ] Flow matrix only has 1127 transitions (discarded 32 similar events)
// Phase 1: matrix 1127 rows 447 cols
[2022-05-18 00:46:35] [INFO ] Computed 42 place invariants in 27 ms
[2022-05-18 00:46:36] [INFO ] Dead Transitions using invariants and state equation in 786 ms returned []
Finished structural reductions, in 1 iterations. Remains : 447/448 places, 1159/1160 transitions.
Normalized transition count is 1127 out of 1159 initially.
// Phase 1: matrix 1127 rows 447 cols
[2022-05-18 00:46:36] [INFO ] Computed 42 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 83 resets, run finished after 5090 ms. (steps per millisecond=196 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1415 ms. (steps per millisecond=706 ) properties (out of 1) seen :1
[2022-05-18 00:46:43] [INFO ] Flow matrix only has 1127 transitions (discarded 32 similar events)
// Phase 1: matrix 1127 rows 447 cols
[2022-05-18 00:46:43] [INFO ] Computed 42 place invariants in 31 ms
[2022-05-18 00:46:43] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-18 00:46:43] [INFO ] [Real]Absence check using 13 positive and 29 generalized place invariants in 19 ms returned sat
[2022-05-18 00:46:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:46:45] [INFO ] [Real]Absence check using state equation in 2001 ms returned sat
[2022-05-18 00:46:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:46:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-18 00:46:45] [INFO ] [Nat]Absence check using 13 positive and 29 generalized place invariants in 20 ms returned sat
[2022-05-18 00:46:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:46:49] [INFO ] [Nat]Absence check using state equation in 4109 ms returned sat
[2022-05-18 00:46:49] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 00:46:49] [INFO ] [Nat]Added 168 Read/Feed constraints in 306 ms returned sat
[2022-05-18 00:46:49] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 0 ms to minimize.
[2022-05-18 00:46:49] [INFO ] Deduced a trap composed of 44 places in 27 ms of which 0 ms to minimize.
[2022-05-18 00:46:50] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
[2022-05-18 00:46:50] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 0 ms to minimize.
[2022-05-18 00:46:50] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2022-05-18 00:46:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1054 ms
[2022-05-18 00:46:50] [INFO ] Computed and/alt/rep : 565/2929/541 causal constraints (skipped 582 transitions) in 66 ms.
[2022-05-18 00:46:57] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2022-05-18 00:46:57] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2022-05-18 00:46:57] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 0 ms to minimize.
[2022-05-18 00:47:30] [INFO ] Deduced a trap composed of 183 places in 266 ms of which 0 ms to minimize.
[2022-05-18 00:47:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 1159/1159 transitions.
Applied a total of 0 rules in 36 ms. Remains 447 /447 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 447/447 places, 1159/1159 transitions.
Starting structural reductions, iteration 0 : 447/447 places, 1159/1159 transitions.
Applied a total of 0 rules in 22 ms. Remains 447 /447 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
[2022-05-18 00:47:30] [INFO ] Flow matrix only has 1127 transitions (discarded 32 similar events)
// Phase 1: matrix 1127 rows 447 cols
[2022-05-18 00:47:30] [INFO ] Computed 42 place invariants in 34 ms
[2022-05-18 00:47:31] [INFO ] Implicit Places using invariants in 602 ms returned []
[2022-05-18 00:47:31] [INFO ] Flow matrix only has 1127 transitions (discarded 32 similar events)
// Phase 1: matrix 1127 rows 447 cols
[2022-05-18 00:47:31] [INFO ] Computed 42 place invariants in 19 ms
[2022-05-18 00:47:31] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 00:47:42] [INFO ] Implicit Places using invariants and state equation in 11674 ms returned []
Implicit Place search using SMT with State Equation took 12291 ms to find 0 implicit places.
[2022-05-18 00:47:42] [INFO ] Redundant transitions in 27 ms returned []
[2022-05-18 00:47:42] [INFO ] Flow matrix only has 1127 transitions (discarded 32 similar events)
// Phase 1: matrix 1127 rows 447 cols
[2022-05-18 00:47:42] [INFO ] Computed 42 place invariants in 20 ms
[2022-05-18 00:47:43] [INFO ] Dead Transitions using invariants and state equation in 850 ms returned []
Finished structural reductions, in 1 iterations. Remains : 447/447 places, 1159/1159 transitions.
Ending property specific reduction for PolyORBLF-PT-S04J04T08-UpperBounds-09 in 74459 ms.
Starting property specific reduction for PolyORBLF-PT-S04J04T08-UpperBounds-10
Normalized transition count is 1128 out of 1160 initially.
// Phase 1: matrix 1128 rows 448 cols
[2022-05-18 00:47:43] [INFO ] Computed 42 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :1
[2022-05-18 00:47:43] [INFO ] Flow matrix only has 1128 transitions (discarded 32 similar events)
// Phase 1: matrix 1128 rows 448 cols
[2022-05-18 00:47:43] [INFO ] Computed 42 place invariants in 16 ms
[2022-05-18 00:47:43] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-05-18 00:47:43] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 18 ms returned sat
[2022-05-18 00:47:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:47:44] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2022-05-18 00:47:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:47:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-05-18 00:47:44] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 30 ms returned sat
[2022-05-18 00:47:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:47:47] [INFO ] [Nat]Absence check using state equation in 2162 ms returned sat
[2022-05-18 00:47:47] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 00:47:47] [INFO ] [Nat]Added 168 Read/Feed constraints in 796 ms returned sat
[2022-05-18 00:47:48] [INFO ] Deduced a trap composed of 128 places in 228 ms of which 0 ms to minimize.
[2022-05-18 00:47:48] [INFO ] Deduced a trap composed of 45 places in 227 ms of which 0 ms to minimize.
[2022-05-18 00:47:48] [INFO ] Deduced a trap composed of 44 places in 221 ms of which 1 ms to minimize.
[2022-05-18 00:47:48] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 1 ms to minimize.
[2022-05-18 00:47:49] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 0 ms to minimize.
[2022-05-18 00:47:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1434 ms
[2022-05-18 00:47:49] [INFO ] Computed and/alt/rep : 566/2929/542 causal constraints (skipped 582 transitions) in 59 ms.
[2022-05-18 00:47:49] [INFO ] Added : 20 causal constraints over 4 iterations in 483 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 196300 steps, including 1002 resets, run finished after 1011 ms. (steps per millisecond=194 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 448 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 448/448 places, 1160/1160 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 447 transition count 1159
Applied a total of 2 rules in 26 ms. Remains 447 /448 variables (removed 1) and now considering 1159/1160 (removed 1) transitions.
[2022-05-18 00:47:50] [INFO ] Flow matrix only has 1127 transitions (discarded 32 similar events)
// Phase 1: matrix 1127 rows 447 cols
[2022-05-18 00:47:50] [INFO ] Computed 42 place invariants in 18 ms
[2022-05-18 00:47:51] [INFO ] Dead Transitions using invariants and state equation in 858 ms returned []
Finished structural reductions, in 1 iterations. Remains : 447/448 places, 1159/1160 transitions.
Normalized transition count is 1127 out of 1159 initially.
// Phase 1: matrix 1127 rows 447 cols
[2022-05-18 00:47:51] [INFO ] Computed 42 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 121 resets, run finished after 4936 ms. (steps per millisecond=202 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1831 ms. (steps per millisecond=546 ) properties (out of 1) seen :1
[2022-05-18 00:47:58] [INFO ] Flow matrix only has 1127 transitions (discarded 32 similar events)
// Phase 1: matrix 1127 rows 447 cols
[2022-05-18 00:47:58] [INFO ] Computed 42 place invariants in 24 ms
[2022-05-18 00:47:58] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2022-05-18 00:47:58] [INFO ] [Real]Absence check using 14 positive and 28 generalized place invariants in 16 ms returned sat
[2022-05-18 00:47:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:47:59] [INFO ] [Real]Absence check using state equation in 736 ms returned sat
[2022-05-18 00:47:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:47:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2022-05-18 00:47:59] [INFO ] [Nat]Absence check using 14 positive and 28 generalized place invariants in 18 ms returned sat
[2022-05-18 00:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:48:01] [INFO ] [Nat]Absence check using state equation in 1682 ms returned sat
[2022-05-18 00:48:01] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 00:48:01] [INFO ] [Nat]Added 168 Read/Feed constraints in 793 ms returned sat
[2022-05-18 00:48:02] [INFO ] Deduced a trap composed of 113 places in 177 ms of which 0 ms to minimize.
[2022-05-18 00:48:02] [INFO ] Deduced a trap composed of 113 places in 187 ms of which 0 ms to minimize.
[2022-05-18 00:48:02] [INFO ] Deduced a trap composed of 79 places in 193 ms of which 0 ms to minimize.
[2022-05-18 00:48:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 831 ms
[2022-05-18 00:48:02] [INFO ] Computed and/alt/rep : 565/2928/541 causal constraints (skipped 582 transitions) in 54 ms.
[2022-05-18 00:48:11] [INFO ] Deduced a trap composed of 86 places in 229 ms of which 0 ms to minimize.
[2022-05-18 00:48:11] [INFO ] Deduced a trap composed of 44 places in 195 ms of which 1 ms to minimize.
[2022-05-18 00:48:11] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 1 ms to minimize.
[2022-05-18 00:48:12] [INFO ] Deduced a trap composed of 44 places in 26 ms of which 0 ms to minimize.
[2022-05-18 00:48:12] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 0 ms to minimize.
[2022-05-18 00:48:13] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 1 ms to minimize.
[2022-05-18 00:48:13] [INFO ] Deduced a trap composed of 183 places in 208 ms of which 0 ms to minimize.
[2022-05-18 00:48:13] [INFO ] Deduced a trap composed of 195 places in 224 ms of which 0 ms to minimize.
[2022-05-18 00:48:13] [INFO ] Deduced a trap composed of 207 places in 201 ms of which 0 ms to minimize.
[2022-05-18 00:48:14] [INFO ] Deduced a trap composed of 171 places in 187 ms of which 0 ms to minimize.
[2022-05-18 00:48:14] [INFO ] Deduced a trap composed of 199 places in 191 ms of which 0 ms to minimize.
[2022-05-18 00:48:14] [INFO ] Deduced a trap composed of 203 places in 192 ms of which 0 ms to minimize.
[2022-05-18 00:48:15] [INFO ] Deduced a trap composed of 196 places in 188 ms of which 1 ms to minimize.
[2022-05-18 00:48:15] [INFO ] Deduced a trap composed of 204 places in 186 ms of which 1 ms to minimize.
[2022-05-18 00:48:15] [INFO ] Deduced a trap composed of 19 places in 212 ms of which 0 ms to minimize.
[2022-05-18 00:48:16] [INFO ] Deduced a trap composed of 202 places in 194 ms of which 0 ms to minimize.
[2022-05-18 00:48:16] [INFO ] Deduced a trap composed of 170 places in 187 ms of which 1 ms to minimize.
[2022-05-18 00:48:16] [INFO ] Deduced a trap composed of 175 places in 216 ms of which 0 ms to minimize.
[2022-05-18 00:48:17] [INFO ] Deduced a trap composed of 205 places in 189 ms of which 0 ms to minimize.
[2022-05-18 00:48:17] [INFO ] Deduced a trap composed of 205 places in 195 ms of which 1 ms to minimize.
[2022-05-18 00:48:17] [INFO ] Deduced a trap composed of 211 places in 217 ms of which 1 ms to minimize.
[2022-05-18 00:48:18] [INFO ] Deduced a trap composed of 208 places in 205 ms of which 0 ms to minimize.
[2022-05-18 00:48:18] [INFO ] Deduced a trap composed of 206 places in 190 ms of which 0 ms to minimize.
[2022-05-18 00:48:18] [INFO ] Deduced a trap composed of 226 places in 212 ms of which 0 ms to minimize.
[2022-05-18 00:48:19] [INFO ] Deduced a trap composed of 212 places in 194 ms of which 0 ms to minimize.
[2022-05-18 00:48:19] [INFO ] Deduced a trap composed of 222 places in 195 ms of which 0 ms to minimize.
[2022-05-18 00:48:19] [INFO ] Deduced a trap composed of 198 places in 185 ms of which 1 ms to minimize.
[2022-05-18 00:48:20] [INFO ] Deduced a trap composed of 243 places in 187 ms of which 0 ms to minimize.
[2022-05-18 00:48:20] [INFO ] Deduced a trap composed of 193 places in 183 ms of which 1 ms to minimize.
[2022-05-18 00:48:20] [INFO ] Deduced a trap composed of 187 places in 185 ms of which 0 ms to minimize.
[2022-05-18 00:48:21] [INFO ] Deduced a trap composed of 204 places in 194 ms of which 0 ms to minimize.
[2022-05-18 00:48:21] [INFO ] Deduced a trap composed of 213 places in 196 ms of which 1 ms to minimize.
[2022-05-18 00:48:21] [INFO ] Deduced a trap composed of 232 places in 208 ms of which 0 ms to minimize.
[2022-05-18 00:48:21] [INFO ] Deduced a trap composed of 234 places in 194 ms of which 0 ms to minimize.
[2022-05-18 00:48:22] [INFO ] Deduced a trap composed of 210 places in 187 ms of which 0 ms to minimize.
[2022-05-18 00:48:22] [INFO ] Deduced a trap composed of 204 places in 176 ms of which 1 ms to minimize.
[2022-05-18 00:48:23] [INFO ] Deduced a trap composed of 211 places in 186 ms of which 1 ms to minimize.
[2022-05-18 00:48:23] [INFO ] Deduced a trap composed of 193 places in 182 ms of which 1 ms to minimize.
[2022-05-18 00:48:23] [INFO ] Deduced a trap composed of 193 places in 204 ms of which 0 ms to minimize.
[2022-05-18 00:48:24] [INFO ] Deduced a trap composed of 225 places in 190 ms of which 0 ms to minimize.
[2022-05-18 00:48:24] [INFO ] Deduced a trap composed of 184 places in 183 ms of which 0 ms to minimize.
[2022-05-18 00:48:24] [INFO ] Deduced a trap composed of 188 places in 206 ms of which 0 ms to minimize.
[2022-05-18 00:48:25] [INFO ] Deduced a trap composed of 167 places in 186 ms of which 0 ms to minimize.
[2022-05-18 00:48:25] [INFO ] Deduced a trap composed of 216 places in 180 ms of which 0 ms to minimize.
[2022-05-18 00:48:25] [INFO ] Deduced a trap composed of 208 places in 199 ms of which 1 ms to minimize.
[2022-05-18 00:48:25] [INFO ] Deduced a trap composed of 169 places in 192 ms of which 1 ms to minimize.
[2022-05-18 00:48:26] [INFO ] Deduced a trap composed of 181 places in 182 ms of which 0 ms to minimize.
[2022-05-18 00:48:26] [INFO ] Deduced a trap composed of 186 places in 192 ms of which 0 ms to minimize.
[2022-05-18 00:48:27] [INFO ] Deduced a trap composed of 184 places in 184 ms of which 0 ms to minimize.
[2022-05-18 00:48:27] [INFO ] Deduced a trap composed of 171 places in 185 ms of which 0 ms to minimize.
[2022-05-18 00:48:27] [INFO ] Deduced a trap composed of 167 places in 188 ms of which 2 ms to minimize.
[2022-05-18 00:48:28] [INFO ] Deduced a trap composed of 198 places in 193 ms of which 2 ms to minimize.
[2022-05-18 00:48:28] [INFO ] Deduced a trap composed of 194 places in 180 ms of which 0 ms to minimize.
[2022-05-18 00:48:28] [INFO ] Deduced a trap composed of 171 places in 205 ms of which 1 ms to minimize.
[2022-05-18 00:48:29] [INFO ] Deduced a trap composed of 181 places in 205 ms of which 1 ms to minimize.
[2022-05-18 00:48:30] [INFO ] Deduced a trap composed of 189 places in 200 ms of which 1 ms to minimize.
[2022-05-18 00:48:44] [INFO ] Deduced a trap composed of 185 places in 255 ms of which 2 ms to minimize.
[2022-05-18 00:48:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 1 out of 447 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 447/447 places, 1159/1159 transitions.
Applied a total of 0 rules in 20 ms. Remains 447 /447 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 447/447 places, 1159/1159 transitions.
Starting structural reductions, iteration 0 : 447/447 places, 1159/1159 transitions.
Applied a total of 0 rules in 19 ms. Remains 447 /447 variables (removed 0) and now considering 1159/1159 (removed 0) transitions.
[2022-05-18 00:48:44] [INFO ] Flow matrix only has 1127 transitions (discarded 32 similar events)
// Phase 1: matrix 1127 rows 447 cols
[2022-05-18 00:48:44] [INFO ] Computed 42 place invariants in 26 ms
[2022-05-18 00:48:45] [INFO ] Implicit Places using invariants in 536 ms returned []
[2022-05-18 00:48:45] [INFO ] Flow matrix only has 1127 transitions (discarded 32 similar events)
// Phase 1: matrix 1127 rows 447 cols
[2022-05-18 00:48:45] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-18 00:48:45] [INFO ] State equation strengthened by 168 read => feed constraints.
[2022-05-18 00:48:58] [INFO ] Implicit Places using invariants and state equation in 13630 ms returned []
Implicit Place search using SMT with State Equation took 14167 ms to find 0 implicit places.
[2022-05-18 00:48:58] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-18 00:48:58] [INFO ] Flow matrix only has 1127 transitions (discarded 32 similar events)
// Phase 1: matrix 1127 rows 447 cols
[2022-05-18 00:48:58] [INFO ] Computed 42 place invariants in 44 ms
[2022-05-18 00:48:59] [INFO ] Dead Transitions using invariants and state equation in 795 ms returned []
Finished structural reductions, in 1 iterations. Remains : 447/447 places, 1159/1159 transitions.
Ending property specific reduction for PolyORBLF-PT-S04J04T08-UpperBounds-10 in 75970 ms.
[2022-05-18 00:48:59] [INFO ] Flatten gal took : 161 ms
[2022-05-18 00:49:00] [INFO ] Applying decomposition
[2022-05-18 00:49:00] [INFO ] Flatten gal took : 92 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12185359157078149927.txt, -o, /tmp/graph12185359157078149927.bin, -w, /tmp/graph12185359157078149927.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12185359157078149927.bin, -l, -1, -v, -w, /tmp/graph12185359157078149927.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 00:49:00] [INFO ] Decomposing Gal with order
[2022-05-18 00:49:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:49:00] [INFO ] Removed a total of 956 redundant transitions.
[2022-05-18 00:49:00] [INFO ] Flatten gal took : 428 ms
[2022-05-18 00:49:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 311 labels/synchronizations in 33 ms.
[2022-05-18 00:49:00] [INFO ] Time to serialize gal into /tmp/UpperBounds8632948564334515018.gal : 18 ms
[2022-05-18 00:49:01] [INFO ] Time to serialize properties into /tmp/UpperBounds9113506545716641305.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds8632948564334515018.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9113506545716641305.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds8632948564334515018.gal -t CGAL -reachable-file /tmp/UpperBounds9113506545716641305.prop --nowitness
Loading property file /tmp/UpperBounds9113506545716641305.prop.
Detected timeout of ITS tools.
[2022-05-18 01:11:24] [INFO ] Flatten gal took : 402 ms
[2022-05-18 01:11:24] [INFO ] Time to serialize gal into /tmp/UpperBounds8352166488665574932.gal : 55 ms
[2022-05-18 01:11:24] [INFO ] Time to serialize properties into /tmp/UpperBounds13853921728812948322.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds8352166488665574932.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13853921728812948322.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds8352166488665574932.gal -t CGAL -reachable-file /tmp/UpperBounds13853921728812948322.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds13853921728812948322.prop.
Detected timeout of ITS tools.
[2022-05-18 01:33:35] [INFO ] Flatten gal took : 450 ms
[2022-05-18 01:33:38] [INFO ] Input system was already deterministic with 1160 transitions.
[2022-05-18 01:33:38] [INFO ] Transformed 448 places.
[2022-05-18 01:33:38] [INFO ] Transformed 1160 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-18 01:34:08] [INFO ] Time to serialize gal into /tmp/UpperBounds11094722212588850683.gal : 18 ms
[2022-05-18 01:34:08] [INFO ] Time to serialize properties into /tmp/UpperBounds274328890917968826.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds11094722212588850683.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds274328890917968826.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds11094722212588850683.gal -t CGAL -reachable-file /tmp/UpperBounds274328890917968826.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds274328890917968826.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="PolyORBLF-PT-S04J04T08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is PolyORBLF-PT-S04J04T08, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-165277027000241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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