About the Execution of ITS-LoLa for LamportFastMutEx-PT-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15727.570 | 3600000.00 | 380970.00 | 108.30 | 5 1 5 4 1 20 1 4 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r184-oct2-158987928900669.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 LamportFastMutEx-PT-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928900669
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 5.3K Apr 30 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 30 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 30 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 12K Apr 30 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 30 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 30 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 30 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 30 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 30 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Apr 30 13:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 30 13:04 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 30 13:04 instance
-rw-r--r-- 1 mcc users 6 Apr 30 13:04 iscolored
-rw-r--r-- 1 mcc users 152K 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 LamportFastMutEx-PT-5-UpperBounds-00
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-01
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-02
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-03
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-04
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-05
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-06
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-07
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-08
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-09
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-10
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-11
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-12
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-13
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-14
FORMULA_NAME LamportFastMutEx-PT-5-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1591218396219
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 21:06:37] [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-03 21:06:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 21:06:37] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2020-06-03 21:06:37] [INFO ] Transformed 174 places.
[2020-06-03 21:06:37] [INFO ] Transformed 318 transitions.
[2020-06-03 21:06:37] [INFO ] Parsed PT model containing 174 places and 318 transitions in 97 ms.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 58 transitions.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
[2020-06-03 21:06:37] [INFO ] Flatten gal took : 50 ms
FORMULA LamportFastMutEx-PT-5-UpperBounds-04 1 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-03 21:06:37] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2020-06-03 21:06:37] [INFO ] Computed 37 place invariants in 7 ms
Support contains 50 out of 137 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 15 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 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-03 21:06:37] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2020-06-03 21:06:37] [INFO ] Computed 37 place invariants in 3 ms
Support contains 50 out of 137 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 9 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Starting structural reductions, iteration 0 : 137/137 places, 260/260 transitions.
Applied a total of 0 rules in 7 ms. Remains 137 /137 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2020-06-03 21:06:37] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2020-06-03 21:06:37] [INFO ] Computed 37 place invariants in 1 ms
[2020-06-03 21:06:38] [INFO ] Implicit Places using invariants in 192 ms returned []
[2020-06-03 21:06:38] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2020-06-03 21:06:38] [INFO ] Computed 37 place invariants in 1 ms
[2020-06-03 21:06:38] [INFO ] State equation strengthened by 65 read => feed constraints.
[2020-06-03 21:06:38] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2020-06-03 21:06:38] [INFO ] Redundant transitions in 6 ms returned []
[2020-06-03 21:06:38] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2020-06-03 21:06:38] [INFO ] Computed 37 place invariants in 1 ms
[2020-06-03 21:06:38] [INFO ] Dead Transitions using invariants and state equation in 171 ms returned []
Finished structural reductions, in 1 iterations. Remains : 137/137 places, 260/260 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 137 transition count 200
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 70 place count 132 transition count 220
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 132 transition count 216
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 128 transition count 216
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 91 place count 128 transition count 216
Applied a total of 91 rules in 17 ms. Remains 128 /137 variables (removed 9) and now considering 216/260 (removed 44) transitions.
// Phase 1: matrix 216 rows 128 cols
[2020-06-03 21:06:38] [INFO ] Computed 37 place invariants in 1 ms
[2020-06-03 21:06:38] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2020-06-03 21:06:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ LamportFastMutEx-PT-5 @ 3570 seconds
FORMULA LamportFastMutEx-PT-5-UpperBounds-08 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-5-UpperBounds-09 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-5-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-5-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-5-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-5-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-5-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-5-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-5-UpperBounds-02 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-5-UpperBounds-03 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-5-UpperBounds-06 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-5-UpperBounds-07 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-5-UpperBounds-00 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-5-UpperBounds-01 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA LamportFastMutEx-PT-5-UpperBounds-05 20 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3199
rslt: Output for UpperBounds @ LamportFastMutEx-PT-5
{
"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": "Wed Jun 3 21:06:38 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p96)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 10,
"markings": 11,
"produced_by": "search",
"value": 1
},
"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": 254
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p66)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "search",
"value": 1
},
"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": 274
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p19)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 1
},
"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": 297
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p127)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 5,
"markings": 6,
"produced_by": "search",
"value": 1
},
"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": 324
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p117)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "search",
"value": 1
},
"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": 356
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p49)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "search",
"value": 1
},
"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": 396
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p119)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 17,
"markings": 18,
"produced_by": "search",
"value": 1
},
"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": 445
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p63)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "search",
"value": 1
},
"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": 509
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p0 + p1 + p2 + p3 + p4)",
"processed_size": 27,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 5
},
"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": 594
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p87 + p88 + p89 + p90 + p91)",
"processed_size": 32,
"rewrites": 0
},
"result":
{
"edges": 41542969,
"markings": 11665309,
"produced_by": "search",
"value": 4
},
"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": 695
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p127 + p128 + p129 + p130 + p131)",
"processed_size": 37,
"rewrites": 0
},
"result":
{
"edges": 30766706,
"markings": 9591427,
"produced_by": "search",
"value": 1
},
"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": 853
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p87 + p88 + p89 + p90 + p91)",
"processed_size": 32,
"rewrites": 0
},
"result":
{
"edges": 41542969,
"markings": 11665309,
"produced_by": "search",
"value": 4
},
"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": 1111
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p132 + p133 + p134 + p135 + p136)",
"processed_size": 37,
"rewrites": 0
},
"result":
{
"edges": 30,
"markings": 31,
"produced_by": "search",
"value": 5
},
"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": 1667
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p127 + p128 + p129 + p130 + p131)",
"processed_size": 37,
"rewrites": 0
},
"result":
{
"edges": 30766706,
"markings": 9591427,
"produced_by": "search",
"value": 1
},
"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": 3279
},
"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": 25,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 25,
"visible_transitions": 0
},
"processed": "MAX(p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86)",
"processed_size": 152,
"rewrites": 0
},
"result":
{
"edges": 41542969,
"markings": 11665309,
"produced_by": "search",
"value": 20
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 19820,
"runtime": 371.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(*)"
},
"net":
{
"arcs": 1120,
"conflict_clusters": 8,
"places": 137,
"places_significant": 100,
"singleton_clusters": 0,
"transitions": 260
},
"result":
{
"preliminary_value": "5 1 5 4 20 1 4 1 1 1 1 1 1 1 1 ",
"value": "5 1 5 4 20 1 4 1 1 1 1 1 1 1 1 "
},
"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: 397/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4384
lola: finding significant places
lola: 137 places, 260 transitions, 100 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(p132 + p133 + p134 + p135 + p136) : MAX(p127 + p128 + p129 + p130 + p131) : MAX(p0 + p1 + p2 + p3 + p4) : MAX(p87 + p88 + p89 + p90 + p91) : MAX(p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86) : MAX(p127 + p128 + p129 + p130 + p131) : MAX(p87 + p88 + p89 + p90 + p91) : MAX(p96) : MAX(p66) : MAX(p19) : MAX(p127) : MAX(p117) : MAX(p49) : MAX(p119) : MAX(p63)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p96)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p96)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p66)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p66)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 2 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p19)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p19)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p127)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p127)
lola: processed formula length: 9
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p117)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p117)
lola: processed formula length: 9
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 5 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p49)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p49)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p119)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p119)
lola: processed formula length: 9
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 7 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p63)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p63)
lola: processed formula length: 8
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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 8 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 27
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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p87 + p88 + p89 + p90 + p91)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p87 + p88 + p89 + p90 + p91)
lola: processed formula length: 32
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: 5
lola: 1012430 markings, 2063138 edges, 202486 markings/sec, 0 secs
lola: 1829240 markings, 4291319 edges, 163362 markings/sec, 5 secs
lola: 2580455 markings, 6530432 edges, 150243 markings/sec, 10 secs
lola: 3322983 markings, 8913910 edges, 148506 markings/sec, 15 secs
lola: 4073463 markings, 11334648 edges, 150096 markings/sec, 20 secs
lola: 4806348 markings, 13790365 edges, 146577 markings/sec, 25 secs
lola: 5531414 markings, 16194470 edges, 145013 markings/sec, 30 secs
lola: 6257121 markings, 18644469 edges, 145141 markings/sec, 35 secs
lola: 6973521 markings, 21169165 edges, 143280 markings/sec, 40 secs
lola: 7690876 markings, 23722412 edges, 143471 markings/sec, 45 secs
lola: 8368456 markings, 26152216 edges, 135516 markings/sec, 50 secs
lola: 9007606 markings, 28424260 edges, 127830 markings/sec, 55 secs
lola: 9636120 markings, 30705497 edges, 125703 markings/sec, 60 secs
lola: 10259535 markings, 33066972 edges, 124683 markings/sec, 65 secs
lola: 10685433 markings, 35317773 edges, 85180 markings/sec, 70 secs
lola: 11083605 markings, 37404839 edges, 79634 markings/sec, 75 secs
lola: 11420808 markings, 39494157 edges, 67441 markings/sec, 80 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 11665309 markings, 41542969 edges
lola: ========================================
lola: subprocess 10 will run for 695 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p127 + p128 + p129 + p130 + p131)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p127 + p128 + p129 + p130 + p131)
lola: processed formula length: 37
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: 5
lola: 1306250 markings, 2201245 edges, 261250 markings/sec, 0 secs
lola: 2368075 markings, 4616407 edges, 212365 markings/sec, 5 secs
lola: 3328116 markings, 6913595 edges, 192008 markings/sec, 10 secs
lola: 4221759 markings, 9186465 edges, 178729 markings/sec, 15 secs
lola: 5089027 markings, 11492522 edges, 173454 markings/sec, 20 secs
lola: 5917442 markings, 13822498 edges, 165683 markings/sec, 25 secs
lola: 6736257 markings, 16180578 edges, 163763 markings/sec, 30 secs
lola: 7565724 markings, 18577684 edges, 165893 markings/sec, 35 secs
lola: 8370104 markings, 21148409 edges, 160876 markings/sec, 40 secs
lola: 8973262 markings, 23823271 edges, 120632 markings/sec, 45 secs
lola: 9326998 markings, 26487731 edges, 70747 markings/sec, 50 secs
lola: 9541293 markings, 29133365 edges, 42859 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 9591427 markings, 30766706 edges
lola: ========================================
lola: subprocess 11 will run for 853 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p87 + p88 + p89 + p90 + p91)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p87 + p88 + p89 + p90 + p91)
lola: processed formula length: 32
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: 5
lola: 1032579 markings, 2114031 edges, 206516 markings/sec, 0 secs
lola: 1862119 markings, 4386271 edges, 165908 markings/sec, 5 secs
lola: 2643958 markings, 6727947 edges, 156368 markings/sec, 10 secs
lola: 3431195 markings, 9264601 edges, 157447 markings/sec, 15 secs
lola: 4212485 markings, 11812758 edges, 156258 markings/sec, 20 secs
lola: 4996137 markings, 14416508 edges, 156730 markings/sec, 25 secs
lola: 5768599 markings, 17003930 edges, 154492 markings/sec, 30 secs
lola: 6541484 markings, 19613917 edges, 154577 markings/sec, 35 secs
lola: 7291987 markings, 22290221 edges, 150101 markings/sec, 40 secs
lola: 8035064 markings, 24955759 edges, 148615 markings/sec, 45 secs
lola: 8767665 markings, 27561555 edges, 146520 markings/sec, 50 secs
lola: 9480473 markings, 30138306 edges, 142562 markings/sec, 55 secs
lola: 10193154 markings, 32776457 edges, 142536 markings/sec, 60 secs
lola: 10715510 markings, 35478612 edges, 104471 markings/sec, 65 secs
lola: 11199189 markings, 38099525 edges, 96736 markings/sec, 70 secs
lola: 11607487 markings, 40894409 edges, 81660 markings/sec, 75 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 11665309 markings, 41542969 edges
lola: ========================================
lola: subprocess 12 will run for 1111 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p132 + p133 + p134 + p135 + p136)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p132 + p133 + p134 + p135 + p136)
lola: processed formula length: 37
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: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 31 markings, 30 edges
lola: subprocess 13 will run for 1667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p127 + p128 + p129 + p130 + p131)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p127 + p128 + p129 + p130 + p131)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: ========================================
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: 5
lola: 1339433 markings, 2267871 edges, 267887 markings/sec, 0 secs
lola: 2465654 markings, 4862042 edges, 225244 markings/sec, 5 secs
lola: 3540871 markings, 7442810 edges, 215043 markings/sec, 10 secs
lola: 4563254 markings, 10080321 edges, 204477 markings/sec, 15 secs
lola: 5541810 markings, 12765121 edges, 195711 markings/sec, 20 secs
lola: 6495031 markings, 15493962 edges, 190644 markings/sec, 25 secs
lola: 7443309 markings, 18235061 edges, 189656 markings/sec, 30 secs
lola: 8338803 markings, 21020415 edges, 179099 markings/sec, 35 secs
lola: 9001301 markings, 24021977 edges, 132500 markings/sec, 40 secs
lola: 9390306 markings, 27171859 edges, 77801 markings/sec, 45 secs
lola: 9591361 markings, 30765693 edges, 40211 markings/sec, 50 secs
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 9591427 markings, 30766706 edges
lola: ========================================
lola: subprocess 14 will run for 3279 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86)
lola: processed formula length: 152
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: 25
lola: 1076013 markings, 2224707 edges, 215203 markings/sec, 0 secs
lola: 1971660 markings, 4713298 edges, 179129 markings/sec, 5 secs
lola: 2811804 markings, 7258966 edges, 168029 markings/sec, 10 secs
lola: 3621759 markings, 9872588 edges, 161991 markings/sec, 15 secs
lola: 4412072 markings, 12479519 edges, 158063 markings/sec, 20 secs
lola: 5188805 markings, 15043157 edges, 155347 markings/sec, 25 secs
lola: 5955821 markings, 17624913 edges, 153403 markings/sec, 30 secs
lola: 6717299 markings, 20230847 edges, 152296 markings/sec, 35 secs
lola: 7460310 markings, 22898243 edges, 148602 markings/sec, 40 secs
lola: 8197323 markings, 25544454 edges, 147403 markings/sec, 45 secs
lola: 8922929 markings, 28121462 edges, 145121 markings/sec, 50 secs
lola: 9633616 markings, 30697310 edges, 142137 markings/sec, 55 secs
lola: 10313104 markings, 33327217 edges, 135898 markings/sec, 60 secs
lola: 10811454 markings, 35975911 edges, 99670 markings/sec, 65 secs
lola: 11277154 markings, 38591931 edges, 93140 markings/sec, 70 secs
lola: 11662967 markings, 41469477 edges, 77163 markings/sec, 75 secs
lola: SUBRESULT
lola: result: 20
lola: produced by: state space
lola: The maximum value of the given expression is 20
lola: 11665309 markings, 41542969 edges
lola: RESULT
lola:
SUMMARY: 5 1 5 4 20 1 4 1 1 1 1 1 1 1 1
lola:
preliminary result: 5 1 5 4 20 1 4 1 1 1 1 1 1 1 1
lola: ========================================
lola: memory consumption: 19820 KB
lola: time consumption: 371 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="LamportFastMutEx-PT-5"
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 LamportFastMutEx-PT-5, 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 r184-oct2-158987928900669"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-5.tgz
mv LamportFastMutEx-PT-5 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 '
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 ;