Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987871500205.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PhilosophersDyn-COL-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871500205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 3 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 32K Apr 27 15:14 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1591134285814

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 21:44:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-02 21:44:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 21:44:47] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 21:44:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 714 ms
[2020-06-02 21:44:48] [INFO ] sort/places :
Neighbourhood->Neighbourhood,
Philosopher->Outside,Think,Forks,WaitLeft,WaitRight,HasLeft,HasRight,

[2020-06-02 21:44:48] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 23 ms.
[2020-06-02 21:44:48] [INFO ] Computed order based on color domains.
[2020-06-02 21:44:48] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions in 56 ms.
[2020-06-02 21:44:48] [INFO ] Unfolded HLPN properties in 0 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 113 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
[2020-06-02 21:44:49] [INFO ] Flatten gal took : 370 ms
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2020-06-02 21:44:49] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2020-06-02 21:44:49] [INFO ] Computed 39 place invariants in 66 ms
Support contains 170 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 282 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2020-06-02 21:44:49] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2020-06-02 21:44:49] [INFO ] Computed 39 place invariants in 35 ms
[2020-06-02 21:44:51] [INFO ] Dead Transitions using invariants and state equation in 2057 ms returned [45, 55, 56, 65, 67, 75, 78, 85, 89, 95, 100, 105, 111, 115, 122, 125, 133, 135, 144, 145, 146, 156, 166, 167, 176, 178, 186, 189, 196, 200, 206, 211, 216, 222, 226, 233, 236, 244, 245, 247, 256, 257, 267, 277, 278, 287, 289, 297, 300, 307, 311, 317, 322, 327, 333, 337, 344, 345, 348, 356, 358, 367, 368, 378, 388, 389, 398, 400, 408, 411, 418, 422, 428, 433, 438, 444, 445, 449, 456, 459, 467, 469, 478, 479, 489, 499, 500, 509, 511, 519, 522, 529, 533, 539, 544, 545, 550, 556, 560, 567, 570, 578, 580, 589, 590, 600, 610, 611, 620, 622, 630, 633, 640, 644, 645, 651, 656, 661, 667, 671, 678, 681, 689, 691, 700, 701, 711, 721, 722, 731, 733, 741, 744, 745, 752, 756, 762, 767, 772, 778, 782, 789, 792, 800, 802, 811, 812, 822, 832, 833, 842, 844, 845, 853, 856, 863, 867, 873, 878, 883, 889, 893, 900, 903, 911, 913, 922, 923, 933, 943, 944, 945, 954, 956, 964, 967, 974, 978, 984, 989, 994, 1000, 1004, 1011, 1014, 1022, 1024, 1033, 1034, 1044, 1045, 1055, 1056, 1065, 1067, 1075, 1078, 1085, 1089, 1095, 1100, 1105, 1111, 1115, 1122, 1125, 1133, 1135, 1144, 1145, 1146, 1156, 1166, 1167, 1176, 1178, 1186, 1189, 1196, 1200, 1206, 1211, 1216, 1222, 1226, 1233, 1236, 1244, 1245, 1247, 1256, 1257, 1267, 1277, 1278, 1287, 1289, 1297, 1300, 1307, 1311, 1317, 1322, 1327, 1333, 1337, 1344, 1345, 1348, 1356, 1358, 1367, 1368, 1378, 1388, 1389, 1398, 1400, 1408, 1411, 1418, 1422, 1428, 1433, 1438, 1444, 1445, 1449, 1456, 1459, 1467, 1469, 1478, 1479, 1489, 1499, 1500, 1509, 1511, 1519, 1522, 1529, 1533, 1539, 1544, 1545, 1550, 1556, 1560, 1567, 1570, 1578, 1580, 1589, 1590, 1600, 1610, 1611, 1620, 1622, 1630, 1633, 1640, 1644, 1645, 1651, 1656, 1661, 1667, 1671, 1678, 1681, 1689, 1691, 1700, 1701, 1711, 1721, 1722, 1731, 1733, 1741, 1744, 1745, 1752, 1756, 1762, 1767, 1772, 1778, 1782, 1789, 1792, 1800, 1802, 1811, 1812, 1822, 1832, 1833, 1842, 1844, 1845, 1853, 1856, 1863, 1867, 1873, 1878, 1883, 1889, 1893, 1900, 1903, 1911, 1913, 1922, 1923, 1933, 1943, 1944, 1945, 1954, 1956, 1964, 1967, 1974, 1978, 1984, 1989, 1994, 2000, 2004, 2011, 2014, 2022, 2024, 2033, 2034, 2044]
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions :[2044, 2034, 2033, 2024, 2022, 2014, 2011, 2004, 2000, 1994, 1989, 1984, 1978, 1974, 1967, 1964, 1956, 1954, 1945, 1944, 1943, 1933, 1923, 1922, 1913, 1911, 1903, 1900, 1893, 1889, 1883, 1878, 1873, 1867, 1863, 1856, 1853, 1845, 1844, 1842, 1833, 1832, 1822, 1812, 1811, 1802, 1800, 1792, 1789, 1782, 1778, 1772, 1767, 1762, 1756, 1752, 1745, 1744, 1741, 1733, 1731, 1722, 1721, 1711, 1701, 1700, 1691, 1689, 1681, 1678, 1671, 1667, 1661, 1656, 1651, 1645, 1644, 1640, 1633, 1630, 1622, 1620, 1611, 1610, 1600, 1590, 1589, 1580, 1578, 1570, 1567, 1560, 1556, 1550, 1545, 1544, 1539, 1533, 1529, 1522, 1519, 1511, 1509, 1500, 1499, 1489, 1479, 1478, 1469, 1467, 1459, 1456, 1449, 1445, 1444, 1438, 1433, 1428, 1422, 1418, 1411, 1408, 1400, 1398, 1389, 1388, 1378, 1368, 1367, 1358, 1356, 1348, 1345, 1344, 1337, 1333, 1327, 1322, 1317, 1311, 1307, 1300, 1297, 1289, 1287, 1278, 1277, 1267, 1257, 1256, 1247, 1245, 1244, 1236, 1233, 1226, 1222, 1216, 1211, 1206, 1200, 1196, 1189, 1186, 1178, 1176, 1167, 1166, 1156, 1146, 1145, 1144, 1135, 1133, 1125, 1122, 1115, 1111, 1105, 1100, 1095, 1089, 1085, 1078, 1075, 1067, 1065, 1056, 1055, 1045, 1044, 1034, 1033, 1024, 1022, 1014, 1011, 1004, 1000, 994, 989, 984, 978, 974, 967, 964, 956, 954, 945, 944, 943, 933, 923, 922, 913, 911, 903, 900, 893, 889, 883, 878, 873, 867, 863, 856, 853, 845, 844, 842, 833, 832, 822, 812, 811, 802, 800, 792, 789, 782, 778, 772, 767, 762, 756, 752, 745, 744, 741, 733, 731, 722, 721, 711, 701, 700, 691, 689, 681, 678, 671, 667, 661, 656, 651, 645, 644, 640, 633, 630, 622, 620, 611, 610, 600, 590, 589, 580, 578, 570, 567, 560, 556, 550, 545, 544, 539, 533, 529, 522, 519, 511, 509, 500, 499, 489, 479, 478, 469, 467, 459, 456, 449, 445, 444, 438, 433, 428, 422, 418, 411, 408, 400, 398, 389, 388, 378, 368, 367, 358, 356, 348, 345, 344, 337, 333, 327, 322, 317, 311, 307, 300, 297, 289, 287, 278, 277, 267, 257, 256, 247, 245, 244, 236, 233, 226, 222, 216, 211, 206, 200, 196, 189, 186, 178, 176, 167, 166, 156, 146, 145, 144, 135, 133, 125, 122, 115, 111, 105, 100, 95, 89, 85, 78, 75, 67, 65, 56, 55, 45]
Starting structural reductions, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 87 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 170/170 places, 1885/2265 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 1885 rows 170 cols
[2020-06-02 21:44:51] [INFO ] Computed 39 place invariants in 40 ms
Support contains 170 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 107 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 73 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2020-06-02 21:44:51] [INFO ] Computed 39 place invariants in 35 ms
[2020-06-02 21:44:52] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2020-06-02 21:44:52] [INFO ] Computed 39 place invariants in 23 ms
[2020-06-02 21:44:52] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2020-06-02 21:44:53] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
[2020-06-02 21:44:53] [INFO ] Redundant transitions in 231 ms returned []
// Phase 1: matrix 1885 rows 170 cols
[2020-06-02 21:44:53] [INFO ] Computed 39 place invariants in 38 ms
[2020-06-02 21:44:55] [INFO ] Dead Transitions using invariants and state equation in 2552 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 1885/1885 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Applied a total of 0 rules in 32 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
// Phase 1: matrix 1885 rows 170 cols
[2020-06-02 21:44:56] [INFO ] Computed 39 place invariants in 34 ms
[2020-06-02 21:44:56] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2020-06-02 21:44:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 33 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ PhilosophersDyn-COL-10 @ 3570 seconds

FORMULA PhilosophersDyn-COL-10-UpperBounds-00 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-UpperBounds-01 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-UpperBounds-02 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-UpperBounds-03 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-UpperBounds-04 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-UpperBounds-06 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-UpperBounds-07 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-UpperBounds-08 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-UpperBounds-09 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-UpperBounds-10 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-UpperBounds-11 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-UpperBounds-12 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-UpperBounds-13 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-UpperBounds-14 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-UpperBounds-15 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PhilosophersDyn-COL-10-UpperBounds-05 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3382
rslt: Output for UpperBounds @ PhilosophersDyn-COL-10

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=UpperBounds.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--timelimit=3570",
"--localtimelimit=0",
"--json=UpperBounds.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 21:44:56 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "MAX(p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)",
"processed_size": 72,
"rewrites": 0
},
"result":
{
"edges": 481135,
"markings": 159811,
"produced_by": "search",
"value": 4
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 236
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "MAX(p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)",
"processed_size": 72,
"rewrites": 0
},
"result":
{
"edges": 617305,
"markings": 199051,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 252
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "MAX(p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)",
"processed_size": 72,
"rewrites": 0
},
"result":
{
"edges": 481135,
"markings": 159811,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 270
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "MAX(p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129)",
"processed_size": 72,
"rewrites": 0
},
"result":
{
"edges": 409914,
"markings": 159509,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 292
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "MAX(p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)",
"processed_size": 72,
"rewrites": 0
},
"result":
{
"edges": 398843,
"markings": 159160,
"produced_by": "search",
"value": 4
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 318
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)",
"processed_size": 72,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 10
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)",
"processed_size": 72,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 10
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 388
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "MAX(p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)",
"processed_size": 72,
"rewrites": 0
},
"result":
{
"edges": 481135,
"markings": 159811,
"produced_by": "search",
"value": 4
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 435
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "MAX(p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)",
"processed_size": 72,
"rewrites": 0
},
"result":
{
"edges": 481135,
"markings": 159811,
"produced_by": "search",
"value": 4
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 495
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)",
"processed_size": 72,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 10
},
"task":
{
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 578
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "MAX(p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)",
"processed_size": 72,
"rewrites": 0
},
"result":
{
"edges": 481135,
"markings": 159811,
"produced_by": "search",
"value": 4
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 690
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "MAX(p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)",
"processed_size": 72,
"rewrites": 0
},
"result":
{
"edges": 481135,
"markings": 159811,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 860
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "MAX(p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)",
"processed_size": 72,
"rewrites": 0
},
"result":
{
"edges": 617305,
"markings": 199051,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1140
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "MAX(p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)",
"processed_size": 72,
"rewrites": 0
},
"result":
{
"edges": 481135,
"markings": 159811,
"produced_by": "search",
"value": 2
},
"task":
{
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1704
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "MAX(p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)",
"processed_size": 72,
"rewrites": 0
},
"result":
{
"edges": 481135,
"markings": 159811,
"produced_by": "search",
"value": 4
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3394
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 100,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 100,
"visible_transitions": 0
},
"processed": "MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99)",
"processed_size": 592,
"rewrites": 0
},
"result":
{
"edges": 406544,
"markings": 159713,
"produced_by": "search",
"value": 4
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 61628,
"runtime": 188.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "UpperBounds.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*)"
},
"net":
{
"arcs": 14300,
"conflict_clusters": 1,
"places": 170,
"places_significant": 131,
"singleton_clusters": 0,
"transitions": 1885
},
"result":
{
"preliminary_value": "4 2 2 2 4 4 10 10 4 4 10 4 2 2 2 4 ",
"value": "4 2 2 2 4 4 10 10 4 4 10 4 2 2 2 4 "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2055/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5440
lola: finding significant places
lola: 170 places, 1885 transitions, 131 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from UpperBounds.xml
lola: MAX(p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) : MAX(p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150) : MAX(p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) : MAX(p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) : MAX(p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) : MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p62 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p61 + p60 + p59 + p49 + p39 + p29 + p19 + p69 + p79 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) : MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100) : MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100) : MAX(p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) : MAX(p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) : MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100) : MAX(p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149) : MAX(p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) : MAX(p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150) : MAX(p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160) : MAX(p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 51838 markings, 146842 edges, 10368 markings/sec, 0 secs
lola: 110118 markings, 327026 edges, 11656 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 159811 markings, 481135 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 58063 markings, 170038 edges, 11613 markings/sec, 0 secs
lola: 115628 markings, 351177 edges, 11513 markings/sec, 5 secs
lola: 165400 markings, 509418 edges, 9954 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 617305 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 62747 markings, 180883 edges, 12549 markings/sec, 0 secs
lola: 128470 markings, 383925 edges, 13145 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 159811 markings, 481135 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 73057 markings, 178016 edges, 14611 markings/sec, 0 secs
lola: 144659 markings, 367842 edges, 14320 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 159509 markings, 409914 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 57539 markings, 133982 edges, 11508 markings/sec, 0 secs
lola: 131160 markings, 323003 edges, 14724 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 159160 markings, 398843 edges
lola: ========================================
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 43788 markings, 122860 edges, 8758 markings/sec, 0 secs
lola: 101947 markings, 300860 edges, 11632 markings/sec, 5 secs
lola: 159444 markings, 479245 edges, 11499 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 159811 markings, 481135 edges
lola: ========================================
lola: subprocess 8 will run for 435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 44601 markings, 124988 edges, 8920 markings/sec, 0 secs
lola: 103035 markings, 304292 edges, 11687 markings/sec, 5 secs
lola: 159801 markings, 481050 edges, 11353 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 159811 markings, 481135 edges
lola: ========================================
lola: subprocess 9 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p100)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 43475 markings, 122108 edges, 8695 markings/sec, 0 secs
lola: 96541 markings, 284385 edges, 10613 markings/sec, 5 secs
lola: 149002 markings, 446299 edges, 10492 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 159811 markings, 481135 edges
lola: ========================================
lola: subprocess 11 will run for 690 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 58923 markings, 169310 edges, 11785 markings/sec, 0 secs
lola: 124995 markings, 373095 edges, 13214 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 159811 markings, 481135 edges
lola: ========================================
lola: subprocess 12 will run for 860 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p159 + p158 + p157 + p156 + p155 + p154 + p153 + p152 + p151 + p150)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 58119 markings, 170164 edges, 11624 markings/sec, 0 secs
lola: 115704 markings, 351546 edges, 11517 markings/sec, 5 secs
lola: 172543 markings, 531770 edges, 11368 markings/sec, 10 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 617305 edges
lola: ========================================
lola: subprocess 13 will run for 1140 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p169 + p168 + p167 + p166 + p165 + p164 + p163 + p162 + p161 + p160)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 50813 markings, 144825 edges, 10163 markings/sec, 0 secs
lola: 110131 markings, 327159 edges, 11864 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 159811 markings, 481135 edges
lola: ========================================
lola: subprocess 14 will run for 1704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139)
lola: processed formula length: 72
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 52182 markings, 147898 edges, 10436 markings/sec, 0 secs
lola: 110357 markings, 327898 edges, 11635 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 159811 markings, 481135 edges
lola: ========================================
lola: subprocess 15 will run for 3394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p68 + p67 + p66 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p65 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p64 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p63 + p40 + p41 + p42 + p43 + p44 + p45 + p46 ... (shortened)
lola: processed formula length: 592
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 10
lola: 63661 markings, 153663 edges, 12732 markings/sec, 0 secs
lola: 137828 markings, 346579 edges, 14833 markings/sec, 5 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 159713 markings, 406544 edges
lola: RESULT
lola:
SUMMARY: 4 2 2 2 4 4 10 10 4 4 10 4 2 2 2 4
lola:
preliminary result: 4 2 2 2 4 4 10 10 4 4 10 4 2 2 2 4
lola: ========================================
lola: memory consumption: 61628 KB
lola: time consumption: 188 seconds
lola: print data as JSON (--json)
lola: writing JSON to UpperBounds.json
lola: closed JSON file UpperBounds.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-COL-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is PhilosophersDyn-COL-10, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987871500205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;