Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987852900253.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-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-4028
Executing tool itslola
Input is NeoElection-COL-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987852900253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 3.9K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 30 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 30 13:04 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 98K Apr 30 13:04 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 NeoElection-COL-6-UpperBounds-00
FORMULA_NAME NeoElection-COL-6-UpperBounds-01
FORMULA_NAME NeoElection-COL-6-UpperBounds-02
FORMULA_NAME NeoElection-COL-6-UpperBounds-03
FORMULA_NAME NeoElection-COL-6-UpperBounds-04
FORMULA_NAME NeoElection-COL-6-UpperBounds-05
FORMULA_NAME NeoElection-COL-6-UpperBounds-06
FORMULA_NAME NeoElection-COL-6-UpperBounds-07
FORMULA_NAME NeoElection-COL-6-UpperBounds-08
FORMULA_NAME NeoElection-COL-6-UpperBounds-09
FORMULA_NAME NeoElection-COL-6-UpperBounds-10
FORMULA_NAME NeoElection-COL-6-UpperBounds-11
FORMULA_NAME NeoElection-COL-6-UpperBounds-12
FORMULA_NAME NeoElection-COL-6-UpperBounds-13
FORMULA_NAME NeoElection-COL-6-UpperBounds-14
FORMULA_NAME NeoElection-COL-6-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591137031611

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 22:30:34] [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 22:30:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 22:30:34] [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 22:30:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 859 ms
[2020-06-02 22:30:34] [INFO ] sort/places :
M * STAGE->P-stage,
M * POS->P-sendAnnPs__broadcasting,P-startNeg__broadcasting,
M * M * MT * M->P-network,P-poll__networl,
M * POS * M->P-masterList,
M * BOOL * M->P-masterState,
M * M * NEGSTEP->P-negotiation,
M->P-crashed,dead,P-electedPrimary,P-electedSecondary,P-electionFailed,P-electionInit,P-poll__handlingMessage,P-poll__pollEnd,P-poll__waitingMessage,P-polling,

[2020-06-02 22:30:35] [INFO ] Detected 4 constant HL places corresponding to 315 PT places.
[2020-06-02 22:30:35] [INFO ] Imported 18 HL places and 22 HL transitions for a total of 4830 PT places and 13580.0 transition bindings in 35 ms.
[2020-06-02 22:30:35] [INFO ] Computed order based on color domains.
[2020-06-02 22:30:35] [INFO ] Unfolded HLPN to a Petri net with 4830 places and 8005 transitions in 135 ms.
[2020-06-02 22:30:35] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 4507 places in 21 ms
Reduce places removed 4537 places and 7611 transitions.
Reduce places removed 13 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 206 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2020-06-02 22:30:35] [INFO ] Flatten gal took : 84 ms
FORMULA NeoElection-COL-6-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-13 30 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-09 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-01 36 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeoElection-COL-6-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 )
[2020-06-02 22:30:35] [INFO ] Flow matrix only has 369 transitions (discarded 25 similar events)
// Phase 1: matrix 369 rows 280 cols
[2020-06-02 22:30:35] [INFO ] Computed 77 place invariants in 14 ms
Support contains 54 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 394/394 transitions.
Discarding 30 places :
Also discarding 0 output transitions
Graph (complete) has 910 edges and 280 vertex of which 250 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.9 ms
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 250 transition count 394
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 210 transitions.
Iterating global reduction 0 with 88 rules applied. Total rules applied 133 place count 206 transition count 184
Applied a total of 133 rules in 42 ms. Remains 206 /280 variables (removed 74) and now considering 184/394 (removed 210) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/280 places, 184/394 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 )
[2020-06-02 22:30:35] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 206 cols
[2020-06-02 22:30:35] [INFO ] Computed 47 place invariants in 5 ms
Support contains 54 out of 206 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 206/206 places, 184/184 transitions.
Applied a total of 0 rules in 16 ms. Remains 206 /206 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 184/184 transitions.
Starting structural reductions, iteration 0 : 206/206 places, 184/184 transitions.
Applied a total of 0 rules in 11 ms. Remains 206 /206 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2020-06-02 22:30:35] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 206 cols
[2020-06-02 22:30:35] [INFO ] Computed 47 place invariants in 4 ms
[2020-06-02 22:30:36] [INFO ] Implicit Places using invariants in 531 ms returned [16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 539 ms to find 36 implicit places.
[2020-06-02 22:30:36] [INFO ] Redundant transitions in 11 ms returned []
[2020-06-02 22:30:36] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 170 cols
[2020-06-02 22:30:36] [INFO ] Computed 11 place invariants in 3 ms
[2020-06-02 22:30:36] [INFO ] Dead Transitions using invariants and state equation in 418 ms returned []
Starting structural reductions, iteration 1 : 170/206 places, 184/184 transitions.
Applied a total of 0 rules in 52 ms. Remains 170 /170 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2020-06-02 22:30:36] [INFO ] Redundant transitions in 12 ms returned []
[2020-06-02 22:30:36] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 170 cols
[2020-06-02 22:30:36] [INFO ] Computed 11 place invariants in 4 ms
[2020-06-02 22:30:36] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned []
Finished structural reductions, in 2 iterations. Remains : 170/206 places, 184/184 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 )
[2020-06-02 22:30:36] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 170 cols
[2020-06-02 22:30:36] [INFO ] Computed 11 place invariants in 5 ms
Support contains 54 out of 170 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 170/170 places, 184/184 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 184/184 transitions.
Starting structural reductions, iteration 0 : 170/170 places, 184/184 transitions.
Applied a total of 0 rules in 6 ms. Remains 170 /170 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2020-06-02 22:30:36] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 170 cols
[2020-06-02 22:30:36] [INFO ] Computed 11 place invariants in 1 ms
[2020-06-02 22:30:37] [INFO ] Implicit Places using invariants in 303 ms returned []
[2020-06-02 22:30:37] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 170 cols
[2020-06-02 22:30:37] [INFO ] Computed 11 place invariants in 4 ms
[2020-06-02 22:30:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2020-06-02 22:30:37] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
[2020-06-02 22:30:37] [INFO ] Redundant transitions in 2 ms returned []
[2020-06-02 22:30:37] [INFO ] Flow matrix only has 159 transitions (discarded 25 similar events)
// Phase 1: matrix 159 rows 170 cols
[2020-06-02 22:30:37] [INFO ] Computed 11 place invariants in 1 ms
[2020-06-02 22:30:37] [INFO ] Dead Transitions using invariants and state equation in 233 ms returned []
Finished structural reductions, in 1 iterations. Remains : 170/170 places, 184/184 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Discarding 5 places :
Also discarding 0 output transitions
Graph (complete) has 390 edges and 170 vertex of which 165 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 165 transition count 159
Applied a total of 26 rules in 6 ms. Remains 165 /170 variables (removed 5) and now considering 159/184 (removed 25) transitions.
// Phase 1: matrix 159 rows 165 cols
[2020-06-02 22:30:38] [INFO ] Computed 6 place invariants in 1 ms
[2020-06-02 22:30:38] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2020-06-02 22:30:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 5 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ NeoElection-COL-6 @ 3570 seconds

FORMULA NeoElection-COL-6-UpperBounds-07 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA NeoElection-COL-6-UpperBounds-15 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeoElection-COL-6-UpperBounds-06 6 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3567
rslt: Output for UpperBounds @ NeoElection-COL-6

{
"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 22:30:38 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 891
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p128 + p129 + p130 + p131 + p132 + p133)",
"processed_size": 44,
"rewrites": 0
},
"result":
{
"edges": 189,
"markings": 190,
"produced_by": "search",
"value": 6
},
"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": 1189
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p116 + p117 + p118 + p119 + p120 + p121)",
"processed_size": 44,
"rewrites": 0
},
"result":
{
"edges": 300,
"markings": 301,
"produced_by": "search",
"value": 6
},
"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": 1783
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p122 + p123 + p124 + p125 + p126 + p127)",
"processed_size": 44,
"rewrites": 0
},
"result":
{
"edges": 225,
"markings": 226,
"produced_by": "search",
"value": 6
},
"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": 3567
},
"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": 36,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 36,
"visible_transitions": 0
},
"processed": "MAX(p134 + p135 + p136 + p137 + p138 + p140 + p141 + p142 + p143 + p144 + p146 + p147 + p148 + p149 + p150 + p152 + p153 + p154 + p155 + p156 + p158 + p159 + p160 + p161 + p162 + p164 + p165 + p166 + p167 + p168 + p169 + p163 + p157 + p151 + p145 + p139)",
"processed_size": 254,
"rewrites": 0
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "search",
"value": 6
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 17388,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "UpperBounds.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "MAX(*) : MAX(*) : MAX(*) : MAX(*)"
},
"net":
{
"arcs": 763,
"conflict_clusters": 60,
"places": 170,
"places_significant": 159,
"singleton_clusters": 0,
"transitions": 184
},
"result":
{
"preliminary_value": "6 6 6 6 ",
"value": "6 6 6 6 "
},
"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: 354/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 5440
lola: finding significant places
lola: 170 places, 184 transitions, 159 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(p134 + p135 + p136 + p137 + p138 + p140 + p141 + p142 + p143 + p144 + p146 + p147 + p148 + p149 + p150 + p152 + p153 + p154 + p155 + p156 + p158 + p159 + p160 + p161 + p162 + p164 + p165 + p166 + p167 + p168 + p169 + p163 + p157 + p151 + p145 + p139) : MAX(p128 + p129 + p130 + p131 + p132 + p133) : MAX(p116 + p117 + p118 + p119 + p120 + p121) : MAX(p122 + p123 + p124 + p125 + p126 + p127)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p128 + p129 + p130 + p131 + p132 + p133)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p128 + p129 + p130 + p131 + p132 + p133)
lola: processed formula length: 44
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: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 190 markings, 189 edges
lola: ========================================
lola: subprocess 1 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p116 + p117 + p118 + p119 + p120 + p121)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p116 + p117 + p118 + p119 + p120 + p121)
lola: processed formula length: 44
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: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 301 markings, 300 edges
lola: ========================================
lola: subprocess 2 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p122 + p123 + p124 + p125 + p126 + p127)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p122 + p123 + p124 + p125 + p126 + p127)
lola: processed formula length: 44
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: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 226 markings, 225 edges
lola: ========================================
lola: subprocess 3 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p134 + p135 + p136 + p137 + p138 + p140 + p141 + p142 + p143 + p144 + p146 + p147 + p148 + p149 + p150 + p152 + p153 + p154 + p155 + p156 + p158 + p159 + p160 + p161 + p162 + p164 + p165 + p166 + p167 + p168 + p169 + p163 + p157 + p151 + p145 + p139)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p134 + p135 + p136 + p137 + p138 + p140 + p141 + p142 + p143 + p144 + p146 + p147 + p148 + p149 + p150 + p152 + p153 + p154 + p155 + p156 + p158 + p159 + p160 + p161 + p162 + p164 + p165 + p166 + p167 + p168 + p169 + p163 + p157 + p151 + p145 + p139)
lola: processed formula length: 254
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: 6
lola: SUBRESULT
lola: result: 6
lola: produced by: state space
lola: The maximum value of the given expression is 6
lola: 7 markings, 6 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: 6 6 6 6
lola:
preliminary result: 6 6 6 6
lola: memory consumption: 17388 KB
lola: time consumption: 3 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="NeoElection-COL-6"
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 NeoElection-COL-6, 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 r174-csrt-158987852900253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeoElection-COL-6.tgz
mv NeoElection-COL-6 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 ;