fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r231-tall-167856416600782
Last Updated
May 14, 2023

About the Execution of LoLa+red for MultiCrashLeafsetExtension-PT-S16C06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1087.691 113639.00 137541.00 559.00 FFTTTTFFFTTFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r231-tall-167856416600782.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is MultiCrashLeafsetExtension-PT-S16C06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416600782
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 13K Feb 26 03:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 03:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 03:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 26 03:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 03:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 03:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 03:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.2M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679488792958

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 12:39:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 12:39:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 12:39:54] [INFO ] Load time of PNML (sax parser for PT used): 267 ms
[2023-03-22 12:39:54] [INFO ] Transformed 5568 places.
[2023-03-22 12:39:54] [INFO ] Transformed 7799 transitions.
[2023-03-22 12:39:54] [INFO ] Parsed PT model containing 5568 places and 7799 transitions and 29646 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 160 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 16) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 14) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-22 12:39:56] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
// Phase 1: matrix 7527 rows 5568 cols
[2023-03-22 12:39:57] [INFO ] Computed 573 place invariants in 376 ms
[2023-03-22 12:39:58] [INFO ] After 1598ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-22 12:40:00] [INFO ] [Nat]Absence check using 50 positive place invariants in 23 ms returned sat
[2023-03-22 12:40:00] [INFO ] [Nat]Absence check using 50 positive and 523 generalized place invariants in 237 ms returned sat
[2023-03-22 12:40:07] [INFO ] After 7445ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :1
[2023-03-22 12:40:07] [INFO ] State equation strengthened by 2178 read => feed constraints.
[2023-03-22 12:40:09] [INFO ] After 1179ms SMT Verify possible using 2178 Read/Feed constraints in natural domain returned unsat :12 sat :1
[2023-03-22 12:40:15] [INFO ] Deduced a trap composed of 805 places in 5954 ms of which 12 ms to minimize.
[2023-03-22 12:40:22] [INFO ] Deduced a trap composed of 1191 places in 5987 ms of which 6 ms to minimize.
[2023-03-22 12:40:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 12873 ms
[2023-03-22 12:40:22] [INFO ] After 14474ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :1
Attempting to minimize the solution found.
Minimization took 517 ms.
[2023-03-22 12:40:22] [INFO ] After 24188ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 16 out of 5568 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Graph (complete) has 17461 edges and 5568 vertex of which 5536 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.25 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 1613 transitions
Trivial Post-agglo rules discarded 1613 transitions
Performed 1613 trivial Post agglomeration. Transition count delta: 1613
Iterating post reduction 0 with 1613 rules applied. Total rules applied 1614 place count 5536 transition count 6186
Reduce places removed 1613 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 1629 rules applied. Total rules applied 3243 place count 3923 transition count 6170
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 3259 place count 3907 transition count 6170
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 202 Pre rules applied. Total rules applied 3259 place count 3907 transition count 5968
Deduced a syphon composed of 202 places in 6 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 3 with 404 rules applied. Total rules applied 3663 place count 3705 transition count 5968
Discarding 1417 places :
Symmetric choice reduction at 3 with 1417 rule applications. Total rules 5080 place count 2288 transition count 4551
Iterating global reduction 3 with 1417 rules applied. Total rules applied 6497 place count 2288 transition count 4551
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 6497 place count 2288 transition count 4546
Deduced a syphon composed of 5 places in 6 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 6507 place count 2283 transition count 4546
Discarding 227 places :
Symmetric choice reduction at 3 with 227 rule applications. Total rules 6734 place count 2056 transition count 3184
Iterating global reduction 3 with 227 rules applied. Total rules applied 6961 place count 2056 transition count 3184
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 6995 place count 2039 transition count 3167
Free-agglomeration rule (complex) applied 170 times.
Iterating global reduction 3 with 170 rules applied. Total rules applied 7165 place count 2039 transition count 4097
Reduce places removed 170 places and 0 transitions.
Iterating post reduction 3 with 170 rules applied. Total rules applied 7335 place count 1869 transition count 4097
Partial Free-agglomeration rule applied 118 times.
Drop transitions removed 118 transitions
Iterating global reduction 4 with 118 rules applied. Total rules applied 7453 place count 1869 transition count 4097
Applied a total of 7453 rules in 1692 ms. Remains 1869 /5568 variables (removed 3699) and now considering 4097/7799 (removed 3702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1695 ms. Remains : 1869/5568 places, 4097/7799 transitions.
Incomplete random walk after 10000 steps, including 264 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 61123 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 61123 steps, saw 27296 distinct states, run finished after 3004 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 12:40:27] [INFO ] Flow matrix only has 3699 transitions (discarded 398 similar events)
// Phase 1: matrix 3699 rows 1869 cols
[2023-03-22 12:40:27] [INFO ] Computed 541 place invariants in 72 ms
[2023-03-22 12:40:28] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:40:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 20 ms returned sat
[2023-03-22 12:40:28] [INFO ] [Nat]Absence check using 31 positive and 510 generalized place invariants in 120 ms returned sat
[2023-03-22 12:40:29] [INFO ] After 1400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:40:30] [INFO ] State equation strengthened by 2143 read => feed constraints.
[2023-03-22 12:40:30] [INFO ] After 402ms SMT Verify possible using 2143 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 12:40:32] [INFO ] Deduced a trap composed of 198 places in 1331 ms of which 4 ms to minimize.
[2023-03-22 12:40:33] [INFO ] Deduced a trap composed of 213 places in 1350 ms of which 2 ms to minimize.
[2023-03-22 12:40:35] [INFO ] Deduced a trap composed of 206 places in 1341 ms of which 2 ms to minimize.
[2023-03-22 12:40:37] [INFO ] Deduced a trap composed of 266 places in 1350 ms of which 2 ms to minimize.
[2023-03-22 12:40:40] [INFO ] Deduced a trap composed of 232 places in 1352 ms of which 2 ms to minimize.
[2023-03-22 12:40:42] [INFO ] Deduced a trap composed of 222 places in 1325 ms of which 2 ms to minimize.
[2023-03-22 12:40:43] [INFO ] Deduced a trap composed of 250 places in 1289 ms of which 3 ms to minimize.
[2023-03-22 12:40:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 13850 ms
[2023-03-22 12:40:44] [INFO ] After 14487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 240 ms.
[2023-03-22 12:40:44] [INFO ] After 16554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 16 out of 1869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1869/1869 places, 4097/4097 transitions.
Applied a total of 0 rules in 141 ms. Remains 1869 /1869 variables (removed 0) and now considering 4097/4097 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 1869/1869 places, 4097/4097 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1869/1869 places, 4097/4097 transitions.
Applied a total of 0 rules in 137 ms. Remains 1869 /1869 variables (removed 0) and now considering 4097/4097 (removed 0) transitions.
[2023-03-22 12:40:45] [INFO ] Flow matrix only has 3699 transitions (discarded 398 similar events)
[2023-03-22 12:40:45] [INFO ] Invariant cache hit.
[2023-03-22 12:40:48] [INFO ] Implicit Places using invariants in 3799 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 84, 98, 99, 100, 101, 102, 103, 104, 116, 126, 134, 140, 144, 146, 161, 167, 169, 170, 171, 172, 173, 174, 175, 177, 181, 187, 195, 205, 217, 230, 242, 243, 244, 245, 246, 247, 248, 258, 266, 272, 276, 278, 280, 295, 301, 303, 304, 305, 306, 307, 309, 311, 313, 317, 324, 332, 342, 353, 363, 364, 365, 366, 367, 368, 369, 377, 383, 387, 389, 391, 393, 408, 414, 416, 417, 418, 419, 420, 421, 422, 424, 426, 428, 432, 438, 446, 455, 463, 464, 465, 466, 467, 468, 469, 475, 479, 481, 483, 485, 487, 502, 508, 510, 511, 512, 513, 514, 515, 516, 518, 520, 522, 524, 528, 534, 541, 547, 548, 549, 550, 551, 552, 553, 557, 559, 561, 563, 565, 567, 582, 588, 591, 592, 593, 594, 595, 596, 599, 601, 603, 605, 607, 611, 616, 621, 622, 623, 624, 625, 626, 628, 630, 632, 634, 637, 639, 654, 660, 662, 663, 664, 665, 667, 668, 670, 673, 675, 677, 679, 681, 684, 686, 687, 688, 689, 690, 691, 692, 694, 696, 698, 700, 702, 704, 719, 725, 727, 728, 729, 730, 731, 732, 733, 735, 737, 739, 741, 743, 745, 747, 749, 750, 751, 752, 753, 754, 755, 757, 759, 761, 763, 765, 767, 782, 784, 787, 789, 790, 791, 792, 793, 794, 795, 797, 799, 801, 803, 805, 807, 809, 812, 813, 814, 815, 816, 817, 818, 820, 822, 824, 826, 828, 830, 845, 851, 853, 856, 857, 858, 859, 861, 865, 867, 871, 873, 875, 877, 879, 880, 881, 882, 883, 884, 885, 887, 889, 891, 893, 895, 897, 912, 918, 920, 921, 922, 924, 926, 928, 930, 932, 935, 938, 940, 942, 945, 946, 947, 948, 949, 950, 951, 953, 955, 957, 959, 961, 963, 978, 984, 988, 989, 990, 991, 992, 993, 996, 998, 1000, 1002, 1004, 1006, 1010, 1015, 1016, 1017, 1018, 1019, 1020, 1021, 1025, 1027, 1029, 1031, 1033, 1035, 1050, 1056, 1058, 1059, 1060, 1061, 1062, 1063, 1064, 1066, 1068, 1070, 1072, 1074, 1078, 1084, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1103, 1107, 1109, 1111, 1113, 1115, 1131, 1137, 1139, 1140, 1141, 1142, 1143, 1144, 1145, 1147, 1149, 1151, 1153, 1157, 1163, 1171, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1194, 1200, 1204, 1206, 1208, 1210, 1225, 1231, 1233, 1234, 1235, 1236, 1238, 1239, 1242, 1244, 1246, 1250, 1256, 1264, 1274, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1301, 1309, 1315, 1319, 1321, 1323, 1339, 1345, 1347, 1349, 1350, 1351, 1352, 1353, 1355, 1357, 1361, 1367, 1376, 1386, 1398, 1411, 1412, 1413, 1414, 1415, 1416, 1417, 1429, 1439, 1447, 1453, 1457, 1459, 1474, 1476, 1479, 1481, 1482, 1483, 1484, 1485, 1486, 1487, 1489, 1493, 1499, 1507, 1517, 1529, 1543, 1558, 1559, 1560, 1561, 1562, 1563, 1564, 1578, 1590, 1600, 1608, 1614, 1618, 1633]
Discarding 485 places :
Implicit Place search using SMT only with invariants took 3813 ms to find 485 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1384/1869 places, 4097/4097 transitions.
Discarding 180 places :
Symmetric choice reduction at 0 with 180 rule applications. Total rules 180 place count 1204 transition count 3917
Iterating global reduction 0 with 180 rules applied. Total rules applied 360 place count 1204 transition count 3917
Discarding 179 places :
Symmetric choice reduction at 0 with 179 rule applications. Total rules 539 place count 1025 transition count 3738
Iterating global reduction 0 with 179 rules applied. Total rules applied 718 place count 1025 transition count 3738
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 720 place count 1025 transition count 3736
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 722 place count 1023 transition count 3736
Applied a total of 722 rules in 300 ms. Remains 1023 /1384 variables (removed 361) and now considering 3736/4097 (removed 361) transitions.
[2023-03-22 12:40:49] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
// Phase 1: matrix 3338 rows 1023 cols
[2023-03-22 12:40:49] [INFO ] Computed 56 place invariants in 51 ms
[2023-03-22 12:40:50] [INFO ] Implicit Places using invariants in 1134 ms returned []
[2023-03-22 12:40:50] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
[2023-03-22 12:40:50] [INFO ] Invariant cache hit.
[2023-03-22 12:40:51] [INFO ] State equation strengthened by 2143 read => feed constraints.
[2023-03-22 12:41:12] [INFO ] Implicit Places using invariants and state equation in 22254 ms returned []
Implicit Place search using SMT with State Equation took 23395 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1023/1869 places, 3736/4097 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 27646 ms. Remains : 1023/1869 places, 3736/4097 transitions.
Incomplete random walk after 10000 steps, including 273 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 70599 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70599 steps, saw 29590 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 12:41:15] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
[2023-03-22 12:41:15] [INFO ] Invariant cache hit.
[2023-03-22 12:41:15] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:41:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-22 12:41:15] [INFO ] [Nat]Absence check using 31 positive and 25 generalized place invariants in 5 ms returned sat
[2023-03-22 12:41:16] [INFO ] After 904ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:41:16] [INFO ] State equation strengthened by 2143 read => feed constraints.
[2023-03-22 12:41:17] [INFO ] After 289ms SMT Verify possible using 2143 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 12:41:17] [INFO ] Deduced a trap composed of 135 places in 508 ms of which 1 ms to minimize.
[2023-03-22 12:41:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 987 ms
[2023-03-22 12:41:18] [INFO ] After 1391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-22 12:41:18] [INFO ] After 2547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 16 out of 1023 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1023/1023 places, 3736/3736 transitions.
Applied a total of 0 rules in 100 ms. Remains 1023 /1023 variables (removed 0) and now considering 3736/3736 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 1023/1023 places, 3736/3736 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1023/1023 places, 3736/3736 transitions.
Applied a total of 0 rules in 104 ms. Remains 1023 /1023 variables (removed 0) and now considering 3736/3736 (removed 0) transitions.
[2023-03-22 12:41:18] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
[2023-03-22 12:41:18] [INFO ] Invariant cache hit.
[2023-03-22 12:41:19] [INFO ] Implicit Places using invariants in 1057 ms returned []
[2023-03-22 12:41:19] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
[2023-03-22 12:41:19] [INFO ] Invariant cache hit.
[2023-03-22 12:41:20] [INFO ] State equation strengthened by 2143 read => feed constraints.
[2023-03-22 12:41:41] [INFO ] Implicit Places using invariants and state equation in 22264 ms returned []
Implicit Place search using SMT with State Equation took 23323 ms to find 0 implicit places.
[2023-03-22 12:41:42] [INFO ] Redundant transitions in 247 ms returned []
[2023-03-22 12:41:42] [INFO ] Flow matrix only has 3338 transitions (discarded 398 similar events)
[2023-03-22 12:41:42] [INFO ] Invariant cache hit.
[2023-03-22 12:41:43] [INFO ] Dead Transitions using invariants and state equation in 1253 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24952 ms. Remains : 1023/1023 places, 3736/3736 transitions.
Graph (trivial) has 1065 edges and 1023 vertex of which 17 / 1023 are part of one of the 1 SCC in 4 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 4416 edges and 1007 vertex of which 993 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 976 transition count 2967
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 879 transition count 2774
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 783 transition count 2606
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 3 with 214 rules applied. Total rules applied 869 place count 711 transition count 2464
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 70 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 190 rules applied. Total rules applied 1059 place count 641 transition count 2344
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1207 place count 591 transition count 2246
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 6 with 127 rules applied. Total rules applied 1334 place count 543 transition count 2167
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 7 with 91 rules applied. Total rules applied 1425 place count 512 transition count 2107
Reduce places removed 29 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 75 rules applied. Total rules applied 1500 place count 483 transition count 2061
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 9 with 49 rules applied. Total rules applied 1549 place count 466 transition count 2029
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 38 rules applied. Total rules applied 1587 place count 451 transition count 2006
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1609 place count 443 transition count 1992
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1623 place count 437 transition count 1984
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1628 place count 435 transition count 1981
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1630 place count 434 transition count 1980
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 23 Pre rules applied. Total rules applied 1630 place count 434 transition count 1957
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 15 with 46 rules applied. Total rules applied 1676 place count 411 transition count 1957
Discarding 261 places :
Symmetric choice reduction at 15 with 261 rule applications. Total rules 1937 place count 150 transition count 501
Iterating global reduction 15 with 261 rules applied. Total rules applied 2198 place count 150 transition count 501
Ensure Unique test removed 157 transitions
Reduce isomorphic transitions removed 157 transitions.
Iterating post reduction 15 with 157 rules applied. Total rules applied 2355 place count 150 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2355 place count 150 transition count 343
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2357 place count 149 transition count 343
Discarding 6 places :
Symmetric choice reduction at 16 with 6 rule applications. Total rules 2363 place count 143 transition count 313
Iterating global reduction 16 with 6 rules applied. Total rules applied 2369 place count 143 transition count 313
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 2374 place count 138 transition count 308
Iterating global reduction 16 with 5 rules applied. Total rules applied 2379 place count 138 transition count 308
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 16 with 18 rules applied. Total rules applied 2397 place count 129 transition count 299
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 2398 place count 129 transition count 298
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 2402 place count 127 transition count 304
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 2403 place count 126 transition count 298
Iterating global reduction 17 with 1 rules applied. Total rules applied 2404 place count 126 transition count 298
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 2407 place count 126 transition count 295
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 2408 place count 126 transition count 294
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 18 with 10 rules applied. Total rules applied 2418 place count 126 transition count 284
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 18 with 10 rules applied. Total rules applied 2428 place count 116 transition count 284
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 19 with 27 rules applied. Total rules applied 2455 place count 116 transition count 284
Applied a total of 2455 rules in 492 ms. Remains 116 /1023 variables (removed 907) and now considering 284/3736 (removed 3452) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 284 rows 116 cols
[2023-03-22 12:41:43] [INFO ] Computed 26 place invariants in 5 ms
[2023-03-22 12:41:44] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 12:41:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-22 12:41:44] [INFO ] [Nat]Absence check using 3 positive and 23 generalized place invariants in 9 ms returned sat
[2023-03-22 12:41:44] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 12:41:44] [INFO ] After 78ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-22 12:41:44] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 12:41:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-22 12:41:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1023 places, 3736 transitions and 18613 arcs took 25 ms.
[2023-03-22 12:41:44] [INFO ] Flatten gal took : 279 ms
Total runtime 110304 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MultiCrashLeafsetExtension-PT-S16C06
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityCardinality

FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679488906597

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 8 (type EXCL) for 0 MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-14
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 7 (type SRCH) for 0 MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 4 (type FNDP) for MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-14
lola: result : true
lola: fired transitions : 50
lola: tried executions : 2
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 5 (type EQUN) for MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 7 (type SRCH) for MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 8 (type EXCL) for MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-14 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
MultiCrashLeafsetExtension-PT-S16C06-ReachabilityCardinality-14: AG false findpath


Time elapsed: 1 secs. Pages in use: 2

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C06"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C06, 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 r231-tall-167856416600782"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C06.tgz
mv MultiCrashLeafsetExtension-PT-S16C06 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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;