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.r106-tall-167814483601087.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 marciexred
Input is DatabaseWithMutex-PT-20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483601087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 385K Feb 25 13:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Feb 25 13:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 259K Feb 25 13:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 13:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 129K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 389K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 226K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 827K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 538K Feb 25 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.2M Feb 25 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 635K Feb 25 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.0M Feb 25 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 39K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 91K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.7M 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 DatabaseWithMutex-PT-20-ReachabilityFireability-00
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-01
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-02
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-03
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-04
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-05
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-06
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-07
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-08
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-09
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-10
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-11
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-12
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-13
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-14
FORMULA_NAME DatabaseWithMutex-PT-20-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678533147313

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-PT-20
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 11:12:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 11:12:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 11:12:29] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2023-03-11 11:12:29] [INFO ] Transformed 3260 places.
[2023-03-11 11:12:29] [INFO ] Transformed 3200 transitions.
[2023-03-11 11:12:29] [INFO ] Parsed PT model containing 3260 places and 3200 transitions and 23200 arcs in 337 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 124 ms.
Working with output stream class java.io.PrintStream
[2023-03-11 11:12:29] [INFO ] Reduced 380 identical enabling conditions.
[2023-03-11 11:12:29] [INFO ] Reduced 380 identical enabling conditions.
[2023-03-11 11:12:29] [INFO ] Reduced 380 identical enabling conditions.
[2023-03-11 11:12:29] [INFO ] Reduced 380 identical enabling conditions.
[2023-03-11 11:12:29] [INFO ] Reduced 380 identical enabling conditions.
[2023-03-11 11:12:29] [INFO ] Reduced 380 identical enabling conditions.
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 681 ms. (steps per millisecond=14 ) properties (out of 15) seen :7
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3070 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 3200 rows 3260 cols
[2023-03-11 11:12:34] [INFO ] Computed 460 place invariants in 149 ms
[2023-03-11 11:12:39] [INFO ] [Real]Absence check using 78 positive place invariants in 37 ms returned sat
[2023-03-11 11:12:39] [INFO ] [Real]Absence check using 78 positive and 382 generalized place invariants in 292 ms returned sat
[2023-03-11 11:12:39] [INFO ] After 1842ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 11:12:40] [INFO ] [Nat]Absence check using 78 positive place invariants in 38 ms returned sat
[2023-03-11 11:12:40] [INFO ] [Nat]Absence check using 78 positive and 382 generalized place invariants in 284 ms returned sat
[2023-03-11 11:12:51] [INFO ] After 9487ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 11:13:00] [INFO ] After 18673ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 4508 ms.
[2023-03-11 11:13:04] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 5 properties in 667 ms.
Support contains 220 out of 3260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3260/3260 places, 3200/3200 transitions.
Drop transitions removed 505 transitions
Trivial Post-agglo rules discarded 505 transitions
Performed 505 trivial Post agglomeration. Transition count delta: 505
Iterating post reduction 0 with 505 rules applied. Total rules applied 505 place count 3260 transition count 2695
Reduce places removed 512 places and 0 transitions.
Drop transitions removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 1 with 734 rules applied. Total rules applied 1239 place count 2748 transition count 2473
Reduce places removed 222 places and 0 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Iterating post reduction 2 with 267 rules applied. Total rules applied 1506 place count 2526 transition count 2428
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 1551 place count 2481 transition count 2428
Performed 542 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 542 Pre rules applied. Total rules applied 1551 place count 2481 transition count 1886
Deduced a syphon composed of 542 places in 3 ms
Reduce places removed 542 places and 0 transitions.
Iterating global reduction 4 with 1084 rules applied. Total rules applied 2635 place count 1939 transition count 1886
Free-agglomeration rule applied 257 times.
Iterating global reduction 4 with 257 rules applied. Total rules applied 2892 place count 1939 transition count 1629
Reduce places removed 257 places and 0 transitions.
Iterating post reduction 4 with 257 rules applied. Total rules applied 3149 place count 1682 transition count 1629
Free-agglomeration rule (complex) applied 86 times.
Iterating global reduction 5 with 86 rules applied. Total rules applied 3235 place count 1682 transition count 1543
Reduce places removed 89 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 90 rules applied. Total rules applied 3325 place count 1593 transition count 1542
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3326 place count 1592 transition count 1542
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 55 Pre rules applied. Total rules applied 3326 place count 1592 transition count 1487
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 7 with 110 rules applied. Total rules applied 3436 place count 1537 transition count 1487
Applied a total of 3436 rules in 1018 ms. Remains 1537 /3260 variables (removed 1723) and now considering 1487/3200 (removed 1713) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1019 ms. Remains : 1537/3260 places, 1487/3200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :2
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-PT-20-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1487 rows 1537 cols
[2023-03-11 11:13:06] [INFO ] Computed 450 place invariants in 50 ms
[2023-03-11 11:13:07] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2023-03-11 11:13:07] [INFO ] [Real]Absence check using 50 positive and 400 generalized place invariants in 129 ms returned sat
[2023-03-11 11:13:07] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 11:13:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 17 ms returned sat
[2023-03-11 11:13:07] [INFO ] [Nat]Absence check using 50 positive and 400 generalized place invariants in 126 ms returned sat
[2023-03-11 11:13:08] [INFO ] After 996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 11:13:09] [INFO ] After 1291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-11 11:13:09] [INFO ] After 1808ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 198 out of 1537 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1537/1537 places, 1487/1487 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 1537 transition count 1467
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 1517 transition count 1467
Applied a total of 40 rules in 102 ms. Remains 1517 /1537 variables (removed 20) and now considering 1467/1487 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 1517/1537 places, 1467/1487 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 206886 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 206886 steps, saw 187301 distinct states, run finished after 3007 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1467 rows 1517 cols
[2023-03-11 11:13:12] [INFO ] Computed 450 place invariants in 37 ms
[2023-03-11 11:13:12] [INFO ] [Real]Absence check using 49 positive place invariants in 12 ms returned sat
[2023-03-11 11:13:13] [INFO ] [Real]Absence check using 49 positive and 401 generalized place invariants in 157 ms returned sat
[2023-03-11 11:13:13] [INFO ] After 398ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 11:13:13] [INFO ] [Nat]Absence check using 49 positive place invariants in 15 ms returned sat
[2023-03-11 11:13:13] [INFO ] [Nat]Absence check using 49 positive and 401 generalized place invariants in 145 ms returned sat
[2023-03-11 11:13:14] [INFO ] After 755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 11:13:14] [INFO ] After 892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-11 11:13:14] [INFO ] After 1359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 198 out of 1517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1517/1517 places, 1467/1467 transitions.
Applied a total of 0 rules in 82 ms. Remains 1517 /1517 variables (removed 0) and now considering 1467/1467 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 1517/1517 places, 1467/1467 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1517/1517 places, 1467/1467 transitions.
Applied a total of 0 rules in 79 ms. Remains 1517 /1517 variables (removed 0) and now considering 1467/1467 (removed 0) transitions.
[2023-03-11 11:13:14] [INFO ] Invariant cache hit.
[2023-03-11 11:13:19] [INFO ] Implicit Places using invariants in 5204 ms returned [1, 3, 5, 7, 8, 12, 14, 15, 18, 21, 22, 24, 25, 27, 35, 39, 40, 43, 44, 45, 48, 54, 55, 56, 58, 59, 63, 64, 66, 69, 74, 76, 89, 90, 93, 95, 97, 103, 104, 107, 110, 111, 116, 118, 120, 128, 130, 131, 135, 136, 145, 146, 147, 149, 152, 153, 156, 163, 165, 169, 171, 176, 178, 179, 192, 193, 194, 196, 197, 199, 201, 203, 208, 209, 210, 222, 226, 231, 232, 233, 238, 240, 243, 245, 248, 249, 253, 263, 264, 267, 271, 274, 276, 278, 279, 280, 281, 282, 283, 285, 287, 294, 298, 300, 303, 306, 308, 318, 319, 322, 324, 325, 333, 337, 339, 341, 342, 343, 346, 347, 350, 354, 355, 361, 362, 363, 364, 367, 373, 383, 387, 389, 392, 394, 398, 399, 400, 402, 409, 412, 415, 416, 419, 420, 424, 429, 434, 437, 439, 442, 444, 448, 449, 451, 454, 457, 458, 460, 461, 462, 472, 476, 478, 479, 487, 494, 498, 504, 507, 508, 509, 510, 513, 517, 518, 519, 524, 525, 526, 528, 530, 531, 533, 534, 536, 542, 543, 544, 545, 548, 549, 552, 554, 556, 557, 558, 563, 566, 571, 574, 575, 578, 579, 581, 588, 593, 594, 596, 598, 600, 601, 604, 608, 611, 616, 618, 619, 621, 624, 625, 626, 628, 630, 633, 634, 636, 640, 642, 643, 644, 645, 649, 650, 651, 652, 656, 657, 658, 665, 666, 669, 675, 677, 678, 683, 687, 691, 694, 699, 701, 702, 705, 709, 711, 712, 714, 717, 720, 721, 723, 725, 727, 729, 735, 736, 739, 742, 745, 747, 752, 754, 755, 762, 764, 766, 767, 768, 769, 770, 771, 776, 778, 780, 781, 784, 785, 786, 788, 789, 791, 792, 799, 800, 802, 810, 812, 813, 815, 816, 819, 820, 823, 825, 829, 830, 831, 835, 836, 837, 844, 845, 849, 850, 853, 854, 859, 860, 862, 865, 871, 876, 879, 882, 883, 887, 889, 890, 891, 897, 901, 905, 906, 907, 908, 911, 912, 916, 917, 919, 922, 924, 927, 933, 940, 942, 945, 948, 955, 956, 959, 960, 965, 966, 969, 972, 974, 977, 978, 983, 984, 991, 992, 993, 997, 998, 1004, 1005, 1006, 1013, 1016, 1018, 1019, 1023, 1025, 1028, 1032, 1034, 1036, 1037, 1044, 1047, 1050, 1056, 1058, 1061, 1062, 1063, 1070, 1072, 1076, 1084, 1089, 1094, 1095, 1103, 1105, 1107, 1108, 1110, 1111, 1112, 1121, 1124, 1126, 1128, 1134, 1137, 1138, 1139, 1141, 1143, 1147, 1148, 1151, 1153, 1158, 1162, 1167, 1169, 1175, 1185, 1189, 1190, 1193, 1198, 1203, 1204, 1207, 1212, 1214, 1217, 1219, 1224, 1229, 1230, 1233, 1242, 1246, 1248, 1250, 1251, 1261, 1267, 1268, 1270, 1273, 1276, 1278, 1280, 1281, 1284, 1289, 1296, 1297, 1299, 1301, 1303, 1307, 1312, 1318, 1319, 1320, 1324, 1325, 1326, 1333, 1340, 1343, 1345, 1346, 1347, 1350, 1357, 1367, 1370, 1373, 1375, 1377, 1378, 1379, 1381, 1382, 1384, 1392, 1395, 1400, 1403, 1406, 1407, 1409, 1413, 1414, 1420, 1423, 1425, 1429, 1432, 1433, 1435, 1436, 1437, 1440, 1441, 1448, 1452, 1453, 1455, 1456, 1457, 1462, 1464, 1471, 1474, 1476, 1478, 1489, 1491, 1496, 1499, 1503, 1507, 1508, 1511, 1512]
Discarding 524 places :
Implicit Place search using SMT only with invariants took 5216 ms to find 524 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 993/1517 places, 1467/1467 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 943 transition count 1417
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 943 transition count 1417
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 105 place count 938 transition count 1412
Iterating global reduction 0 with 5 rules applied. Total rules applied 110 place count 938 transition count 1412
Applied a total of 110 rules in 169 ms. Remains 938 /993 variables (removed 55) and now considering 1412/1467 (removed 55) transitions.
// Phase 1: matrix 1412 rows 938 cols
[2023-03-11 11:13:20] [INFO ] Computed 32 place invariants in 56 ms
[2023-03-11 11:13:20] [INFO ] Implicit Places using invariants in 509 ms returned []
[2023-03-11 11:13:20] [INFO ] Invariant cache hit.
[2023-03-11 11:13:23] [INFO ] Implicit Places using invariants and state equation in 3275 ms returned []
Implicit Place search using SMT with State Equation took 3790 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 938/1517 places, 1412/1467 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9255 ms. Remains : 938/1517 places, 1412/1467 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 317616 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 317616 steps, saw 296608 distinct states, run finished after 3002 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 11:13:27] [INFO ] Invariant cache hit.
[2023-03-11 11:13:27] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 11:13:27] [INFO ] [Real]Absence check using 15 positive and 17 generalized place invariants in 27 ms returned sat
[2023-03-11 11:13:27] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 11:13:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 11:13:27] [INFO ] [Nat]Absence check using 15 positive and 17 generalized place invariants in 27 ms returned sat
[2023-03-11 11:13:28] [INFO ] After 893ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 11:13:28] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2023-03-11 11:13:28] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2023-03-11 11:13:28] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2023-03-11 11:13:29] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2023-03-11 11:13:29] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2023-03-11 11:13:29] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 0 ms to minimize.
[2023-03-11 11:13:29] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 0 ms to minimize.
[2023-03-11 11:13:29] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 0 ms to minimize.
[2023-03-11 11:13:29] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2023-03-11 11:13:30] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2023-03-11 11:13:30] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 1 ms to minimize.
[2023-03-11 11:13:30] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2023-03-11 11:13:30] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 1 ms to minimize.
[2023-03-11 11:13:30] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2023-03-11 11:13:30] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 1 ms to minimize.
[2023-03-11 11:13:30] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 0 ms to minimize.
[2023-03-11 11:13:31] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2023-03-11 11:13:31] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-11 11:13:31] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 1 ms to minimize.
[2023-03-11 11:13:31] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 0 ms to minimize.
[2023-03-11 11:13:31] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2023-03-11 11:13:31] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 1 ms to minimize.
[2023-03-11 11:13:32] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2023-03-11 11:13:32] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 0 ms to minimize.
[2023-03-11 11:13:32] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 0 ms to minimize.
[2023-03-11 11:13:32] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-11 11:13:33] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2023-03-11 11:13:33] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-11 11:13:33] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 0 ms to minimize.
[2023-03-11 11:13:33] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2023-03-11 11:13:33] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2023-03-11 11:13:33] [INFO ] Deduced a trap composed of 6 places in 92 ms of which 0 ms to minimize.
[2023-03-11 11:13:33] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 0 ms to minimize.
[2023-03-11 11:13:34] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 0 ms to minimize.
[2023-03-11 11:13:34] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2023-03-11 11:13:34] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 0 ms to minimize.
[2023-03-11 11:13:34] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2023-03-11 11:13:34] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2023-03-11 11:13:34] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2023-03-11 11:13:34] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2023-03-11 11:13:35] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2023-03-11 11:13:35] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2023-03-11 11:13:35] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
[2023-03-11 11:13:35] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2023-03-11 11:13:35] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2023-03-11 11:13:35] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 0 ms to minimize.
[2023-03-11 11:13:35] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 0 ms to minimize.
[2023-03-11 11:13:36] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2023-03-11 11:13:36] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2023-03-11 11:13:36] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 3 ms to minimize.
[2023-03-11 11:13:36] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 7832 ms
[2023-03-11 11:13:36] [INFO ] After 8867ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-11 11:13:36] [INFO ] After 9199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 25 ms.
Support contains 198 out of 938 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 938/938 places, 1412/1412 transitions.
Applied a total of 0 rules in 44 ms. Remains 938 /938 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 938/938 places, 1412/1412 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 938/938 places, 1412/1412 transitions.
Applied a total of 0 rules in 45 ms. Remains 938 /938 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
[2023-03-11 11:13:36] [INFO ] Invariant cache hit.
[2023-03-11 11:13:37] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-11 11:13:37] [INFO ] Invariant cache hit.
[2023-03-11 11:13:40] [INFO ] Implicit Places using invariants and state equation in 3365 ms returned []
Implicit Place search using SMT with State Equation took 3817 ms to find 0 implicit places.
[2023-03-11 11:13:40] [INFO ] Redundant transitions in 98 ms returned []
[2023-03-11 11:13:40] [INFO ] Invariant cache hit.
[2023-03-11 11:13:41] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4619 ms. Remains : 938/938 places, 1412/1412 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 938 transition count 1411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 937 transition count 1411
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 91 Pre rules applied. Total rules applied 2 place count 937 transition count 1320
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 184 place count 846 transition count 1320
Applied a total of 184 rules in 82 ms. Remains 846 /938 variables (removed 92) and now considering 1320/1412 (removed 92) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1320 rows 846 cols
[2023-03-11 11:13:41] [INFO ] Computed 32 place invariants in 46 ms
[2023-03-11 11:13:41] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-11 11:13:41] [INFO ] [Real]Absence check using 14 positive and 18 generalized place invariants in 27 ms returned sat
[2023-03-11 11:13:41] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 11:13:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-11 11:13:41] [INFO ] [Nat]Absence check using 14 positive and 18 generalized place invariants in 30 ms returned sat
[2023-03-11 11:13:42] [INFO ] After 962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 11:13:42] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-03-11 11:13:43] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2023-03-11 11:13:43] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2023-03-11 11:13:43] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-03-11 11:13:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 609 ms
[2023-03-11 11:13:43] [INFO ] After 1619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-11 11:13:43] [INFO ] After 1882ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-11 11:13:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-11 11:13:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 938 places, 1412 transitions and 12964 arcs took 16 ms.
[2023-03-11 11:13:43] [INFO ] Flatten gal took : 257 ms
Total runtime 75240 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DatabaseWithMutex_PT_20
(NrP: 938 NrTr: 1412 NrArc: 12964)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.287sec

net check time: 0m 0.001sec

init dd package: 0m 2.713sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9785320 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16083616 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.020sec

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="DatabaseWithMutex-PT-20"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is DatabaseWithMutex-PT-20, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-tall-167814483601087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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