About the Execution of ITS-LoLa for PolyORBLF-PT-S04J06T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15741.320 | 3600000.00 | 314490.00 | 139.10 | TTFTFFTTFFF?FTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871900486.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PolyORBLF-PT-S04J06T06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871900486
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.4M
-rw-r--r-- 1 mcc users 9.2K Apr 12 05:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 12 05:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 05:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 05:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 10 12:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 10 12:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 67K Apr 9 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 214K Apr 9 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K Apr 10 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 3.8M Mar 24 05:37 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-00
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-01
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-02
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-03
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-04
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-05
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-06
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-07
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-08
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-09
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-10
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-11
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-12
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-13
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-14
FORMULA_NAME PolyORBLF-PT-S04J06T06-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1591157491530
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 04:11:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 04:11:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 04:11:34] [INFO ] Load time of PNML (sax parser for PT used): 458 ms
[2020-06-03 04:11:34] [INFO ] Transformed 618 places.
[2020-06-03 04:11:34] [INFO ] Transformed 3190 transitions.
[2020-06-03 04:11:34] [INFO ] Parsed PT model containing 618 places and 3190 transitions in 582 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 139 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties seen :[1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0]
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 60 ms. (steps per millisecond=166 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 04:11:35] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 618 cols
[2020-06-03 04:11:35] [INFO ] Computed 54 place invariants in 224 ms
[2020-06-03 04:11:35] [INFO ] [Real]Absence check using 18 positive place invariants in 30 ms returned sat
[2020-06-03 04:11:35] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 71 ms returned unsat
[2020-06-03 04:11:36] [INFO ] [Real]Absence check using 18 positive place invariants in 20 ms returned sat
[2020-06-03 04:11:36] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 11 ms returned unsat
[2020-06-03 04:11:36] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2020-06-03 04:11:36] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 49 ms returned sat
[2020-06-03 04:11:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:11:38] [INFO ] [Real]Absence check using state equation in 2633 ms returned sat
[2020-06-03 04:11:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:11:39] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2020-06-03 04:11:39] [INFO ] [Nat]Absence check using 18 positive and 36 generalized place invariants in 60 ms returned unsat
[2020-06-03 04:11:39] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2020-06-03 04:11:39] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 37 ms returned sat
[2020-06-03 04:11:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:11:41] [INFO ] [Real]Absence check using state equation in 2302 ms returned sat
[2020-06-03 04:11:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:11:41] [INFO ] [Nat]Absence check using 18 positive place invariants in 20 ms returned sat
[2020-06-03 04:11:41] [INFO ] [Nat]Absence check using 18 positive and 36 generalized place invariants in 36 ms returned unsat
[2020-06-03 04:11:41] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2020-06-03 04:11:41] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 18 ms returned unsat
[2020-06-03 04:11:41] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned unsat
[2020-06-03 04:11:41] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2020-06-03 04:11:41] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 12 ms returned unsat
[2020-06-03 04:11:42] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2020-06-03 04:11:42] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 36 ms returned sat
[2020-06-03 04:11:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:11:46] [INFO ] [Real]Absence check using state equation in 4824 ms returned sat
[2020-06-03 04:11:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:11:47] [INFO ] [Nat]Absence check using 18 positive place invariants in 26 ms returned sat
[2020-06-03 04:11:47] [INFO ] [Nat]Absence check using 18 positive and 36 generalized place invariants in 59 ms returned sat
[2020-06-03 04:11:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:11:51] [INFO ] [Nat]Absence check using state equation in 4863 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 04:11:52] [INFO ] [Real]Absence check using 18 positive place invariants in 19 ms returned unsat
[2020-06-03 04:11:52] [INFO ] [Real]Absence check using 18 positive place invariants in 19 ms returned sat
[2020-06-03 04:11:52] [INFO ] [Real]Absence check using 18 positive and 36 generalized place invariants in 42 ms returned unsat
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S04J06T06-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 614 transition count 1510
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 112 place count 560 transition count 1510
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 112 place count 560 transition count 1439
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 254 place count 489 transition count 1439
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 374 place count 429 transition count 1379
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 386 place count 429 transition count 1367
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 398 place count 417 transition count 1367
Applied a total of 398 rules in 261 ms. Remains 417 /618 variables (removed 201) and now considering 1367/1564 (removed 197) transitions.
[2020-06-03 04:11:52] [INFO ] Flow matrix only has 1343 transitions (discarded 24 similar events)
// Phase 1: matrix 1343 rows 417 cols
[2020-06-03 04:11:52] [INFO ] Computed 50 place invariants in 29 ms
[2020-06-03 04:11:55] [INFO ] Dead Transitions using invariants and state equation in 2665 ms returned [929, 931, 934, 935, 936, 937, 939, 940, 941, 942, 945, 946, 947, 948, 951, 952, 954, 956, 957, 958, 959, 961, 962, 963, 965, 966, 968, 969, 970, 971, 972, 973, 974, 975, 976, 978, 979, 981, 982, 983, 984, 985, 986, 987, 988, 989, 990, 991, 992, 993, 994, 995, 996, 997, 998, 999, 1001, 1002, 1004, 1007, 1009, 1011, 1012, 1013, 1015, 1016, 1017, 1018, 1020, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1030, 1031, 1032, 1034, 1036, 1038, 1039, 1040, 1041, 1042, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1054, 1055, 1056, 1057, 1058, 1060, 1061, 1062, 1063, 1065, 1066, 1071, 1074, 1076, 1078, 1079, 1080, 1081, 1082, 1083, 1085, 1087, 1088, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1099, 1100, 1101, 1103, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1113, 1114, 1115, 1116, 1118, 1119, 1121, 1122, 1123, 1126, 1127, 1128, 1129, 1130, 1131, 1132, 1133, 1134, 1136, 1138, 1139, 1144, 1145, 1146, 1147, 1148, 1149, 1150, 1152, 1153, 1154, 1157, 1158, 1159, 1160, 1162, 1163, 1164, 1165, 1166, 1168, 1169, 1171, 1172, 1173, 1175, 1177, 1178, 1180, 1181, 1183, 1185, 1186, 1187, 1188, 1190, 1191, 1192, 1193, 1194, 1196, 1197, 1198, 1199, 1200, 1201, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1212, 1221, 1223, 1224, 1226, 1227, 1228, 1230, 1231, 1234, 1235, 1236, 1238, 1240, 1241, 1242, 1243, 1244, 1247, 1248, 1249, 1250, 1251, 1252, 1253, 1255, 1256, 1257, 1259, 1260, 1261, 1262, 1264, 1265, 1266, 1267, 1268, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1292, 1293, 1294, 1296, 1297, 1298, 1299, 1300, 1301, 1302, 1303, 1304, 1306, 1307, 1308, 1311, 1312, 1313, 1314, 1315, 1316, 1317, 1318, 1320, 1321, 1322, 1325, 1326, 1327, 1328, 1329, 1330, 1333, 1334, 1335, 1337, 1338, 1339, 1340, 1341, 1343, 1344, 1345, 1346, 1347, 1348, 1351, 1352, 1354, 1355, 1356, 1357, 1358]
Found 324 dead transitions using SMT.
Drop transitions removed 324 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 324 transitions :[1358, 1357, 1356, 1355, 1354, 1352, 1351, 1348, 1347, 1346, 1345, 1344, 1343, 1341, 1340, 1339, 1338, 1337, 1335, 1334, 1333, 1330, 1329, 1328, 1327, 1326, 1325, 1322, 1321, 1320, 1318, 1317, 1316, 1315, 1314, 1313, 1312, 1311, 1308, 1307, 1306, 1304, 1303, 1302, 1301, 1300, 1299, 1298, 1297, 1296, 1294, 1293, 1292, 1290, 1289, 1288, 1287, 1286, 1285, 1284, 1281, 1280, 1279, 1278, 1277, 1276, 1275, 1274, 1273, 1272, 1271, 1270, 1268, 1267, 1266, 1265, 1264, 1262, 1261, 1260, 1259, 1257, 1256, 1255, 1253, 1252, 1251, 1250, 1249, 1248, 1247, 1244, 1243, 1242, 1241, 1240, 1238, 1236, 1235, 1234, 1231, 1230, 1228, 1227, 1226, 1224, 1223, 1221, 1212, 1210, 1209, 1208, 1207, 1206, 1205, 1204, 1203, 1201, 1200, 1199, 1198, 1197, 1196, 1194, 1193, 1192, 1191, 1190, 1188, 1187, 1186, 1185, 1183, 1181, 1180, 1178, 1177, 1175, 1173, 1172, 1171, 1169, 1168, 1166, 1165, 1164, 1163, 1162, 1160, 1159, 1158, 1157, 1154, 1153, 1152, 1150, 1149, 1148, 1147, 1146, 1145, 1144, 1139, 1138, 1136, 1134, 1133, 1132, 1131, 1130, 1129, 1128, 1127, 1126, 1123, 1122, 1121, 1119, 1118, 1116, 1115, 1114, 1113, 1112, 1111, 1110, 1109, 1108, 1107, 1106, 1105, 1104, 1103, 1101, 1100, 1099, 1097, 1096, 1095, 1094, 1093, 1092, 1091, 1090, 1088, 1087, 1085, 1083, 1082, 1081, 1080, 1079, 1078, 1076, 1074, 1071, 1066, 1065, 1063, 1062, 1061, 1060, 1058, 1057, 1056, 1055, 1054, 1052, 1051, 1050, 1049, 1048, 1047, 1046, 1045, 1044, 1042, 1041, 1040, 1039, 1038, 1036, 1034, 1032, 1031, 1030, 1029, 1028, 1027, 1026, 1025, 1024, 1023, 1022, 1021, 1020, 1018, 1017, 1016, 1015, 1013, 1012, 1011, 1009, 1007, 1004, 1002, 1001, 999, 998, 997, 996, 995, 994, 993, 992, 991, 990, 989, 988, 987, 986, 985, 984, 983, 982, 981, 979, 978, 976, 975, 974, 973, 972, 971, 970, 969, 968, 966, 965, 963, 962, 961, 959, 958, 957, 956, 954, 952, 951, 948, 947, 946, 945, 942, 941, 940, 939, 937, 936, 935, 934, 931, 929]
Starting structural reductions, iteration 1 : 417/618 places, 1043/1564 transitions.
Applied a total of 0 rules in 24 ms. Remains 417 /417 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 417/618 places, 1043/1564 transitions.
Incomplete random walk after 1000000 steps, including 136 resets, run finished after 3466 ms. (steps per millisecond=288 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 1 resets, run finished after 1356 ms. (steps per millisecond=737 ) properties seen :[0]
Interrupted probabilistic random walk after 2799773 steps, run timeout after 30001 ms. (steps per millisecond=93 ) properties seen :[0]
Probabilistic random walk after 2799773 steps, saw 729159 distinct states, run finished after 30002 ms. (steps per millisecond=93 ) properties seen :[0]
[2020-06-03 04:12:29] [INFO ] Flow matrix only has 1019 transitions (discarded 24 similar events)
// Phase 1: matrix 1019 rows 417 cols
[2020-06-03 04:12:29] [INFO ] Computed 50 place invariants in 19 ms
[2020-06-03 04:12:30] [INFO ] [Real]Absence check using 17 positive place invariants in 21 ms returned sat
[2020-06-03 04:12:30] [INFO ] [Real]Absence check using 17 positive and 33 generalized place invariants in 35 ms returned sat
[2020-06-03 04:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:12:31] [INFO ] [Real]Absence check using state equation in 1432 ms returned sat
[2020-06-03 04:12:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:12:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2020-06-03 04:12:31] [INFO ] [Nat]Absence check using 17 positive and 33 generalized place invariants in 29 ms returned sat
[2020-06-03 04:12:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:12:35] [INFO ] [Nat]Absence check using state equation in 3400 ms returned sat
[2020-06-03 04:12:35] [INFO ] State equation strengthened by 126 read => feed constraints.
[2020-06-03 04:12:35] [INFO ] [Nat]Added 126 Read/Feed constraints in 304 ms returned sat
[2020-06-03 04:12:35] [INFO ] Deduced a trap composed of 51 places in 170 ms
[2020-06-03 04:12:35] [INFO ] Deduced a trap composed of 50 places in 74 ms
[2020-06-03 04:12:35] [INFO ] Deduced a trap composed of 50 places in 94 ms
[2020-06-03 04:12:36] [INFO ] Deduced a trap composed of 50 places in 108 ms
[2020-06-03 04:12:36] [INFO ] Deduced a trap composed of 50 places in 362 ms
[2020-06-03 04:12:37] [INFO ] Deduced a trap composed of 168 places in 309 ms
[2020-06-03 04:12:37] [INFO ] Deduced a trap composed of 160 places in 261 ms
[2020-06-03 04:12:38] [INFO ] Deduced a trap composed of 146 places in 243 ms
[2020-06-03 04:12:38] [INFO ] Deduced a trap composed of 178 places in 383 ms
[2020-06-03 04:12:39] [INFO ] Deduced a trap composed of 156 places in 327 ms
[2020-06-03 04:12:39] [INFO ] Deduced a trap composed of 169 places in 289 ms
[2020-06-03 04:12:39] [INFO ] Deduced a trap composed of 180 places in 491 ms
[2020-06-03 04:12:40] [INFO ] Deduced a trap composed of 183 places in 432 ms
[2020-06-03 04:12:41] [INFO ] Deduced a trap composed of 15 places in 292 ms
[2020-06-03 04:12:41] [INFO ] Deduced a trap composed of 65 places in 248 ms
[2020-06-03 04:12:41] [INFO ] Deduced a trap composed of 155 places in 271 ms
[2020-06-03 04:12:42] [INFO ] Deduced a trap composed of 181 places in 223 ms
[2020-06-03 04:12:42] [INFO ] Deduced a trap composed of 171 places in 230 ms
[2020-06-03 04:12:42] [INFO ] Deduced a trap composed of 148 places in 279 ms
[2020-06-03 04:12:43] [INFO ] Deduced a trap composed of 154 places in 318 ms
[2020-06-03 04:12:44] [INFO ] Deduced a trap composed of 85 places in 299 ms
[2020-06-03 04:12:44] [INFO ] Deduced a trap composed of 192 places in 318 ms
[2020-06-03 04:12:45] [INFO ] Deduced a trap composed of 65 places in 248 ms
[2020-06-03 04:12:45] [INFO ] Deduced a trap composed of 159 places in 336 ms
[2020-06-03 04:12:46] [INFO ] Deduced a trap composed of 75 places in 324 ms
[2020-06-03 04:12:46] [INFO ] Deduced a trap composed of 162 places in 322 ms
[2020-06-03 04:12:47] [INFO ] Deduced a trap composed of 208 places in 282 ms
[2020-06-03 04:12:47] [INFO ] Deduced a trap composed of 201 places in 263 ms
[2020-06-03 04:12:47] [INFO ] Deduced a trap composed of 181 places in 296 ms
[2020-06-03 04:12:48] [INFO ] Deduced a trap composed of 172 places in 226 ms
[2020-06-03 04:12:48] [INFO ] Deduced a trap composed of 152 places in 309 ms
[2020-06-03 04:12:48] [INFO ] Deduced a trap composed of 167 places in 274 ms
[2020-06-03 04:12:49] [INFO ] Deduced a trap composed of 145 places in 234 ms
[2020-06-03 04:12:49] [INFO ] Deduced a trap composed of 205 places in 278 ms
[2020-06-03 04:12:49] [INFO ] Deduced a trap composed of 211 places in 245 ms
[2020-06-03 04:12:50] [INFO ] Deduced a trap composed of 133 places in 245 ms
[2020-06-03 04:12:50] [INFO ] Deduced a trap composed of 176 places in 231 ms
[2020-06-03 04:12:50] [INFO ] Deduced a trap composed of 147 places in 194 ms
[2020-06-03 04:12:51] [INFO ] Deduced a trap composed of 145 places in 208 ms
[2020-06-03 04:12:51] [INFO ] Deduced a trap composed of 156 places in 218 ms
[2020-06-03 04:12:52] [INFO ] Deduced a trap composed of 178 places in 246 ms
[2020-06-03 04:12:53] [INFO ] Deduced a trap composed of 179 places in 333 ms
[2020-06-03 04:12:54] [INFO ] Deduced a trap composed of 188 places in 299 ms
[2020-06-03 04:12:54] [INFO ] Deduced a trap composed of 133 places in 282 ms
[2020-06-03 04:12:55] [INFO ] Deduced a trap composed of 76 places in 283 ms
[2020-06-03 04:12:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:13:17] [INFO ] Deduced a trap composed of 3 places in 429 ms
[2020-06-03 04:13:17] [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 closed (> (+ s59 s71 s256) 0)") while checking expression at index 0
Support contains 3 out of 417 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 417/417 places, 1043/1043 transitions.
Applied a total of 0 rules in 26 ms. Remains 417 /417 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 1043/1043 transitions.
Starting structural reductions, iteration 0 : 417/417 places, 1043/1043 transitions.
Applied a total of 0 rules in 25 ms. Remains 417 /417 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2020-06-03 04:13:17] [INFO ] Flow matrix only has 1019 transitions (discarded 24 similar events)
// Phase 1: matrix 1019 rows 417 cols
[2020-06-03 04:13:17] [INFO ] Computed 50 place invariants in 20 ms
[2020-06-03 04:13:18] [INFO ] Implicit Places using invariants in 1028 ms returned [95, 134, 222, 244, 324, 371]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1033 ms to find 6 implicit places.
[2020-06-03 04:13:18] [INFO ] Redundant transitions in 106 ms returned []
[2020-06-03 04:13:18] [INFO ] Flow matrix only has 1019 transitions (discarded 24 similar events)
// Phase 1: matrix 1019 rows 411 cols
[2020-06-03 04:13:18] [INFO ] Computed 44 place invariants in 21 ms
[2020-06-03 04:13:20] [INFO ] Dead Transitions using invariants and state equation in 2225 ms returned []
Starting structural reductions, iteration 1 : 411/417 places, 1043/1043 transitions.
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 411 transition count 1043
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 15 place count 406 transition count 1038
Applied a total of 15 rules in 25 ms. Remains 406 /411 variables (removed 5) and now considering 1038/1043 (removed 5) transitions.
[2020-06-03 04:13:20] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
// Phase 1: matrix 1014 rows 406 cols
[2020-06-03 04:13:20] [INFO ] Computed 44 place invariants in 12 ms
[2020-06-03 04:13:21] [INFO ] Implicit Places using invariants in 897 ms returned []
[2020-06-03 04:13:21] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
// Phase 1: matrix 1014 rows 406 cols
[2020-06-03 04:13:21] [INFO ] Computed 44 place invariants in 15 ms
[2020-06-03 04:13:22] [INFO ] State equation strengthened by 126 read => feed constraints.
[2020-06-03 04:13:31] [INFO ] Implicit Places using invariants and state equation in 10137 ms returned []
Implicit Place search using SMT with State Equation took 11035 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 406/417 places, 1038/1043 transitions.
Incomplete random walk after 1000000 steps, including 146 resets, run finished after 3285 ms. (steps per millisecond=304 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 1 resets, run finished after 1256 ms. (steps per millisecond=796 ) properties seen :[0]
Interrupted probabilistic random walk after 3026400 steps, run timeout after 30001 ms. (steps per millisecond=100 ) properties seen :[0]
Probabilistic random walk after 3026400 steps, saw 824194 distinct states, run finished after 30001 ms. (steps per millisecond=100 ) properties seen :[0]
[2020-06-03 04:14:06] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
// Phase 1: matrix 1014 rows 406 cols
[2020-06-03 04:14:06] [INFO ] Computed 44 place invariants in 12 ms
[2020-06-03 04:14:06] [INFO ] [Real]Absence check using 18 positive place invariants in 22 ms returned sat
[2020-06-03 04:14:06] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 29 ms returned sat
[2020-06-03 04:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:14:07] [INFO ] [Real]Absence check using state equation in 1527 ms returned sat
[2020-06-03 04:14:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:14:07] [INFO ] [Nat]Absence check using 18 positive place invariants in 22 ms returned sat
[2020-06-03 04:14:07] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 27 ms returned sat
[2020-06-03 04:14:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:14:09] [INFO ] [Nat]Absence check using state equation in 1866 ms returned sat
[2020-06-03 04:14:09] [INFO ] State equation strengthened by 126 read => feed constraints.
[2020-06-03 04:14:10] [INFO ] [Nat]Added 126 Read/Feed constraints in 327 ms returned sat
[2020-06-03 04:14:10] [INFO ] Deduced a trap composed of 51 places in 328 ms
[2020-06-03 04:14:10] [INFO ] Deduced a trap composed of 50 places in 261 ms
[2020-06-03 04:14:11] [INFO ] Deduced a trap composed of 112 places in 360 ms
[2020-06-03 04:14:12] [INFO ] Deduced a trap composed of 123 places in 338 ms
[2020-06-03 04:14:12] [INFO ] Deduced a trap composed of 200 places in 346 ms
[2020-06-03 04:14:13] [INFO ] Deduced a trap composed of 152 places in 339 ms
[2020-06-03 04:14:13] [INFO ] Deduced a trap composed of 173 places in 389 ms
[2020-06-03 04:14:14] [INFO ] Deduced a trap composed of 160 places in 302 ms
[2020-06-03 04:14:14] [INFO ] Deduced a trap composed of 187 places in 238 ms
[2020-06-03 04:14:15] [INFO ] Deduced a trap composed of 197 places in 258 ms
[2020-06-03 04:14:15] [INFO ] Deduced a trap composed of 58 places in 246 ms
[2020-06-03 04:14:15] [INFO ] Deduced a trap composed of 216 places in 329 ms
[2020-06-03 04:14:16] [INFO ] Deduced a trap composed of 58 places in 296 ms
[2020-06-03 04:14:16] [INFO ] Deduced a trap composed of 172 places in 270 ms
[2020-06-03 04:14:16] [INFO ] Deduced a trap composed of 194 places in 257 ms
[2020-06-03 04:14:17] [INFO ] Deduced a trap composed of 168 places in 318 ms
[2020-06-03 04:14:17] [INFO ] Deduced a trap composed of 50 places in 287 ms
[2020-06-03 04:14:18] [INFO ] Deduced a trap composed of 75 places in 287 ms
[2020-06-03 04:14:18] [INFO ] Deduced a trap composed of 108 places in 255 ms
[2020-06-03 04:14:19] [INFO ] Deduced a trap composed of 107 places in 303 ms
[2020-06-03 04:14:19] [INFO ] Deduced a trap composed of 120 places in 271 ms
[2020-06-03 04:14:19] [INFO ] Deduced a trap composed of 108 places in 308 ms
[2020-06-03 04:14:20] [INFO ] Deduced a trap composed of 59 places in 300 ms
[2020-06-03 04:14:20] [INFO ] Deduced a trap composed of 130 places in 351 ms
[2020-06-03 04:14:20] [INFO ] Deduced a trap composed of 146 places in 290 ms
[2020-06-03 04:14:21] [INFO ] Deduced a trap composed of 150 places in 272 ms
[2020-06-03 04:14:21] [INFO ] Deduced a trap composed of 132 places in 259 ms
[2020-06-03 04:14:21] [INFO ] Deduced a trap composed of 145 places in 238 ms
[2020-06-03 04:14:22] [INFO ] Deduced a trap composed of 121 places in 246 ms
[2020-06-03 04:14:22] [INFO ] Deduced a trap composed of 179 places in 276 ms
[2020-06-03 04:14:23] [INFO ] Deduced a trap composed of 157 places in 298 ms
[2020-06-03 04:14:23] [INFO ] Deduced a trap composed of 146 places in 259 ms
[2020-06-03 04:14:23] [INFO ] Deduced a trap composed of 213 places in 286 ms
[2020-06-03 04:14:24] [INFO ] Deduced a trap composed of 134 places in 226 ms
[2020-06-03 04:14:24] [INFO ] Deduced a trap composed of 145 places in 268 ms
[2020-06-03 04:14:25] [INFO ] Deduced a trap composed of 131 places in 271 ms
[2020-06-03 04:14:25] [INFO ] Deduced a trap composed of 109 places in 335 ms
[2020-06-03 04:14:25] [INFO ] Deduced a trap composed of 139 places in 295 ms
[2020-06-03 04:14:26] [INFO ] Deduced a trap composed of 145 places in 314 ms
[2020-06-03 04:14:26] [INFO ] Deduced a trap composed of 119 places in 283 ms
[2020-06-03 04:14:27] [INFO ] Deduced a trap composed of 50 places in 255 ms
[2020-06-03 04:14:27] [INFO ] Deduced a trap composed of 144 places in 256 ms
[2020-06-03 04:14:28] [INFO ] Deduced a trap composed of 146 places in 230 ms
[2020-06-03 04:14:28] [INFO ] Deduced a trap composed of 141 places in 297 ms
[2020-06-03 04:14:29] [INFO ] Deduced a trap composed of 131 places in 270 ms
[2020-06-03 04:14:29] [INFO ] Deduced a trap composed of 114 places in 309 ms
[2020-06-03 04:14:30] [INFO ] Deduced a trap composed of 121 places in 368 ms
[2020-06-03 04:14:30] [INFO ] Deduced a trap composed of 136 places in 362 ms
[2020-06-03 04:14:31] [INFO ] Deduced a trap composed of 204 places in 339 ms
[2020-06-03 04:14:31] [INFO ] Deduced a trap composed of 193 places in 340 ms
[2020-06-03 04:14:32] [INFO ] Deduced a trap composed of 110 places in 288 ms
[2020-06-03 04:14:33] [INFO ] Deduced a trap composed of 81 places in 260 ms
[2020-06-03 04:14:33] [INFO ] Deduced a trap composed of 65 places in 242 ms
[2020-06-03 04:14:35] [INFO ] Deduced a trap composed of 123 places in 262 ms
[2020-06-03 04:14:36] [INFO ] Deduced a trap composed of 110 places in 353 ms
[2020-06-03 04:14:36] [INFO ] Deduced a trap composed of 94 places in 318 ms
[2020-06-03 04:14:37] [INFO ] Deduced a trap composed of 162 places in 306 ms
[2020-06-03 04:14:37] [INFO ] Deduced a trap composed of 145 places in 276 ms
[2020-06-03 04:14:37] [INFO ] Deduced a trap composed of 166 places in 286 ms
[2020-06-03 04:14:38] [INFO ] Deduced a trap composed of 144 places in 300 ms
[2020-06-03 04:14:39] [INFO ] Deduced a trap composed of 103 places in 302 ms
[2020-06-03 04:14:39] [INFO ] Deduced a trap composed of 135 places in 303 ms
[2020-06-03 04:14:40] [INFO ] Deduced a trap composed of 117 places in 246 ms
[2020-06-03 04:14:40] [INFO ] Deduced a trap composed of 65 places in 243 ms
[2020-06-03 04:14:41] [INFO ] Deduced a trap composed of 63 places in 323 ms
[2020-06-03 04:14:41] [INFO ] Deduced a trap composed of 68 places in 229 ms
[2020-06-03 04:14:42] [INFO ] Deduced a trap composed of 148 places in 333 ms
[2020-06-03 04:14:42] [INFO ] Deduced a trap composed of 75 places in 301 ms
[2020-06-03 04:14:42] [INFO ] Deduced a trap composed of 164 places in 301 ms
[2020-06-03 04:14:43] [INFO ] Deduced a trap composed of 113 places in 290 ms
[2020-06-03 04:14:43] [INFO ] Deduced a trap composed of 165 places in 306 ms
[2020-06-03 04:14:43] [INFO ] Deduced a trap composed of 63 places in 299 ms
[2020-06-03 04:14:44] [INFO ] Deduced a trap composed of 109 places in 256 ms
[2020-06-03 04:14:44] [INFO ] Deduced a trap composed of 155 places in 271 ms
[2020-06-03 04:14:45] [INFO ] Deduced a trap composed of 98 places in 236 ms
[2020-06-03 04:14:45] [INFO ] Deduced a trap composed of 86 places in 265 ms
[2020-06-03 04:14:46] [INFO ] Deduced a trap composed of 84 places in 253 ms
[2020-06-03 04:14:46] [INFO ] Deduced a trap composed of 102 places in 240 ms
[2020-06-03 04:14:46] [INFO ] Deduced a trap composed of 93 places in 233 ms
[2020-06-03 04:14:47] [INFO ] Deduced a trap composed of 178 places in 223 ms
[2020-06-03 04:14:47] [INFO ] Deduced a trap composed of 196 places in 313 ms
[2020-06-03 04:14:48] [INFO ] Deduced a trap composed of 186 places in 306 ms
[2020-06-03 04:14:48] [INFO ] Deduced a trap composed of 75 places in 264 ms
[2020-06-03 04:14:49] [INFO ] Deduced a trap composed of 82 places in 285 ms
[2020-06-03 04:14:49] [INFO ] Deduced a trap composed of 65 places in 305 ms
[2020-06-03 04:14:49] [INFO ] Deduced a trap composed of 143 places in 277 ms
[2020-06-03 04:14:50] [INFO ] Deduced a trap composed of 154 places in 320 ms
[2020-06-03 04:14:50] [INFO ] Deduced a trap composed of 158 places in 283 ms
[2020-06-03 04:14:50] [INFO ] Deduced a trap composed of 151 places in 247 ms
[2020-06-03 04:14:51] [INFO ] Deduced a trap composed of 65 places in 231 ms
[2020-06-03 04:14:51] [INFO ] Deduced a trap composed of 76 places in 199 ms
[2020-06-03 04:14:51] [INFO ] Deduced a trap composed of 80 places in 317 ms
[2020-06-03 04:14:52] [INFO ] Deduced a trap composed of 76 places in 306 ms
[2020-06-03 04:14:52] [INFO ] Deduced a trap composed of 68 places in 302 ms
[2020-06-03 04:14:52] [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 closed (> (+ s6 s10 s13 s24 s35 s52 s56 s60 s67 s75 s76 s83 s87 s88 s89 s97 s104 s111 s113 s116 s118 s123 s144 s146 s161 s172 s177 s178 s182 s183 s187 s188 s193 s196 s197 s206 s210 s215 s218 s229 s234 s236 s237 s238 s239 s250 s266 s268 s273 s287 s296 s299 s300 s301 s304 s308 s313 s323 s336 s341 s352 s356 s359 s363 s366 s371 s374 s383) 0)") while checking expression at index 0
Support contains 3 out of 406 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 406/406 places, 1038/1038 transitions.
Applied a total of 0 rules in 15 ms. Remains 406 /406 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 406/406 places, 1038/1038 transitions.
Starting structural reductions, iteration 0 : 406/406 places, 1038/1038 transitions.
Applied a total of 0 rules in 15 ms. Remains 406 /406 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
[2020-06-03 04:14:52] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
// Phase 1: matrix 1014 rows 406 cols
[2020-06-03 04:14:52] [INFO ] Computed 44 place invariants in 12 ms
[2020-06-03 04:14:53] [INFO ] Implicit Places using invariants in 1134 ms returned []
[2020-06-03 04:14:53] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
// Phase 1: matrix 1014 rows 406 cols
[2020-06-03 04:14:54] [INFO ] Computed 44 place invariants in 19 ms
[2020-06-03 04:14:55] [INFO ] State equation strengthened by 126 read => feed constraints.
[2020-06-03 04:15:04] [INFO ] Implicit Places using invariants and state equation in 10775 ms returned []
Implicit Place search using SMT with State Equation took 11911 ms to find 0 implicit places.
[2020-06-03 04:15:04] [INFO ] Redundant transitions in 14 ms returned []
[2020-06-03 04:15:04] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
// Phase 1: matrix 1014 rows 406 cols
[2020-06-03 04:15:04] [INFO ] Computed 44 place invariants in 12 ms
[2020-06-03 04:15:07] [INFO ] Dead Transitions using invariants and state equation in 2250 ms returned []
Finished structural reductions, in 1 iterations. Remains : 406/406 places, 1038/1038 transitions.
Incomplete random walk after 100000 steps, including 13 resets, run finished after 307 ms. (steps per millisecond=325 ) properties seen :[0]
[2020-06-03 04:15:07] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
// Phase 1: matrix 1014 rows 406 cols
[2020-06-03 04:15:07] [INFO ] Computed 44 place invariants in 12 ms
[2020-06-03 04:15:07] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2020-06-03 04:15:07] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 25 ms returned sat
[2020-06-03 04:15:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:08] [INFO ] [Real]Absence check using state equation in 1355 ms returned sat
[2020-06-03 04:15:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:15:08] [INFO ] [Nat]Absence check using 18 positive place invariants in 21 ms returned sat
[2020-06-03 04:15:08] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 25 ms returned sat
[2020-06-03 04:15:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:10] [INFO ] [Nat]Absence check using state equation in 1987 ms returned sat
[2020-06-03 04:15:10] [INFO ] State equation strengthened by 126 read => feed constraints.
[2020-06-03 04:15:11] [INFO ] [Nat]Added 126 Read/Feed constraints in 331 ms returned sat
[2020-06-03 04:15:11] [INFO ] Deduced a trap composed of 51 places in 273 ms
[2020-06-03 04:15:11] [INFO ] Deduced a trap composed of 50 places in 304 ms
[2020-06-03 04:15:12] [INFO ] Deduced a trap composed of 112 places in 310 ms
[2020-06-03 04:15:13] [INFO ] Deduced a trap composed of 123 places in 282 ms
[2020-06-03 04:15:13] [INFO ] Deduced a trap composed of 200 places in 283 ms
[2020-06-03 04:15:13] [INFO ] Deduced a trap composed of 152 places in 249 ms
[2020-06-03 04:15:14] [INFO ] Deduced a trap composed of 173 places in 230 ms
[2020-06-03 04:15:14] [INFO ] Deduced a trap composed of 160 places in 243 ms
[2020-06-03 04:15:15] [INFO ] Deduced a trap composed of 187 places in 260 ms
[2020-06-03 04:15:15] [INFO ] Deduced a trap composed of 197 places in 304 ms
[2020-06-03 04:15:15] [INFO ] Deduced a trap composed of 58 places in 256 ms
[2020-06-03 04:15:16] [INFO ] Deduced a trap composed of 216 places in 259 ms
[2020-06-03 04:15:16] [INFO ] Deduced a trap composed of 58 places in 264 ms
[2020-06-03 04:15:17] [INFO ] Deduced a trap composed of 172 places in 262 ms
[2020-06-03 04:15:17] [INFO ] Deduced a trap composed of 194 places in 251 ms
[2020-06-03 04:15:18] [INFO ] Deduced a trap composed of 168 places in 245 ms
[2020-06-03 04:15:18] [INFO ] Deduced a trap composed of 50 places in 269 ms
[2020-06-03 04:15:18] [INFO ] Deduced a trap composed of 75 places in 273 ms
[2020-06-03 04:15:19] [INFO ] Deduced a trap composed of 108 places in 348 ms
[2020-06-03 04:15:19] [INFO ] Deduced a trap composed of 107 places in 269 ms
[2020-06-03 04:15:19] [INFO ] Deduced a trap composed of 120 places in 254 ms
[2020-06-03 04:15:20] [INFO ] Deduced a trap composed of 108 places in 243 ms
[2020-06-03 04:15:20] [INFO ] Deduced a trap composed of 59 places in 208 ms
[2020-06-03 04:15:20] [INFO ] Deduced a trap composed of 130 places in 237 ms
[2020-06-03 04:15:21] [INFO ] Deduced a trap composed of 146 places in 207 ms
[2020-06-03 04:15:21] [INFO ] Deduced a trap composed of 150 places in 222 ms
[2020-06-03 04:15:21] [INFO ] Deduced a trap composed of 132 places in 211 ms
[2020-06-03 04:15:21] [INFO ] Deduced a trap composed of 145 places in 225 ms
[2020-06-03 04:15:22] [INFO ] Deduced a trap composed of 121 places in 248 ms
[2020-06-03 04:15:22] [INFO ] Deduced a trap composed of 179 places in 250 ms
[2020-06-03 04:15:23] [INFO ] Deduced a trap composed of 157 places in 258 ms
[2020-06-03 04:15:23] [INFO ] Deduced a trap composed of 146 places in 252 ms
[2020-06-03 04:15:23] [INFO ] Deduced a trap composed of 213 places in 255 ms
[2020-06-03 04:15:24] [INFO ] Deduced a trap composed of 134 places in 272 ms
[2020-06-03 04:15:24] [INFO ] Deduced a trap composed of 145 places in 256 ms
[2020-06-03 04:15:25] [INFO ] Deduced a trap composed of 131 places in 313 ms
[2020-06-03 04:15:25] [INFO ] Deduced a trap composed of 109 places in 355 ms
[2020-06-03 04:15:26] [INFO ] Deduced a trap composed of 139 places in 341 ms
[2020-06-03 04:15:26] [INFO ] Deduced a trap composed of 145 places in 348 ms
[2020-06-03 04:15:27] [INFO ] Deduced a trap composed of 119 places in 301 ms
[2020-06-03 04:15:27] [INFO ] Deduced a trap composed of 50 places in 290 ms
[2020-06-03 04:15:28] [INFO ] Deduced a trap composed of 144 places in 316 ms
[2020-06-03 04:15:28] [INFO ] Deduced a trap composed of 146 places in 251 ms
[2020-06-03 04:15:28] [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 closed (> (+ s6 s8 s9 s10 s13 s16 s18 s19 s24 s26 s35 s39 s42 s43 s47 s49 s50 s52 s53 s56 s57 s60 s61 s63 s65 s67 s70 s75 s78 s83 s87 s88 s89 s101 s102 s104 s105 s111 s112 s114 s116 s122 s123 s124 s127 s131 s135 s144 s147 s149 s151 s152 s159 s165 s166 s169 s172 s173 s178 s180 s183 s186 s187 s188 s189 s193 s194 s195 s196 s197 s205 s206 s215 s217 s218 s229 s230 s233 s234 s235 s236 s237 s238 s240 s241 s244 s249 s253 s257 s262 s265 s266 s268 s269 s273 s277 s278 s281 s287 s290 s292 s293 s294 s296 s299 s300 s301 s303 s304 s308 s309 s313 s314 s316 s318 s321 s323 s326 s331 s336 s338 s341 s345 s346 s347 s348 s352 s355 s356 s359 s361 s363 s365 s366 s371 s372 s374 s377 s380 s383 s386 s390 s393 s400 s401 s402) 0)") while checking expression at index 0
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 406 transition count 1014
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 34 place count 401 transition count 1064
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 401 transition count 1058
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 46 place count 395 transition count 1058
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 395 transition count 1048
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 66 place count 385 transition count 1048
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 385 transition count 1048
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 3 with 44 rules applied. Total rules applied 113 place count 385 transition count 1004
Applied a total of 113 rules in 99 ms. Remains 385 /406 variables (removed 21) and now considering 1004/1038 (removed 34) transitions.
// Phase 1: matrix 1004 rows 385 cols
[2020-06-03 04:15:29] [INFO ] Computed 44 place invariants in 18 ms
[2020-06-03 04:15:29] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2020-06-03 04:15:29] [INFO ] [Real]Absence check using 19 positive and 25 generalized place invariants in 16 ms returned sat
[2020-06-03 04:15:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:31] [INFO ] [Real]Absence check using state equation in 2573 ms returned sat
[2020-06-03 04:15:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 04:15:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 28 ms returned sat
[2020-06-03 04:15:31] [INFO ] [Nat]Absence check using 19 positive and 25 generalized place invariants in 24 ms returned sat
[2020-06-03 04:15:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 04:15:34] [INFO ] [Nat]Absence check using state equation in 2964 ms returned sat
[2020-06-03 04:15:34] [INFO ] Deduced a trap composed of 48 places in 60 ms
[2020-06-03 04:15:34] [INFO ] Deduced a trap composed of 47 places in 63 ms
[2020-06-03 04:15:35] [INFO ] Deduced a trap composed of 48 places in 38 ms
[2020-06-03 04:15:36] [INFO ] Deduced a trap composed of 48 places in 64 ms
[2020-06-03 04:15:36] [INFO ] Deduced a trap composed of 75 places in 238 ms
[2020-06-03 04:15:37] [INFO ] Deduced a trap composed of 175 places in 248 ms
[2020-06-03 04:15:37] [INFO ] Deduced a trap composed of 124 places in 231 ms
[2020-06-03 04:15:38] [INFO ] Deduced a trap composed of 132 places in 180 ms
[2020-06-03 04:15:38] [INFO ] Deduced a trap composed of 137 places in 174 ms
[2020-06-03 04:15:38] [INFO ] Deduced a trap composed of 47 places in 43 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 156 places in 232 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 89 places in 207 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 94 places in 206 ms
[2020-06-03 04:15:39] [INFO ] Deduced a trap composed of 78 places in 222 ms
[2020-06-03 04:15:40] [INFO ] Deduced a trap composed of 145 places in 218 ms
[2020-06-03 04:15:40] [INFO ] Deduced a trap composed of 59 places in 225 ms
[2020-06-03 04:15:40] [INFO ] Deduced a trap composed of 75 places in 204 ms
[2020-06-03 04:15:41] [INFO ] Deduced a trap composed of 151 places in 308 ms
[2020-06-03 04:15:41] [INFO ] Deduced a trap composed of 163 places in 260 ms
[2020-06-03 04:15:41] [INFO ] Deduced a trap composed of 177 places in 209 ms
[2020-06-03 04:15:41] [INFO ] Deduced a trap composed of 183 places in 206 ms
[2020-06-03 04:15:42] [INFO ] Deduced a trap composed of 167 places in 214 ms
[2020-06-03 04:15:42] [INFO ] Deduced a trap composed of 179 places in 197 ms
[2020-06-03 04:15:42] [INFO ] Deduced a trap composed of 171 places in 181 ms
[2020-06-03 04:15:42] [INFO ] Deduced a trap composed of 194 places in 190 ms
[2020-06-03 04:15:43] [INFO ] Deduced a trap composed of 167 places in 188 ms
[2020-06-03 04:15:43] [INFO ] Deduced a trap composed of 162 places in 196 ms
[2020-06-03 04:15:43] [INFO ] Deduced a trap composed of 202 places in 201 ms
[2020-06-03 04:15:43] [INFO ] Deduced a trap composed of 192 places in 188 ms
[2020-06-03 04:15:44] [INFO ] Deduced a trap composed of 174 places in 209 ms
[2020-06-03 04:15:44] [INFO ] Deduced a trap composed of 166 places in 201 ms
[2020-06-03 04:15:44] [INFO ] Deduced a trap composed of 166 places in 199 ms
[2020-06-03 04:15:44] [INFO ] Deduced a trap composed of 195 places in 235 ms
[2020-06-03 04:15:45] [INFO ] Deduced a trap composed of 132 places in 236 ms
[2020-06-03 04:15:45] [INFO ] Deduced a trap composed of 170 places in 201 ms
[2020-06-03 04:15:45] [INFO ] Deduced a trap composed of 171 places in 182 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 129 places in 259 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 156 places in 213 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 139 places in 252 ms
[2020-06-03 04:15:46] [INFO ] Deduced a trap composed of 160 places in 200 ms
[2020-06-03 04:15:47] [INFO ] Deduced a trap composed of 127 places in 198 ms
[2020-06-03 04:15:47] [INFO ] Deduced a trap composed of 98 places in 247 ms
[2020-06-03 04:15:47] [INFO ] Deduced a trap composed of 96 places in 223 ms
[2020-06-03 04:15:48] [INFO ] Deduced a trap composed of 140 places in 217 ms
[2020-06-03 04:15:48] [INFO ] Deduced a trap composed of 124 places in 197 ms
[2020-06-03 04:15:48] [INFO ] Deduced a trap composed of 136 places in 198 ms
[2020-06-03 04:15:48] [INFO ] Deduced a trap composed of 138 places in 227 ms
[2020-06-03 04:15:49] [INFO ] Deduced a trap composed of 140 places in 221 ms
[2020-06-03 04:15:49] [INFO ] Deduced a trap composed of 200 places in 219 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 186 places in 219 ms
[2020-06-03 04:15:50] [INFO ] Deduced a trap composed of 130 places in 280 ms
[2020-06-03 04:15:52] [INFO ] Deduced a trap composed of 157 places in 221 ms
[2020-06-03 04:15:52] [INFO ] Deduced a trap composed of 141 places in 224 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 129 places in 222 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 145 places in 218 ms
[2020-06-03 04:15:53] [INFO ] Deduced a trap composed of 163 places in 248 ms
[2020-06-03 04:15:54] [INFO ] Deduced a trap composed of 183 places in 217 ms
[2020-06-03 04:15:54] [INFO ] Deduced a trap composed of 160 places in 220 ms
[2020-06-03 04:15:54] [INFO ] Deduced a trap composed of 185 places in 217 ms
[2020-06-03 04:15:55] [INFO ] Deduced a trap composed of 96 places in 217 ms
[2020-06-03 04:15:55] [INFO ] Deduced a trap composed of 177 places in 270 ms
[2020-06-03 04:15:56] [INFO ] Deduced a trap composed of 124 places in 270 ms
[2020-06-03 04:15:56] [INFO ] Deduced a trap composed of 87 places in 224 ms
[2020-06-03 04:15:56] [INFO ] Deduced a trap composed of 168 places in 254 ms
[2020-06-03 04:15:57] [INFO ] Deduced a trap composed of 100 places in 225 ms
[2020-06-03 04:15:57] [INFO ] Deduced a trap composed of 96 places in 242 ms
[2020-06-03 04:15:57] [INFO ] Deduced a trap composed of 101 places in 237 ms
[2020-06-03 04:15:58] [INFO ] Deduced a trap composed of 94 places in 290 ms
[2020-06-03 04:15:58] [INFO ] Deduced a trap composed of 127 places in 214 ms
[2020-06-03 04:15:58] [INFO ] Deduced a trap composed of 122 places in 230 ms
[2020-06-03 04:15:59] [INFO ] Deduced a trap composed of 174 places in 239 ms
[2020-06-03 04:15:59] [INFO ] Deduced a trap composed of 168 places in 233 ms
[2020-06-03 04:16:01] [INFO ] Deduced a trap composed of 91 places in 218 ms
[2020-06-03 04:16:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 04:16:17] [INFO ] Deduced a trap composed of 5 places in 392 ms
[2020-06-03 04:16:17] [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 closed (> (+ s156 s238 s279 s287 s325) 0)") while checking expression at index 0
[2020-06-03 04:16:17] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2020-06-03 04:16:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 17 ms.
[2020-06-03 04:16:17] [INFO ] Flatten gal took : 175 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ PolyORBLF-PT-S04J06T06 @ 3570 seconds
vrfy: finished
info: timeLeft: 3552
rslt: Output for ReachabilityCardinality @ PolyORBLF-PT-S04J06T06
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 04:16:17 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 28160,
"runtime": 18.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((p255 <= p344) AND (3 <= p167))))",
"processed_size": 40,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 5389,
"conflict_clusters": 32,
"places": 406,
"places_significant": 362,
"singleton_clusters": 0,
"transitions": 1038
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1444/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 12992
lola: finding significant places
lola: 406 places, 1038 transitions, 362 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: E (F (((p255 <= p344) AND (3 <= p167))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p255 <= p344) AND (3 <= p167))))
lola: processed formula length: 40
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p255 <= p344) AND (3 <= p167))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: local time limit reached - aborting
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
lola: memory consumption: 28160 KB
lola: time consumption: 18 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished
--------------------
content from stderr:
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-S04J06T06"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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 itslola"
echo " Input is PolyORBLF-PT-S04J06T06, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987871900486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J06T06.tgz
mv PolyORBLF-PT-S04J06T06 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;