Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r187-csrt-155344544200025.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is FamilyReunion-COL-L00010M0001C001P001G001, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r187-csrt-155344544200025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 3.4K Mar 24 07:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 24 07:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 24 06:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 24 06:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 24 06:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Mar 24 06:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 24 06:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K Mar 24 06:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 24 00:18 NewModel
-rw-r--r-- 1 mcc users 3.8K Mar 24 06:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 24 06:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 132 Mar 24 06:27 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 370 Mar 24 06:27 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 06:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 24 06:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 24 06:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 24 06:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 00:18 equiv_pt
-rw-r--r-- 1 mcc users 24 Mar 24 00:18 instance
-rw-r--r-- 1 mcc users 5 Mar 24 00:18 iscolored
-rw-r--r-- 1 mcc users 134K Mar 24 00:18 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 FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1553692966839

info: Time: 3600 - MCC
===========================================================================================
prep: translating FamilyReunion-COL-L00010M0001C001P001G001 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating FamilyReunion-COL-L00010M0001C001P001G001 formula UpperBounds into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking UpperBounds @ FamilyReunion-COL-L00010M0001C001P001G001 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2720/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 47552
lola: finding significant places
lola: 1486 places, 1234 transitions, 1133 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1752 transition conflict sets
lola: TASK
lola: reading formula from FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
lola: MAX(p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835) : MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p98 + p96 + p94 + p92 + p90 + p88 + p89 + p91 + p93 + p95 + p97 + p99) : MAX(p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182) : MAX(p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644) : MAX(p110 + p111) : MAX(p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813) : MAX(p1183 + p1184 + p1185 + p1186 + p1187 + p1188 + p1189 + p1190 + p1191 + p1192 + p1193 + p1194 + p1195 + p1196 + p1197 + p1198 + p1199 + p1200 + p1201 + p1202 + p1203 + p1204) : MAX(p656 + p657) : MAX(p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563) : MAX(p1012 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1033) : MAX(p1250 + p1249 + p1248 + p1247 + p1246 + p1245 + p1244 + p1243 + p1242 + p1241 + p1240 + p1239 + p1238 + p1237 + p1236 + p1235 + p1234 + p1233 + p1232 + p1231 + p1230 + p1229) : MAX(p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1429 + p1430 + p1431 + p1432 + p1433 + p1434 + p1435 + p1436 + p1437 + p1438 + p1439 + p1422 + p1421 + p1420 + p1419 + p1418) : MAX(p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736) : MAX(p978 + p977 + p976 + p975 + p974 + p973 + p972 + p971 + p970 + p969 + p968 + p967 + p966 + p965 + p964 + p963 + p962 + p961 + p960 + p959 + p958 + p957) : MAX(p1067 + p1068 + p1069 + p1070 + p1071 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088) : MAX(p1207 + p1208 + p1209 + p1210 + p1211 + p1212 + p1213 + p1214 + p1215 + p1216 + p1217)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p110 + p111)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p110 + p111)
lola: processed formula length: 16
lola: 0 rewrites
lola: closed formula file FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 551 markings, 550 edges
lola: ========================================

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-4 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p656 + p657)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p656 + p657)
lola: processed formula length: 16
lola: 0 rewrites
lola: closed formula file FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
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: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 0 markings, 0 edges
lola: ========================================

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-7 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1172 + p1173 + p1174 + p1175 + p1176 + p1177 + p1178 + p1179 + p1180 + p1181 + p1182)
lola: processed formula length: 90
lola: 0 rewrites
lola: closed formula file FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 177 markings, 176 edges

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-2 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p803 + p804 + p805 + p806 + p807 + p808 + p809 + p810 + p811 + p812 + p813)
lola: processed formula length: 79
lola: 0 rewrites
lola: closed formula file FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
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: ========================================
lola: RUNNING
lola: Structural Bound: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 474 markings, 473 edges

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-5 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644)
lola: processed formula length: 79
lola: 0 rewrites
lola: closed formula file FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 474 markings, 473 edges
lola: ========================================

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-3 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p726 + p727 + p728 + p729 + p730 + p731 + p732 + p733 + p734 + p735 + p736)
lola: processed formula length: 79
lola: 0 rewrites
lola: closed formula file FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 0 markings, 0 edges
lola: ========================================

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-12 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1207 + p1208 + p1209 + p1210 + p1211 + p1212 + p1213 + p1214 + p1215 + p1216 + p1217)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1207 + p1208 + p1209 + p1210 + p1211 + p1212 + p1213 + p1214 + p1215 + p1216 + p1217)
lola: processed formula length: 90
lola: 0 rewrites
lola: closed formula file FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
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: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 121 markings, 120 edges
lola: ========================================

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-15 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p814 + p815 + p816 + p817 + p818 + p819 + p820 + p821 + p822 + p823 + p824 + p825 + p826 + p827 + p828 + p829 + p830 + p831 + p832 + p833 + p834 + p835)
lola: processed formula length: 156
lola: 0 rewrites
lola: closed formula file FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 111 markings, 110 edges
lola: ========================================

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-0 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563)
lola: processed formula length: 156
lola: 0 rewrites
lola: closed formula file FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 23 markings, 22 edges
lola: ========================================

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-8 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1012 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1033)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1012 + p1013 + p1014 + p1015 + p1016 + p1017 + p1018 + p1019 + p1020 + p1021 + p1022 + p1023 + p1024 + p1025 + p1026 + p1027 + p1028 + p1029 + p1030 + p1031 + p1032 + p1033)
lola: processed formula length: 178
lola: 0 rewrites
lola: closed formula file FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 210 markings, 209 edges
lola: ========================================

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-9 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1250 + p1249 + p1248 + p1247 + p1246 + p1245 + p1244 + p1243 + p1242 + p1241 + p1240 + p1239 + p1238 + p1237 + p1236 + p1235 + p1234 + p1233 + p1232 + p1231 + p1230 + p1229)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1250 + p1249 + p1248 + p1247 + p1246 + p1245 + p1244 + p1243 + p1242 + p1241 + p1240 + p1239 + p1238 + p1237 + p1236 + p1235 + p1234 + p1233 + p1232 + p1231 + p1230 + p1229)
lola: processed formula length: 178
lola: 0 rewrites
lola: closed formula file FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 353 markings, 352 edges
lola: ========================================

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-10 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1429 + p1430 + p1431 + p1432 + p1433 + p1434 + p1435 + p1436 + p1437 + p1438 + p1439 + p1422 + p1421 + p1420 + p1419 + p1418)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1423 + p1424 + p1425 + p1426 + p1427 + p1428 + p1429 + p1430 + p1431 + p1432 + p1433 + p1434 + p1435 + p1436 + p1437 + p1438 + p1439 + p1422 + p1421 + p1420 + p1419 + p1418)
lola: processed formula length: 178
lola: 0 rewrites
lola: closed formula file FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 78 markings, 77 edges
lola: ========================================

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-11 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p98 + p96 + p94 + p92 + p90 + p88 + p89 + p91 + p93 + p95 + p97 + p99)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p98 + p96 + p94 + p92 + p90 + p88 + p89 + p91 + p93 + p95 + p97 + p99)
lola: processed formula length: 144
lola: 0 rewrites
lola: closed formula file FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 441 markings, 440 edges
lola:
FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-1 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p978 + p977 + p976 + p975 + p974 + p973 + p972 + p971 + p970 + p969 + p968 + p967 + p966 + p965 + p964 + p963 + p962 + p961 + p960 + p959 + p958 + p957)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p978 + p977 + p976 + p975 + p974 + p973 + p972 + p971 + p970 + p969 + p968 + p967 + p966 + p965 + p964 + p963 + p962 + p961 + p960 + p959 + p958 + p957)
lola: processed formula length: 156
lola: 0 rewrites
lola: closed formula file FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 342 markings, 341 edges
lola: ========================================

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-13 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1067 + p1068 + p1069 + p1070 + p1071 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1067 + p1068 + p1069 + p1070 + p1071 + p1072 + p1073 + p1074 + p1075 + p1076 + p1077 + p1078 + p1079 + p1080 + p1081 + p1082 + p1083 + p1084 + p1085 + p1086 + p1087 + p1088)
lola: processed formula length: 178
lola: 0 rewrites
lola: closed formula file FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 122 markings, 121 edges
lola: ========================================

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-14 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1183 + p1184 + p1185 + p1186 + p1187 + p1188 + p1189 + p1190 + p1191 + p1192 + p1193 + p1194 + p1195 + p1196 + p1197 + p1198 + p1199 + p1200 + p1201 + p1202 + p1203 + p1204)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1183 + p1184 + p1185 + p1186 + p1187 + p1188 + p1189 + p1190 + p1191 + p1192 + p1193 + p1194 + p1195 + p1196 + p1197 + p1198 + p1199 + p1200 + p1201 + p1202 + p1203 + p1204)
lola: processed formula length: 178
lola: 0 rewrites
lola: closed formula file FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds.task
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: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 125 markings, 124 edges
lola: ========================================

FORMULA FamilyReunion-COL-L00010M0001C001P001G001-UpperBounds-6 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 11 11 11 11 11 11 2 2 11 11 11 11 11 11 11 2
lola:
preliminary result: 11 11 11 11 11 11 2 2 11 11 11 11 11 11 11 2
lola: memory consumption: 20260 KB
lola: time consumption: 4 seconds

BK_STOP 1553692971171

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

grep: GenericPropertiesVerdict.xml: No such file or directory

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="FamilyReunion-COL-L00010M0001C001P001G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="win2018"
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-3954"
echo " Executing tool win2018"
echo " Input is FamilyReunion-COL-L00010M0001C001P001G001, 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 r187-csrt-155344544200025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L00010M0001C001P001G001.tgz
mv FamilyReunion-COL-L00010M0001C001P001G001 execution
cd execution
if [ "UpperBounds" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "UpperBounds" = "UpperBounds" ] ; 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
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 ;