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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6289.508 3600000.00 3664225.00 8747.80 TTFF?FT?????T??? 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.r234-tall-167856420800761.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 MultiCrashLeafsetExtension-PT-S16C04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420800761
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 11K Feb 26 02:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 02:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 02:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 26 02:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 02:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 02:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 4.1M 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-S16C04-CTLCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679587235945

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 16:00:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-23 16:00:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 16:00:37] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2023-03-23 16:00:37] [INFO ] Transformed 4260 places.
[2023-03-23 16:00:37] [INFO ] Transformed 6027 transitions.
[2023-03-23 16:00:37] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 331 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
Support contains 126 out of 4260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 4233 transition count 6027
Discarding 1053 places :
Symmetric choice reduction at 1 with 1053 rule applications. Total rules 1080 place count 3180 transition count 4974
Iterating global reduction 1 with 1053 rules applied. Total rules applied 2133 place count 3180 transition count 4974
Discarding 886 places :
Symmetric choice reduction at 1 with 886 rule applications. Total rules 3019 place count 2294 transition count 4088
Iterating global reduction 1 with 886 rules applied. Total rules applied 3905 place count 2294 transition count 4088
Discarding 167 places :
Symmetric choice reduction at 1 with 167 rule applications. Total rules 4072 place count 2127 transition count 3420
Iterating global reduction 1 with 167 rules applied. Total rules applied 4239 place count 2127 transition count 3420
Applied a total of 4239 rules in 902 ms. Remains 2127 /4260 variables (removed 2133) and now considering 3420/6027 (removed 2607) transitions.
[2023-03-23 16:00:38] [INFO ] Flow matrix only has 3148 transitions (discarded 272 similar events)
// Phase 1: matrix 3148 rows 2127 cols
[2023-03-23 16:00:39] [INFO ] Computed 470 place invariants in 151 ms
[2023-03-23 16:00:41] [INFO ] Implicit Places using invariants in 2959 ms returned [4, 8, 12, 14, 20, 28, 37, 46, 57, 70, 87, 103, 121, 125, 127, 143, 155, 164, 171, 176, 179, 198, 206, 209, 210, 213, 219, 224, 231, 242, 255, 268, 282, 296, 297, 298, 300, 311, 320, 335, 338, 340, 359, 366, 369, 370, 371, 372, 373, 375, 378, 383, 391, 400, 411, 424, 436, 438, 440, 451, 458, 463, 466, 470, 472, 491, 498, 501, 502, 504, 505, 507, 509, 512, 524, 533, 545, 555, 557, 559, 568, 573, 576, 580, 582, 603, 610, 613, 614, 618, 622, 627, 630, 633, 638, 647, 655, 663, 664, 666, 667, 672, 675, 680, 685, 687, 689, 708, 715, 718, 719, 722, 723, 727, 729, 731, 734, 737, 748, 754, 756, 758, 761, 769, 771, 773, 775, 796, 803, 806, 807, 810, 814, 816, 818, 820, 824, 827, 831, 835, 836, 838, 839, 841, 843, 845, 850, 854, 856, 875, 882, 885, 887, 889, 894, 896, 900, 902, 907, 909, 912, 914, 916, 920, 922, 926, 928, 930, 932, 951, 953, 957, 961, 962, 963, 964, 968, 970, 977, 979, 981, 984, 986, 987, 988, 990, 995, 997, 999, 1001, 1003, 1022, 1029, 1032, 1034, 1035, 1036, 1038, 1040, 1044, 1048, 1050, 1052, 1054, 1058, 1061, 1068, 1073, 1075, 1077, 1079, 1100, 1107, 1111, 1112, 1113, 1114, 1116, 1118, 1122, 1124, 1126, 1128, 1136, 1138, 1139, 1140, 1143, 1145, 1147, 1149, 1154, 1156, 1175, 1182, 1185, 1189, 1193, 1195, 1197, 1199, 1201, 1204, 1213, 1220, 1222, 1223, 1224, 1229, 1232, 1235, 1237, 1241, 1243, 1262, 1269, 1274, 1275, 1276, 1278, 1280, 1282, 1287, 1290, 1297, 1306, 1315, 1319, 1331, 1336, 1341, 1343, 1345, 1348, 1367, 1374, 1377, 1380, 1381, 1383, 1388, 1390, 1393, 1401, 1408, 1417, 1428, 1429, 1430, 1431, 1432, 1441, 1448, 1453, 1457, 1459, 1461, 1480, 1487, 1490, 1491, 1493, 1494, 1498, 1500, 1503, 1508, 1515, 1524, 1535, 1549, 1550, 1553, 1566, 1575, 1582, 1590, 1593, 1597, 1619, 1626, 1629, 1630, 1631, 1632, 1635, 1638, 1643, 1650, 1659, 1670, 1683, 1699, 1702, 1717, 1730, 1741, 1748, 1756, 1759, 1778, 1780, 1784, 1787, 1788, 1794, 1799, 1806, 1817, 1831, 1844, 1859, 1877, 1878, 1880, 1895, 1908, 1922, 1934, 1941, 1946, 1966]
Discarding 362 places :
Implicit Place search using SMT only with invariants took 3012 ms to find 362 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1765/4260 places, 3420/6027 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 1693 transition count 3348
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 1693 transition count 3348
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 212 place count 1625 transition count 3280
Iterating global reduction 0 with 68 rules applied. Total rules applied 280 place count 1625 transition count 3280
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 346 place count 1559 transition count 3214
Iterating global reduction 0 with 66 rules applied. Total rules applied 412 place count 1559 transition count 3214
Applied a total of 412 rules in 168 ms. Remains 1559 /1765 variables (removed 206) and now considering 3214/3420 (removed 206) transitions.
[2023-03-23 16:00:42] [INFO ] Flow matrix only has 2942 transitions (discarded 272 similar events)
// Phase 1: matrix 2942 rows 1559 cols
[2023-03-23 16:00:42] [INFO ] Computed 108 place invariants in 75 ms
[2023-03-23 16:00:43] [INFO ] Implicit Places using invariants in 1287 ms returned []
[2023-03-23 16:00:43] [INFO ] Flow matrix only has 2942 transitions (discarded 272 similar events)
[2023-03-23 16:00:43] [INFO ] Invariant cache hit.
[2023-03-23 16:00:44] [INFO ] State equation strengthened by 1133 read => feed constraints.
[2023-03-23 16:01:04] [INFO ] Implicit Places using invariants and state equation in 20697 ms returned []
Implicit Place search using SMT with State Equation took 21985 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1559/4260 places, 3214/6027 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26068 ms. Remains : 1559/4260 places, 3214/6027 transitions.
Support contains 126 out of 1559 places after structural reductions.
[2023-03-23 16:01:04] [INFO ] Flatten gal took : 302 ms
[2023-03-23 16:01:04] [INFO ] Flatten gal took : 125 ms
[2023-03-23 16:01:04] [INFO ] Input system was already deterministic with 3214 transitions.
Incomplete random walk after 10000 steps, including 238 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 74) seen :17
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 57) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 56) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 55) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 55) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 54) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 53) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 52) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 52) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 51) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 50) seen :0
Running SMT prover for 50 properties.
[2023-03-23 16:01:06] [INFO ] Flow matrix only has 2942 transitions (discarded 272 similar events)
[2023-03-23 16:01:06] [INFO ] Invariant cache hit.
[2023-03-23 16:01:07] [INFO ] [Real]Absence check using 31 positive place invariants in 22 ms returned sat
[2023-03-23 16:01:07] [INFO ] [Real]Absence check using 31 positive and 77 generalized place invariants in 31 ms returned sat
[2023-03-23 16:01:07] [INFO ] After 1606ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:48
[2023-03-23 16:01:09] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 16:01:09] [INFO ] [Nat]Absence check using 31 positive and 77 generalized place invariants in 25 ms returned sat
[2023-03-23 16:01:12] [INFO ] After 2592ms SMT Verify possible using state equation in natural domain returned unsat :39 sat :11
[2023-03-23 16:01:12] [INFO ] State equation strengthened by 1133 read => feed constraints.
[2023-03-23 16:01:14] [INFO ] After 2541ms SMT Verify possible using 1133 Read/Feed constraints in natural domain returned unsat :42 sat :8
[2023-03-23 16:01:16] [INFO ] Deduced a trap composed of 410 places in 892 ms of which 10 ms to minimize.
[2023-03-23 16:01:17] [INFO ] Deduced a trap composed of 338 places in 815 ms of which 2 ms to minimize.
[2023-03-23 16:01:18] [INFO ] Deduced a trap composed of 329 places in 791 ms of which 2 ms to minimize.
[2023-03-23 16:01:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2857 ms
[2023-03-23 16:01:19] [INFO ] Deduced a trap composed of 351 places in 680 ms of which 2 ms to minimize.
[2023-03-23 16:01:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 915 ms
[2023-03-23 16:01:21] [INFO ] Deduced a trap composed of 250 places in 656 ms of which 2 ms to minimize.
[2023-03-23 16:01:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 885 ms
[2023-03-23 16:01:21] [INFO ] After 9710ms SMT Verify possible using trap constraints in natural domain returned unsat :42 sat :8
Attempting to minimize the solution found.
Minimization took 2061 ms.
[2023-03-23 16:01:23] [INFO ] After 15980ms SMT Verify possible using all constraints in natural domain returned unsat :42 sat :8
Fused 50 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 13 out of 1559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1559/1559 places, 3214/3214 transitions.
Graph (complete) has 6673 edges and 1559 vertex of which 1558 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 1558 transition count 3182
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 65 place count 1526 transition count 3182
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 65 place count 1526 transition count 3126
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 177 place count 1470 transition count 3126
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 227 place count 1420 transition count 3058
Iterating global reduction 2 with 50 rules applied. Total rules applied 277 place count 1420 transition count 3058
Discarding 41 places :
Symmetric choice reduction at 2 with 41 rule applications. Total rules 318 place count 1379 transition count 2912
Iterating global reduction 2 with 41 rules applied. Total rules applied 359 place count 1379 transition count 2912
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 360 place count 1378 transition count 2908
Iterating global reduction 2 with 1 rules applied. Total rules applied 361 place count 1378 transition count 2908
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 4 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 427 place count 1345 transition count 2875
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 450 place count 1322 transition count 2852
Iterating global reduction 2 with 23 rules applied. Total rules applied 473 place count 1322 transition count 2852
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 495 place count 1300 transition count 2764
Iterating global reduction 2 with 22 rules applied. Total rules applied 517 place count 1300 transition count 2764
Free-agglomeration rule (complex) applied 166 times.
Iterating global reduction 2 with 166 rules applied. Total rules applied 683 place count 1300 transition count 3249
Reduce places removed 166 places and 0 transitions.
Iterating post reduction 2 with 166 rules applied. Total rules applied 849 place count 1134 transition count 3249
Partial Free-agglomeration rule applied 53 times.
Drop transitions removed 53 transitions
Iterating global reduction 3 with 53 rules applied. Total rules applied 902 place count 1134 transition count 3249
Applied a total of 902 rules in 951 ms. Remains 1134 /1559 variables (removed 425) and now considering 3249/3214 (removed -35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 952 ms. Remains : 1134/1559 places, 3249/3214 transitions.
Incomplete random walk after 10000 steps, including 421 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-23 16:01:25] [INFO ] Flow matrix only has 2852 transitions (discarded 397 similar events)
// Phase 1: matrix 2852 rows 1134 cols
[2023-03-23 16:01:25] [INFO ] Computed 107 place invariants in 48 ms
[2023-03-23 16:01:25] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-23 16:01:25] [INFO ] [Nat]Absence check using 32 positive place invariants in 20 ms returned sat
[2023-03-23 16:01:25] [INFO ] [Nat]Absence check using 32 positive and 75 generalized place invariants in 11 ms returned sat
[2023-03-23 16:01:27] [INFO ] After 1367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-23 16:01:27] [INFO ] State equation strengthened by 1592 read => feed constraints.
[2023-03-23 16:01:29] [INFO ] After 2294ms SMT Verify possible using 1592 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-23 16:01:30] [INFO ] Deduced a trap composed of 99 places in 519 ms of which 1 ms to minimize.
[2023-03-23 16:01:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 717 ms
[2023-03-23 16:01:31] [INFO ] Deduced a trap composed of 162 places in 497 ms of which 2 ms to minimize.
[2023-03-23 16:01:32] [INFO ] Deduced a trap composed of 141 places in 549 ms of which 1 ms to minimize.
[2023-03-23 16:01:32] [INFO ] Deduced a trap composed of 159 places in 563 ms of which 1 ms to minimize.
[2023-03-23 16:01:33] [INFO ] Deduced a trap composed of 130 places in 563 ms of which 1 ms to minimize.
[2023-03-23 16:01:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2546 ms
[2023-03-23 16:01:34] [INFO ] Deduced a trap composed of 140 places in 515 ms of which 1 ms to minimize.
[2023-03-23 16:01:35] [INFO ] Deduced a trap composed of 158 places in 511 ms of which 1 ms to minimize.
[2023-03-23 16:01:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1261 ms
[2023-03-23 16:01:36] [INFO ] Deduced a trap composed of 101 places in 491 ms of which 1 ms to minimize.
[2023-03-23 16:01:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 630 ms
[2023-03-23 16:01:37] [INFO ] Deduced a trap composed of 177 places in 466 ms of which 1 ms to minimize.
[2023-03-23 16:01:37] [INFO ] Deduced a trap composed of 100 places in 489 ms of which 2 ms to minimize.
[2023-03-23 16:01:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1202 ms
[2023-03-23 16:01:37] [INFO ] After 10474ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1723 ms.
[2023-03-23 16:01:39] [INFO ] After 13937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 13 ms.
Support contains 11 out of 1134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1134/1134 places, 3249/3249 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1134 transition count 3248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1133 transition count 3248
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1133 transition count 3248
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 1132 transition count 3247
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1132 transition count 3247
Applied a total of 5 rules in 191 ms. Remains 1132 /1134 variables (removed 2) and now considering 3247/3249 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 1132/1134 places, 3247/3249 transitions.
Incomplete random walk after 10000 steps, including 421 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-23 16:01:40] [INFO ] Flow matrix only has 2850 transitions (discarded 397 similar events)
// Phase 1: matrix 2850 rows 1132 cols
[2023-03-23 16:01:40] [INFO ] Computed 107 place invariants in 28 ms
[2023-03-23 16:01:40] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-23 16:01:40] [INFO ] [Nat]Absence check using 32 positive place invariants in 19 ms returned sat
[2023-03-23 16:01:40] [INFO ] [Nat]Absence check using 32 positive and 75 generalized place invariants in 13 ms returned sat
[2023-03-23 16:01:41] [INFO ] After 1163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-23 16:01:41] [INFO ] State equation strengthened by 1592 read => feed constraints.
[2023-03-23 16:01:44] [INFO ] After 2633ms SMT Verify possible using 1592 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-23 16:01:46] [INFO ] Deduced a trap composed of 183 places in 485 ms of which 1 ms to minimize.
[2023-03-23 16:01:47] [INFO ] Deduced a trap composed of 111 places in 546 ms of which 1 ms to minimize.
[2023-03-23 16:01:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1247 ms
[2023-03-23 16:01:48] [INFO ] Deduced a trap composed of 175 places in 466 ms of which 1 ms to minimize.
[2023-03-23 16:01:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 713 ms
[2023-03-23 16:01:49] [INFO ] Deduced a trap composed of 100 places in 496 ms of which 1 ms to minimize.
[2023-03-23 16:01:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 647 ms
[2023-03-23 16:01:50] [INFO ] After 8302ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2206 ms.
[2023-03-23 16:01:52] [INFO ] After 12017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 18 ms.
Support contains 9 out of 1132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1132/1132 places, 3247/3247 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1132 transition count 3267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1131 transition count 3267
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1131 transition count 3267
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 1130 transition count 3266
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1130 transition count 3266
Applied a total of 5 rules in 277 ms. Remains 1130 /1132 variables (removed 2) and now considering 3266/3247 (removed -19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 1130/1132 places, 3266/3247 transitions.
Incomplete random walk after 10000 steps, including 421 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-23 16:01:53] [INFO ] Flow matrix only has 2869 transitions (discarded 397 similar events)
// Phase 1: matrix 2869 rows 1130 cols
[2023-03-23 16:01:53] [INFO ] Computed 107 place invariants in 43 ms
[2023-03-23 16:01:53] [INFO ] After 265ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-23 16:01:53] [INFO ] [Nat]Absence check using 32 positive place invariants in 23 ms returned sat
[2023-03-23 16:01:53] [INFO ] [Nat]Absence check using 32 positive and 75 generalized place invariants in 13 ms returned sat
[2023-03-23 16:01:54] [INFO ] After 1228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-23 16:01:55] [INFO ] State equation strengthened by 1613 read => feed constraints.
[2023-03-23 16:01:58] [INFO ] After 3206ms SMT Verify possible using 1613 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-23 16:01:59] [INFO ] Deduced a trap composed of 181 places in 465 ms of which 1 ms to minimize.
[2023-03-23 16:02:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 710 ms
[2023-03-23 16:02:01] [INFO ] Deduced a trap composed of 152 places in 451 ms of which 1 ms to minimize.
[2023-03-23 16:02:02] [INFO ] Deduced a trap composed of 185 places in 452 ms of which 1 ms to minimize.
[2023-03-23 16:02:02] [INFO ] Deduced a trap composed of 91 places in 483 ms of which 1 ms to minimize.
[2023-03-23 16:02:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2278 ms
[2023-03-23 16:02:03] [INFO ] After 8177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1571 ms.
[2023-03-23 16:02:04] [INFO ] After 11271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 4 ms.
Support contains 7 out of 1130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1130/1130 places, 3266/3266 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1130 transition count 3265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1129 transition count 3265
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 1129 transition count 3265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 1128 transition count 3264
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 1128 transition count 3264
Applied a total of 5 rules in 244 ms. Remains 1128 /1130 variables (removed 2) and now considering 3264/3266 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 1128/1130 places, 3264/3266 transitions.
Incomplete random walk after 10000 steps, including 424 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-23 16:02:05] [INFO ] Flow matrix only has 2867 transitions (discarded 397 similar events)
// Phase 1: matrix 2867 rows 1128 cols
[2023-03-23 16:02:05] [INFO ] Computed 107 place invariants in 28 ms
[2023-03-23 16:02:05] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 16:02:05] [INFO ] [Nat]Absence check using 32 positive place invariants in 20 ms returned sat
[2023-03-23 16:02:05] [INFO ] [Nat]Absence check using 32 positive and 75 generalized place invariants in 12 ms returned sat
[2023-03-23 16:02:06] [INFO ] After 995ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 16:02:06] [INFO ] State equation strengthened by 1613 read => feed constraints.
[2023-03-23 16:02:09] [INFO ] After 2929ms SMT Verify possible using 1613 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 16:02:10] [INFO ] Deduced a trap composed of 164 places in 488 ms of which 1 ms to minimize.
[2023-03-23 16:02:11] [INFO ] Deduced a trap composed of 137 places in 549 ms of which 1 ms to minimize.
[2023-03-23 16:02:11] [INFO ] Deduced a trap composed of 122 places in 556 ms of which 1 ms to minimize.
[2023-03-23 16:02:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1879 ms
[2023-03-23 16:02:12] [INFO ] Deduced a trap composed of 155 places in 493 ms of which 3 ms to minimize.
[2023-03-23 16:02:13] [INFO ] Deduced a trap composed of 116 places in 512 ms of which 1 ms to minimize.
[2023-03-23 16:02:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1266 ms
[2023-03-23 16:02:13] [INFO ] After 7109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1249 ms.
[2023-03-23 16:02:15] [INFO ] After 9615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 1128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1128/1128 places, 3264/3264 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1128 transition count 3263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1127 transition count 3263
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 1127 transition count 3283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 1126 transition count 3283
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 5 place count 1126 transition count 3283
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 6 place count 1125 transition count 3282
Iterating global reduction 3 with 1 rules applied. Total rules applied 7 place count 1125 transition count 3282
Applied a total of 7 rules in 253 ms. Remains 1125 /1128 variables (removed 3) and now considering 3282/3264 (removed -18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 1125/1128 places, 3282/3264 transitions.
Incomplete random walk after 10000 steps, including 425 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 16:02:15] [INFO ] Flow matrix only has 2885 transitions (discarded 397 similar events)
// Phase 1: matrix 2885 rows 1125 cols
[2023-03-23 16:02:15] [INFO ] Computed 107 place invariants in 23 ms
[2023-03-23 16:02:15] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 16:02:16] [INFO ] [Nat]Absence check using 32 positive place invariants in 21 ms returned sat
[2023-03-23 16:02:16] [INFO ] [Nat]Absence check using 32 positive and 75 generalized place invariants in 13 ms returned sat
[2023-03-23 16:02:16] [INFO ] After 877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 16:02:16] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 16:02:18] [INFO ] After 1522ms SMT Verify possible using 1634 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-23 16:02:19] [INFO ] Deduced a trap composed of 163 places in 488 ms of which 2 ms to minimize.
[2023-03-23 16:02:20] [INFO ] Deduced a trap composed of 107 places in 545 ms of which 5 ms to minimize.
[2023-03-23 16:02:20] [INFO ] Deduced a trap composed of 80 places in 549 ms of which 1 ms to minimize.
[2023-03-23 16:02:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1886 ms
[2023-03-23 16:02:21] [INFO ] Deduced a trap composed of 111 places in 490 ms of which 1 ms to minimize.
[2023-03-23 16:02:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 747 ms
[2023-03-23 16:02:22] [INFO ] After 5190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1011 ms.
[2023-03-23 16:02:23] [INFO ] After 7308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 1125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1125/1125 places, 3282/3282 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1125 transition count 3282
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 1124 transition count 3281
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1124 transition count 3281
Applied a total of 3 rules in 162 ms. Remains 1124 /1125 variables (removed 1) and now considering 3281/3282 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 1124/1125 places, 3281/3282 transitions.
Incomplete random walk after 10000 steps, including 425 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 73561 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 73561 steps, saw 31815 distinct states, run finished after 3003 ms. (steps per millisecond=24 ) properties seen :2
Running SMT prover for 1 properties.
[2023-03-23 16:02:26] [INFO ] Flow matrix only has 2884 transitions (discarded 397 similar events)
// Phase 1: matrix 2884 rows 1124 cols
[2023-03-23 16:02:26] [INFO ] Computed 107 place invariants in 32 ms
[2023-03-23 16:02:26] [INFO ] [Real]Absence check using 32 positive place invariants in 20 ms returned sat
[2023-03-23 16:02:26] [INFO ] [Real]Absence check using 32 positive and 75 generalized place invariants in 12 ms returned sat
[2023-03-23 16:02:27] [INFO ] After 708ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-23 16:02:27] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 16:02:27] [INFO ] After 199ms SMT Verify possible using 1634 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 16:02:27] [INFO ] After 1083ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 16:02:27] [INFO ] [Nat]Absence check using 32 positive place invariants in 21 ms returned sat
[2023-03-23 16:02:27] [INFO ] [Nat]Absence check using 32 positive and 75 generalized place invariants in 11 ms returned sat
[2023-03-23 16:02:28] [INFO ] After 688ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 16:02:30] [INFO ] After 1632ms SMT Verify possible using 1634 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 16:02:30] [INFO ] Deduced a trap composed of 165 places in 478 ms of which 1 ms to minimize.
[2023-03-23 16:02:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 628 ms
[2023-03-23 16:02:30] [INFO ] After 2326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-23 16:02:30] [INFO ] After 3255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 1124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1124/1124 places, 3281/3281 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1124 transition count 3280
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1123 transition count 3280
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 1123 transition count 3280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 1121 transition count 3278
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 1121 transition count 3278
Applied a total of 9 rules in 179 ms. Remains 1121 /1124 variables (removed 3) and now considering 3278/3281 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 1121/1124 places, 3278/3281 transitions.
Incomplete random walk after 10000 steps, including 427 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 78202 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78202 steps, saw 33781 distinct states, run finished after 3002 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-23 16:02:34] [INFO ] Flow matrix only has 2881 transitions (discarded 397 similar events)
// Phase 1: matrix 2881 rows 1121 cols
[2023-03-23 16:02:34] [INFO ] Computed 107 place invariants in 33 ms
[2023-03-23 16:02:34] [INFO ] [Real]Absence check using 32 positive place invariants in 36 ms returned sat
[2023-03-23 16:02:34] [INFO ] [Real]Absence check using 32 positive and 75 generalized place invariants in 11 ms returned sat
[2023-03-23 16:02:35] [INFO ] After 827ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-23 16:02:35] [INFO ] [Nat]Absence check using 32 positive place invariants in 19 ms returned sat
[2023-03-23 16:02:35] [INFO ] [Nat]Absence check using 32 positive and 75 generalized place invariants in 12 ms returned sat
[2023-03-23 16:02:35] [INFO ] After 674ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-23 16:02:36] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 16:02:37] [INFO ] After 1154ms SMT Verify possible using 1634 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-23 16:02:37] [INFO ] Deduced a trap composed of 110 places in 538 ms of which 1 ms to minimize.
[2023-03-23 16:02:38] [INFO ] Deduced a trap composed of 173 places in 477 ms of which 1 ms to minimize.
[2023-03-23 16:02:38] [INFO ] Deduced a trap composed of 112 places in 556 ms of which 1 ms to minimize.
[2023-03-23 16:02:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1862 ms
[2023-03-23 16:02:39] [INFO ] After 3080ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-23 16:02:39] [INFO ] After 4007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1121/1121 places, 3278/3278 transitions.
Applied a total of 0 rules in 79 ms. Remains 1121 /1121 variables (removed 0) and now considering 3278/3278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 1121/1121 places, 3278/3278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1121/1121 places, 3278/3278 transitions.
Applied a total of 0 rules in 74 ms. Remains 1121 /1121 variables (removed 0) and now considering 3278/3278 (removed 0) transitions.
[2023-03-23 16:02:39] [INFO ] Flow matrix only has 2881 transitions (discarded 397 similar events)
[2023-03-23 16:02:39] [INFO ] Invariant cache hit.
[2023-03-23 16:02:40] [INFO ] Implicit Places using invariants in 1159 ms returned [7, 8, 84, 85, 137, 138, 198, 220, 284, 285, 316, 323, 351, 352, 365, 377, 378, 402, 422, 431, 439, 440, 443, 459, 460, 470, 488, 489, 493, 499, 500, 517, 521, 523, 528, 544, 553, 554, 555, 557, 575, 583, 586, 603, 604, 605, 619, 640, 641, 661, 662, 663, 689, 690, 746, 784, 785, 823, 874, 875, 876, 922, 923, 924, 988, 989]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 1163 ms to find 66 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1055/1121 places, 3278/3278 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 1009 transition count 3232
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 1009 transition count 3232
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 138 place count 963 transition count 3186
Iterating global reduction 0 with 46 rules applied. Total rules applied 184 place count 963 transition count 3186
Applied a total of 184 rules in 110 ms. Remains 963 /1055 variables (removed 92) and now considering 3186/3278 (removed 92) transitions.
[2023-03-23 16:02:40] [INFO ] Flow matrix only has 2789 transitions (discarded 397 similar events)
// Phase 1: matrix 2789 rows 963 cols
[2023-03-23 16:02:40] [INFO ] Computed 41 place invariants in 22 ms
[2023-03-23 16:02:41] [INFO ] Implicit Places using invariants in 929 ms returned []
[2023-03-23 16:02:41] [INFO ] Flow matrix only has 2789 transitions (discarded 397 similar events)
[2023-03-23 16:02:41] [INFO ] Invariant cache hit.
[2023-03-23 16:02:42] [INFO ] State equation strengthened by 1634 read => feed constraints.
[2023-03-23 16:02:58] [INFO ] Implicit Places using invariants and state equation in 16743 ms returned []
Implicit Place search using SMT with State Equation took 17675 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 963/1121 places, 3186/3278 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 19022 ms. Remains : 963/1121 places, 3186/3278 transitions.
Successfully simplified 42 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 16:02:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-23 16:02:58] [INFO ] Flatten gal took : 90 ms
[2023-03-23 16:02:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S16C04-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-23 16:02:58] [INFO ] Flatten gal took : 111 ms
[2023-03-23 16:02:58] [INFO ] Input system was already deterministic with 3214 transitions.
Support contains 28 out of 1559 places (down from 33) after GAL structural reductions.
Computed a total of 727 stabilizing places and 1581 stable transitions
Graph (complete) has 9761 edges and 1559 vertex of which 1558 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 ms
Starting structural reductions in LTL mode, iteration 0 : 1559/1559 places, 3214/3214 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1558 transition count 3214
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 79 place count 1480 transition count 3118
Iterating global reduction 1 with 78 rules applied. Total rules applied 157 place count 1480 transition count 3118
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 226 place count 1411 transition count 2938
Iterating global reduction 1 with 69 rules applied. Total rules applied 295 place count 1411 transition count 2938
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 323 place count 1383 transition count 2832
Iterating global reduction 1 with 28 rules applied. Total rules applied 351 place count 1383 transition count 2832
Applied a total of 351 rules in 128 ms. Remains 1383 /1559 variables (removed 176) and now considering 2832/3214 (removed 382) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 129 ms. Remains : 1383/1559 places, 2832/3214 transitions.
[2023-03-23 16:02:58] [INFO ] Flatten gal took : 67 ms
[2023-03-23 16:02:58] [INFO ] Flatten gal took : 73 ms
[2023-03-23 16:02:59] [INFO ] Input system was already deterministic with 2832 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1559/1559 places, 3214/3214 transitions.
Graph (complete) has 9761 edges and 1559 vertex of which 1558 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 1558 transition count 3180
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 1524 transition count 3180
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 69 place count 1524 transition count 3123
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 183 place count 1467 transition count 3123
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 237 place count 1413 transition count 3051
Iterating global reduction 2 with 54 rules applied. Total rules applied 291 place count 1413 transition count 3051
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 336 place count 1368 transition count 2889
Iterating global reduction 2 with 45 rules applied. Total rules applied 381 place count 1368 transition count 2889
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 382 place count 1367 transition count 2885
Iterating global reduction 2 with 1 rules applied. Total rules applied 383 place count 1367 transition count 2885
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 449 place count 1334 transition count 2852
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 474 place count 1309 transition count 2827
Iterating global reduction 2 with 25 rules applied. Total rules applied 499 place count 1309 transition count 2827
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 523 place count 1285 transition count 2731
Iterating global reduction 2 with 24 rules applied. Total rules applied 547 place count 1285 transition count 2731
Applied a total of 547 rules in 426 ms. Remains 1285 /1559 variables (removed 274) and now considering 2731/3214 (removed 483) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 426 ms. Remains : 1285/1559 places, 2731/3214 transitions.
[2023-03-23 16:02:59] [INFO ] Flatten gal took : 55 ms
[2023-03-23 16:02:59] [INFO ] Flatten gal took : 62 ms
[2023-03-23 16:02:59] [INFO ] Input system was already deterministic with 2731 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1559/1559 places, 3214/3214 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1558 transition count 3214
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 79 place count 1480 transition count 3115
Iterating global reduction 1 with 78 rules applied. Total rules applied 157 place count 1480 transition count 3115
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 226 place count 1411 transition count 2935
Iterating global reduction 1 with 69 rules applied. Total rules applied 295 place count 1411 transition count 2935
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 321 place count 1385 transition count 2837
Iterating global reduction 1 with 26 rules applied. Total rules applied 347 place count 1385 transition count 2837
Applied a total of 347 rules in 134 ms. Remains 1385 /1559 variables (removed 174) and now considering 2837/3214 (removed 377) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 1385/1559 places, 2837/3214 transitions.
[2023-03-23 16:03:00] [INFO ] Flatten gal took : 63 ms
[2023-03-23 16:03:00] [INFO ] Flatten gal took : 69 ms
[2023-03-23 16:03:00] [INFO ] Input system was already deterministic with 2837 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1559/1559 places, 3214/3214 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1558 transition count 3214
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 79 place count 1480 transition count 3115
Iterating global reduction 1 with 78 rules applied. Total rules applied 157 place count 1480 transition count 3115
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 225 place count 1412 transition count 2936
Iterating global reduction 1 with 68 rules applied. Total rules applied 293 place count 1412 transition count 2936
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 321 place count 1384 transition count 2830
Iterating global reduction 1 with 28 rules applied. Total rules applied 349 place count 1384 transition count 2830
Applied a total of 349 rules in 123 ms. Remains 1384 /1559 variables (removed 175) and now considering 2830/3214 (removed 384) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 1384/1559 places, 2830/3214 transitions.
[2023-03-23 16:03:00] [INFO ] Flatten gal took : 59 ms
[2023-03-23 16:03:00] [INFO ] Flatten gal took : 80 ms
[2023-03-23 16:03:00] [INFO ] Input system was already deterministic with 2830 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1559/1559 places, 3214/3214 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1558 transition count 3214
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 80 place count 1479 transition count 3114
Iterating global reduction 1 with 79 rules applied. Total rules applied 159 place count 1479 transition count 3114
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 228 place count 1410 transition count 2934
Iterating global reduction 1 with 69 rules applied. Total rules applied 297 place count 1410 transition count 2934
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 325 place count 1382 transition count 2828
Iterating global reduction 1 with 28 rules applied. Total rules applied 353 place count 1382 transition count 2828
Applied a total of 353 rules in 158 ms. Remains 1382 /1559 variables (removed 177) and now considering 2828/3214 (removed 386) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 1382/1559 places, 2828/3214 transitions.
[2023-03-23 16:03:00] [INFO ] Flatten gal took : 62 ms
[2023-03-23 16:03:00] [INFO ] Flatten gal took : 70 ms
[2023-03-23 16:03:01] [INFO ] Input system was already deterministic with 2828 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1559/1559 places, 3214/3214 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1558 transition count 3214
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 80 place count 1479 transition count 3114
Iterating global reduction 1 with 79 rules applied. Total rules applied 159 place count 1479 transition count 3114
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 228 place count 1410 transition count 2931
Iterating global reduction 1 with 69 rules applied. Total rules applied 297 place count 1410 transition count 2931
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 324 place count 1383 transition count 2829
Iterating global reduction 1 with 27 rules applied. Total rules applied 351 place count 1383 transition count 2829
Applied a total of 351 rules in 123 ms. Remains 1383 /1559 variables (removed 176) and now considering 2829/3214 (removed 385) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 1383/1559 places, 2829/3214 transitions.
[2023-03-23 16:03:01] [INFO ] Flatten gal took : 58 ms
[2023-03-23 16:03:01] [INFO ] Flatten gal took : 62 ms
[2023-03-23 16:03:01] [INFO ] Input system was already deterministic with 2829 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1559/1559 places, 3214/3214 transitions.
Graph (complete) has 9761 edges and 1559 vertex of which 1558 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 1558 transition count 3181
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 1525 transition count 3181
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 67 place count 1525 transition count 3124
Deduced a syphon composed of 57 places in 2 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 181 place count 1468 transition count 3124
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 236 place count 1413 transition count 3048
Iterating global reduction 2 with 55 rules applied. Total rules applied 291 place count 1413 transition count 3048
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 336 place count 1368 transition count 2886
Iterating global reduction 2 with 45 rules applied. Total rules applied 381 place count 1368 transition count 2886
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 382 place count 1367 transition count 2882
Iterating global reduction 2 with 1 rules applied. Total rules applied 383 place count 1367 transition count 2882
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 449 place count 1334 transition count 2849
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 473 place count 1310 transition count 2825
Iterating global reduction 2 with 24 rules applied. Total rules applied 497 place count 1310 transition count 2825
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 520 place count 1287 transition count 2733
Iterating global reduction 2 with 23 rules applied. Total rules applied 543 place count 1287 transition count 2733
Applied a total of 543 rules in 338 ms. Remains 1287 /1559 variables (removed 272) and now considering 2733/3214 (removed 481) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 339 ms. Remains : 1287/1559 places, 2733/3214 transitions.
[2023-03-23 16:03:01] [INFO ] Flatten gal took : 49 ms
[2023-03-23 16:03:01] [INFO ] Flatten gal took : 56 ms
[2023-03-23 16:03:02] [INFO ] Input system was already deterministic with 2733 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1559/1559 places, 3214/3214 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1558 transition count 3214
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 80 place count 1479 transition count 3114
Iterating global reduction 1 with 79 rules applied. Total rules applied 159 place count 1479 transition count 3114
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 227 place count 1411 transition count 2935
Iterating global reduction 1 with 68 rules applied. Total rules applied 295 place count 1411 transition count 2935
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 322 place count 1384 transition count 2833
Iterating global reduction 1 with 27 rules applied. Total rules applied 349 place count 1384 transition count 2833
Applied a total of 349 rules in 172 ms. Remains 1384 /1559 variables (removed 175) and now considering 2833/3214 (removed 381) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 1384/1559 places, 2833/3214 transitions.
[2023-03-23 16:03:02] [INFO ] Flatten gal took : 59 ms
[2023-03-23 16:03:02] [INFO ] Flatten gal took : 67 ms
[2023-03-23 16:03:02] [INFO ] Input system was already deterministic with 2833 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1559/1559 places, 3214/3214 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1558 transition count 3214
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 81 place count 1478 transition count 3113
Iterating global reduction 1 with 80 rules applied. Total rules applied 161 place count 1478 transition count 3113
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 231 place count 1408 transition count 2929
Iterating global reduction 1 with 70 rules applied. Total rules applied 301 place count 1408 transition count 2929
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 329 place count 1380 transition count 2823
Iterating global reduction 1 with 28 rules applied. Total rules applied 357 place count 1380 transition count 2823
Applied a total of 357 rules in 149 ms. Remains 1380 /1559 variables (removed 179) and now considering 2823/3214 (removed 391) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 1380/1559 places, 2823/3214 transitions.
[2023-03-23 16:03:02] [INFO ] Flatten gal took : 54 ms
[2023-03-23 16:03:02] [INFO ] Flatten gal took : 61 ms
[2023-03-23 16:03:02] [INFO ] Input system was already deterministic with 2823 transitions.
[2023-03-23 16:03:03] [INFO ] Flatten gal took : 69 ms
[2023-03-23 16:03:03] [INFO ] Flatten gal took : 71 ms
[2023-03-23 16:03:03] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-23 16:03:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1559 places, 3214 transitions and 13969 arcs took 20 ms.
Total runtime 145741 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 1559 NrTr: 3214 NrArc: 13969)

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

net check time: 0m 0.001sec

init dd package: 0m 2.679sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9857196 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093944 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 CTLCardinality -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.050sec

19059 36167 60215 84691 116932 138913 161189 201096 223664 280262 301361 326832 359822 383176 406799 484505 508295 606053 821095

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C04"
export BK_EXAMINATION="CTLCardinality"
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 MultiCrashLeafsetExtension-PT-S16C04, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856420800761"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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