About the Execution of ITS-LoLa for ShieldPPPt-PT-040B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15740.480 | 3600000.00 | 62388.00 | 76.40 | 1 1 1 1 1 1 1 1 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 '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033477800709.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldPPPt-PT-040B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477800709
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 3.9K May 14 01:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 01:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 19:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 19:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 4.1K May 13 14:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 13 14:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 08:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 08:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 762K May 12 20:42 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 ShieldPPPt-PT-040B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1591323021303
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 02:10:23] [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-05 02:10:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 02:10:23] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2020-06-05 02:10:23] [INFO ] Transformed 3123 places.
[2020-06-05 02:10:23] [INFO ] Transformed 2843 transitions.
[2020-06-05 02:10:23] [INFO ] Found NUPN structural information;
[2020-06-05 02:10:23] [INFO ] Parsed PT model containing 3123 places and 2843 transitions in 255 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 103 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
[2020-06-05 02:10:24] [INFO ] Flatten gal took : 179 ms
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 2843 rows 3123 cols
[2020-06-05 02:10:24] [INFO ] Computed 441 place invariants in 52 ms
Support contains 16 out of 3123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Performed 757 Post agglomeration using F-continuation condition.Transition count delta: 757
Iterating post reduction 0 with 757 rules applied. Total rules applied 757 place count 3123 transition count 2086
Reduce places removed 757 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 759 rules applied. Total rules applied 1516 place count 2366 transition count 2084
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1517 place count 2365 transition count 2084
Performed 162 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 162 Pre rules applied. Total rules applied 1517 place count 2365 transition count 1922
Deduced a syphon composed of 162 places in 8 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 3 with 324 rules applied. Total rules applied 1841 place count 2203 transition count 1922
Symmetric choice reduction at 3 with 277 rule applications. Total rules 2118 place count 2203 transition count 1922
Deduced a syphon composed of 277 places in 10 ms
Reduce places removed 277 places and 277 transitions.
Iterating global reduction 3 with 554 rules applied. Total rules applied 2672 place count 1926 transition count 1645
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 2672 place count 1926 transition count 1530
Deduced a syphon composed of 115 places in 7 ms
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 2902 place count 1811 transition count 1530
Performed 674 Post agglomeration using F-continuation condition.Transition count delta: 674
Deduced a syphon composed of 674 places in 2 ms
Reduce places removed 674 places and 0 transitions.
Iterating global reduction 3 with 1348 rules applied. Total rules applied 4250 place count 1137 transition count 856
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4452 place count 1036 transition count 856
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 4478 place count 1023 transition count 856
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4479 place count 1023 transition count 855
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4480 place count 1022 transition count 855
Partial Free-agglomeration rule applied 115 times.
Drop transitions removed 115 transitions
Iterating global reduction 4 with 115 rules applied. Total rules applied 4595 place count 1022 transition count 855
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4596 place count 1021 transition count 854
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4597 place count 1020 transition count 854
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4597 place count 1020 transition count 852
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4601 place count 1018 transition count 852
Applied a total of 4601 rules in 1364 ms. Remains 1018 /3123 variables (removed 2105) and now considering 852/2843 (removed 1991) transitions.
Finished structural reductions, in 1 iterations. Remains : 1018/3123 places, 852/2843 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 852 rows 1018 cols
[2020-06-05 02:10:25] [INFO ] Computed 440 place invariants in 5 ms
Support contains 16 out of 1018 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1018/1018 places, 852/852 transitions.
Applied a total of 0 rules in 55 ms. Remains 1018 /1018 variables (removed 0) and now considering 852/852 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1018/1018 places, 852/852 transitions.
Starting structural reductions, iteration 0 : 1018/1018 places, 852/852 transitions.
Applied a total of 0 rules in 44 ms. Remains 1018 /1018 variables (removed 0) and now considering 852/852 (removed 0) transitions.
// Phase 1: matrix 852 rows 1018 cols
[2020-06-05 02:10:25] [INFO ] Computed 440 place invariants in 3 ms
[2020-06-05 02:10:28] [INFO ] Implicit Places using invariants in 2937 ms returned [999, 1003]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 2946 ms to find 2 implicit places.
[2020-06-05 02:10:28] [INFO ] Redundant transitions in 81 ms returned []
// Phase 1: matrix 852 rows 1016 cols
[2020-06-05 02:10:28] [INFO ] Computed 438 place invariants in 6 ms
[2020-06-05 02:10:31] [INFO ] Dead Transitions using invariants and state equation in 2979 ms returned []
Starting structural reductions, iteration 1 : 1016/1018 places, 852/852 transitions.
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1016 transition count 852
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 1014 transition count 850
Applied a total of 6 rules in 143 ms. Remains 1014 /1016 variables (removed 2) and now considering 850/852 (removed 2) transitions.
// Phase 1: matrix 850 rows 1014 cols
[2020-06-05 02:10:31] [INFO ] Computed 438 place invariants in 8 ms
[2020-06-05 02:10:34] [INFO ] Implicit Places using invariants in 2822 ms returned []
// Phase 1: matrix 850 rows 1014 cols
[2020-06-05 02:10:34] [INFO ] Computed 438 place invariants in 5 ms
[2020-06-05 02:10:36] [INFO ] State equation strengthened by 202 read => feed constraints.
[2020-06-05 02:10:47] [INFO ] Implicit Places using invariants and state equation in 12332 ms returned []
Implicit Place search using SMT with State Equation took 15157 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1014/1018 places, 850/852 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
// Phase 1: matrix 850 rows 1014 cols
[2020-06-05 02:10:47] [INFO ] Computed 438 place invariants in 3 ms
Support contains 16 out of 1014 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1014/1014 places, 850/850 transitions.
Applied a total of 0 rules in 21 ms. Remains 1014 /1014 variables (removed 0) and now considering 850/850 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1014/1014 places, 850/850 transitions.
Starting structural reductions, iteration 0 : 1014/1014 places, 850/850 transitions.
Applied a total of 0 rules in 28 ms. Remains 1014 /1014 variables (removed 0) and now considering 850/850 (removed 0) transitions.
// Phase 1: matrix 850 rows 1014 cols
[2020-06-05 02:10:47] [INFO ] Computed 438 place invariants in 3 ms
[2020-06-05 02:10:49] [INFO ] Implicit Places using invariants in 2324 ms returned []
// Phase 1: matrix 850 rows 1014 cols
[2020-06-05 02:10:49] [INFO ] Computed 438 place invariants in 7 ms
[2020-06-05 02:10:51] [INFO ] State equation strengthened by 202 read => feed constraints.
[2020-06-05 02:11:02] [INFO ] Implicit Places using invariants and state equation in 12815 ms returned []
Implicit Place search using SMT with State Equation took 15141 ms to find 0 implicit places.
[2020-06-05 02:11:02] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 850 rows 1014 cols
[2020-06-05 02:11:02] [INFO ] Computed 438 place invariants in 10 ms
[2020-06-05 02:11:04] [INFO ] Dead Transitions using invariants and state equation in 2358 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1014/1014 places, 850/850 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Partial Free-agglomeration rule applied 251 times.
Drop transitions removed 251 transitions
Iterating global reduction 0 with 251 rules applied. Total rules applied 251 place count 1014 transition count 850
Partial Post-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 262 place count 1014 transition count 850
Applied a total of 262 rules in 115 ms. Remains 1014 /1014 variables (removed 0) and now considering 850/850 (removed 0) transitions.
// Phase 1: matrix 850 rows 1014 cols
[2020-06-05 02:11:04] [INFO ] Computed 438 place invariants in 2 ms
[2020-06-05 02:11:04] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2020-06-05 02:11:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 16 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ ShieldPPPt-PT-040B @ 3570 seconds
FORMULA ShieldPPPt-PT-040B-UpperBounds-00 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-040B-UpperBounds-01 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-040B-UpperBounds-02 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-040B-UpperBounds-03 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-040B-UpperBounds-04 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-040B-UpperBounds-05 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-040B-UpperBounds-06 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-040B-UpperBounds-07 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-040B-UpperBounds-08 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-040B-UpperBounds-09 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-040B-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-040B-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-040B-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-040B-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-040B-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPt-PT-040B-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for UpperBounds @ ShieldPPPt-PT-040B
{
"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": "Fri Jun 5 02:11:05 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 223
},
"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(p248)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 70,
"markings": 71,
"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": 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(p1)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"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": 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(p496)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 4,
"markings": 5,
"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": 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(p1010)",
"processed_size": 10,
"rewrites": 0
},
"result":
{
"edges": 2,
"markings": 3,
"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": 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(p565)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 46,
"markings": 47,
"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": 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": 89,
"markings": 90,
"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": 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(p108)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 4,
"markings": 5,
"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": 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(p282)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 68,
"markings": 69,
"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": 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(p736)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 37,
"markings": 38,
"produced_by": "search",
"value": 1
},
"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": 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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p935)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "search",
"value": 1
},
"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": 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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p667)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 3,
"markings": 4,
"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": 713
},
"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(p430)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 61,
"markings": 62,
"produced_by": "search",
"value": 1
},
"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": 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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p130)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 81,
"markings": 82,
"produced_by": "search",
"value": 1
},
"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": 1188
},
"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(p813)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 28,
"markings": 29,
"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": 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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p328)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 69,
"markings": 70,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"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(p614)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 24664,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "UpperBounds.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*) : MAX(*)"
},
"net":
{
"arcs": 3922,
"conflict_clusters": 345,
"places": 1014,
"places_significant": 576,
"singleton_clusters": 0,
"transitions": 850
},
"result":
{
"preliminary_value": "1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ",
"value": "1 1 1 1 1 1 1 1 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: 1864/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 32448
lola: finding significant places
lola: 1014 places, 850 transitions, 576 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(p248) : MAX(p1) : MAX(p496) : MAX(p1010) : MAX(p565) : MAX(p117) : MAX(p108) : MAX(p282) : MAX(p736) : MAX(p935) : MAX(p667) : MAX(p430) : MAX(p130) : MAX(p813) : MAX(p328) : MAX(p614)
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(p248)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p248)
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: 71 markings, 70 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1)
lola: processed formula length: 7
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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p496)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p496)
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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1010)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1010)
lola: processed formula length: 10
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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p565)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p565)
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: 47 markings, 46 edges
lola: ========================================
lola: subprocess 5 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: 90 markings, 89 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p108)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p108)
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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p282)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p282)
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: 69 markings, 68 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p736)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p736)
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: 38 markings, 37 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p935)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p935)
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: 10 markings, 9 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p667)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p667)
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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p430)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p430)
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: 62 markings, 61 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p130)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p130)
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: 82 markings, 81 edges
lola: ========================================
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p813)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p813)
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: 29 markings, 28 edges
lola: ========================================
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p328)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p328)
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: 70 markings, 69 edges
lola: ========================================
lola: subprocess 15 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p614)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p614)
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: 5 markings, 4 edges
lola: RESULT
lola:
SUMMARY: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
lola:
preliminary result: 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
lola: ========================================
lola: memory consumption: 24664 KB
lola: time consumption: 4 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="ShieldPPPt-PT-040B"
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 ShieldPPPt-PT-040B, 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 r211-tajo-159033477800709"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-PT-040B 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 ;