About the Execution of ITS-LoLa for QuasiCertifProtocol-COL-32
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987872300773.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 QuasiCertifProtocol-COL-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872300773
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 3.7K Apr 12 07:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 07:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 11 07:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 07:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 10 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 20:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 20:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 131K Mar 24 05:37 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 QuasiCertifProtocol-COL-32-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-32-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1591181181757
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:46: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-03 10:46:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:46:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 10:46:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 552 ms
[2020-06-03 10:46:24] [INFO ] sort/places :
tsidxtsid->n9,n8,n7,
Dot->malicious_reservoir,CstopAbort,SstopAbort,AstopAbort,a5,a4,a3,a2,a1,Astart,AstopOK,
tsid->n6,n5,n4,n3,n2,n1,c1,Cstart,Sstart,s2,s3,s4,s5,s6,SstopOK,CstopOK,
[2020-06-03 10:46:24] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 3806 PT places and 506.0 transition bindings in 46 ms.
[2020-06-03 10:46:24] [INFO ] Computed order based on color domains.
[2020-06-03 10:46:24] [INFO ] Unfolded HLPN to a Petri net with 3806 places and 506 transitions in 42 ms.
[2020-06-03 10:46:24] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 77 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 10:46:24] [INFO ] Flatten gal took : 350 ms
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 506 rows 3806 cols
[2020-06-03 10:46:24] [INFO ] Computed 3301 place invariants in 178 ms
Support contains 303 out of 3806 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3806/3806 places, 506/506 transitions.
Discarding 35 places :
Also discarding 0 output transitions
Graph (complete) has 43474 edges and 3806 vertex of which 3771 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.31 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3771 transition count 505
Free-agglomeration rule (complex) applied 33 times.
Iterating global reduction 1 with 33 rules applied. Total rules applied 35 place count 3771 transition count 472
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 68 place count 3738 transition count 472
Partial Post-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 2 with 33 rules applied. Total rules applied 101 place count 3738 transition count 472
Symmetric choice reduction at 2 with 32 rule applications. Total rules 133 place count 3738 transition count 472
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 32 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 197 place count 3706 transition count 440
Applied a total of 197 rules in 1147 ms. Remains 3706 /3806 variables (removed 100) and now considering 440/506 (removed 66) transitions.
Finished structural reductions, in 1 iterations. Remains : 3706/3806 places, 440/506 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 440 rows 3706 cols
[2020-06-03 10:46:26] [INFO ] Computed 3267 place invariants in 103 ms
Support contains 303 out of 3706 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3706/3706 places, 440/440 transitions.
Applied a total of 0 rules in 168 ms. Remains 3706 /3706 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3706/3706 places, 440/440 transitions.
Starting structural reductions, iteration 0 : 3706/3706 places, 440/440 transitions.
Applied a total of 0 rules in 132 ms. Remains 3706 /3706 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 3706 cols
[2020-06-03 10:46:26] [INFO ] Computed 3267 place invariants in 108 ms
[2020-06-03 10:47:04] [INFO ] Performed 2049/3706 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-06-03 10:47:22] [INFO ] Implicit Places using invariants in 56552 ms returned [3703]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56558 ms to find 1 implicit places.
[2020-06-03 10:47:23] [INFO ] Redundant transitions in 152 ms returned []
// Phase 1: matrix 440 rows 3705 cols
[2020-06-03 10:47:23] [INFO ] Computed 3266 place invariants in 54 ms
[2020-06-03 10:47:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:47:35] [INFO ] Dead Transitions using invariants and state equation in 12730 ms returned []
Starting structural reductions, iteration 1 : 3705/3706 places, 440/440 transitions.
Applied a total of 0 rules in 199 ms. Remains 3705 /3705 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2020-06-03 10:47:36] [INFO ] Redundant transitions in 217 ms returned []
// Phase 1: matrix 440 rows 3705 cols
[2020-06-03 10:47:36] [INFO ] Computed 3266 place invariants in 60 ms
[2020-06-03 10:47:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:47:49] [INFO ] Dead Transitions using invariants and state equation in 13242 ms returned []
Finished structural reductions, in 2 iterations. Remains : 3705/3706 places, 440/440 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 440 rows 3705 cols
[2020-06-03 10:47:49] [INFO ] Computed 3266 place invariants in 43 ms
Support contains 303 out of 3705 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3705/3705 places, 440/440 transitions.
Applied a total of 0 rules in 200 ms. Remains 3705 /3705 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3705/3705 places, 440/440 transitions.
Starting structural reductions, iteration 0 : 3705/3705 places, 440/440 transitions.
Applied a total of 0 rules in 188 ms. Remains 3705 /3705 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 3705 cols
[2020-06-03 10:47:50] [INFO ] Computed 3266 place invariants in 57 ms
[2020-06-03 10:48:27] [INFO ] Performed 2150/3705 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-06-03 10:48:44] [INFO ] Implicit Places using invariants in 54161 ms returned []
// Phase 1: matrix 440 rows 3705 cols
[2020-06-03 10:48:44] [INFO ] Computed 3266 place invariants in 51 ms
[2020-06-03 10:48:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:49:33] [INFO ] Performed 1639/3705 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-06-03 10:50:03] [INFO ] Performed 3089/3705 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2020-06-03 10:50:11] [INFO ] Implicit Places using invariants and state equation in 87184 ms returned []
Implicit Place search using SMT with State Equation took 141352 ms to find 0 implicit places.
[2020-06-03 10:50:11] [INFO ] Redundant transitions in 176 ms returned []
// Phase 1: matrix 440 rows 3705 cols
[2020-06-03 10:50:11] [INFO ] Computed 3266 place invariants in 54 ms
[2020-06-03 10:50:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 10:50:13] [INFO ] Dead Transitions using invariants and state equation in 2392 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3705/3705 places, 440/440 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Applied a total of 0 rules in 125 ms. Remains 3705 /3705 variables (removed 0) and now considering 440/440 (removed 0) transitions.
// Phase 1: matrix 440 rows 3705 cols
[2020-06-03 10:50:14] [INFO ] Computed 3266 place invariants in 43 ms
[2020-06-03 10:50:14] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2020-06-03 10:50:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 14 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ QuasiCertifProtocol-COL-32 @ 3570 seconds
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-04 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-05 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-06 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-09 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-10 19 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-02 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-07 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-08 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-03 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-00 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-11 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-12 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-01 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-14 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA QuasiCertifProtocol-COL-32-UpperBounds-15 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3557
rslt: Output for UpperBounds @ QuasiCertifProtocol-COL-32
{
"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 10:50:14 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p3701)",
"processed_size": 10,
"rewrites": 0
},
"result":
{
"edges": 36,
"markings": 37,
"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(p3699)",
"processed_size": 10,
"rewrites": 0
},
"result":
{
"edges": 71,
"markings": 72,
"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(p3700)",
"processed_size": 10,
"rewrites": 0
},
"result":
{
"edges": 70,
"markings": 71,
"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(p3702)",
"processed_size": 10,
"rewrites": 0
},
"result":
{
"edges": 35,
"markings": 36,
"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(p1)",
"processed_size": 7,
"rewrites": 0
},
"result":
{
"edges": 19,
"markings": 20,
"produced_by": "search",
"value": 19
},
"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(p3704)",
"processed_size": 10,
"rewrites": 0
},
"result":
{
"edges": 105,
"markings": 106,
"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": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "MAX(p3631 + p3630 + p3629 + p3628 + p3627 + p3626 + p3625 + p3624 + p3623 + p3622 + p3621 + p3620 + p3619 + p3618 + p3617 + p3616 + p3615 + p3614 + p3613 + p3612 + p3611 + p3610 + p3609 + p3608 + p3607 + p3606 + p3605 + p3604 + p3603 + p3602 + p3601 + p3600 + p3599)",
"processed_size": 266,
"rewrites": 0
},
"result":
{
"edges": 69,
"markings": 70,
"produced_by": "search",
"value": 33
},
"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": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "MAX(p3367 + p3366 + p3365 + p3364 + p3363 + p3362 + p3361 + p3360 + p3359 + p3358 + p3357 + p3356 + p3355 + p3354 + p3353 + p3352 + p3351 + p3350 + p3349 + p3348 + p3347 + p3346 + p3345 + p3344 + p3343 + p3342 + p3341 + p3340 + p3339 + p3338 + p3337 + p3336 + p3335)",
"processed_size": 266,
"rewrites": 0
},
"result":
{
"edges": 69,
"markings": 70,
"produced_by": "search",
"value": 33
},
"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": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "MAX(p3500 + p3501 + p3502 + p3503 + p3504 + p3505 + p3506 + p3507 + p3508 + p3509 + p3510 + p3511 + p3512 + p3513 + p3514 + p3515 + p3516 + p3517 + p3518 + p3519 + p3520 + p3521 + p3522 + p3523 + p3524 + p3525 + p3526 + p3527 + p3528 + p3529 + p3530 + p3531 + p3532)",
"processed_size": 266,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 33
},
"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": 508
},
"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": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "MAX(p3434 + p3435 + p3436 + p3437 + p3438 + p3439 + p3440 + p3441 + p3442 + p3443 + p3444 + p3445 + p3446 + p3447 + p3448 + p3449 + p3450 + p3451 + p3452 + p3453 + p3454 + p3455 + p3456 + p3457 + p3458 + p3459 + p3460 + p3461 + p3462 + p3463 + p3464 + p3465 + p3466)",
"processed_size": 266,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "search",
"value": 33
},
"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": 593
},
"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": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "MAX(p3694 + p3667 + p3666 + p3668 + p3669 + p3670 + p3671 + p3672 + p3673 + p3674 + p3675 + p3676 + p3677 + p3678 + p3679 + p3680 + p3681 + p3682 + p3683 + p3684 + p3685 + p3686 + p3687 + p3688 + p3689 + p3690 + p3691 + p3692 + p3693 + p3695 + p3696 + p3697 + p3698)",
"processed_size": 266,
"rewrites": 0
},
"result":
{
"edges": 170,
"markings": 171,
"produced_by": "search",
"value": 33
},
"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": 712
},
"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": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "MAX(p3598 + p3597 + p3596 + p3595 + p3594 + p3593 + p3592 + p3591 + p3590 + p3589 + p3588 + p3587 + p3586 + p3585 + p3584 + p3583 + p3582 + p3581 + p3580 + p3579 + p3578 + p3577 + p3576 + p3575 + p3574 + p3573 + p3572 + p3571 + p3570 + p3569 + p3568 + p3567 + p3566)",
"processed_size": 266,
"rewrites": 0
},
"result":
{
"edges": 34,
"markings": 35,
"produced_by": "search",
"value": 33
},
"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": 890
},
"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": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "MAX(p3598 + p3597 + p3596 + p3595 + p3594 + p3593 + p3592 + p3591 + p3590 + p3589 + p3588 + p3587 + p3586 + p3585 + p3584 + p3583 + p3582 + p3581 + p3580 + p3579 + p3578 + p3577 + p3576 + p3575 + p3574 + p3573 + p3572 + p3571 + p3570 + p3569 + p3568 + p3567 + p3566)",
"processed_size": 266,
"rewrites": 0
},
"result":
{
"edges": 34,
"markings": 35,
"produced_by": "search",
"value": 33
},
"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": 1186
},
"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": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "MAX(p3499 + p3498 + p3497 + p3496 + p3495 + p3494 + p3493 + p3492 + p3491 + p3490 + p3489 + p3488 + p3487 + p3486 + p3485 + p3484 + p3483 + p3482 + p3481 + p3480 + p3479 + p3478 + p3477 + p3476 + p3475 + p3474 + p3473 + p3472 + p3471 + p3470 + p3469 + p3468 + p3467)",
"processed_size": 266,
"rewrites": 0
},
"result":
{
"edges": 137,
"markings": 138,
"produced_by": "search",
"value": 33
},
"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": 1779
},
"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": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "MAX(p3565 + p3564 + p3563 + p3562 + p3561 + p3560 + p3559 + p3558 + p3557 + p3556 + p3555 + p3554 + p3553 + p3552 + p3551 + p3550 + p3549 + p3548 + p3547 + p3546 + p3545 + p3544 + p3543 + p3542 + p3541 + p3540 + p3539 + p3538 + p3537 + p3536 + p3535 + p3534 + p3533)",
"processed_size": 266,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 33
},
"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": 3557
},
"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": 33,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 33,
"visible_transitions": 0
},
"processed": "MAX(p3433 + p3432 + p3431 + p3430 + p3429 + p3428 + p3427 + p3426 + p3425 + p3424 + p3423 + p3422 + p3421 + p3420 + p3419 + p3418 + p3417 + p3416 + p3415 + p3414 + p3413 + p3412 + p3411 + p3410 + p3409 + p3408 + p3407 + p3406 + p3405 + p3404 + p3403 + p3402 + p3401)",
"processed_size": 266,
"rewrites": 0
},
"result":
{
"edges": 34,
"markings": 35,
"produced_by": "search",
"value": 33
},
"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": 47072,
"runtime": 13.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": 9092,
"conflict_clusters": 75,
"places": 3705,
"places_significant": 439,
"singleton_clusters": 0,
"transitions": 440
},
"result":
{
"preliminary_value": "33 33 33 33 1 1 1 33 33 1 19 33 33 1 33 33 ",
"value": "33 33 33 33 1 1 1 33 33 1 19 33 33 1 33 33 "
},
"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: 4145/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 118560
lola: finding significant places
lola: 3705 places, 440 transitions, 439 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(p3694 + p3667 + p3666 + p3668 + p3669 + p3670 + p3671 + p3672 + p3673 + p3674 + p3675 + p3676 + p3677 + p3678 + p3679 + p3680 + p3681 + p3682 + p3683 + p3684 + p3685 + p3686 + p3687 + p3688 + p3689 + p3690 + p3691 + p3692 + p3693 + p3695 + p3696 + p3697 + p3698) : MAX(p3499 + p3498 + p3497 + p3496 + p3495 + p3494 + p3493 + p3492 + p3491 + p3490 + p3489 + p3488 + p3487 + p3486 + p3485 + p3484 + p3483 + p3482 + p3481 + p3480 + p3479 + p3478 + p3477 + p3476 + p3475 + p3474 + p3473 + p3472 + p3471 + p3470 + p3469 + p3468 + p3467) : MAX(p3631 + p3630 + p3629 + p3628 + p3627 + p3626 + p3625 + p3624 + p3623 + p3622 + p3621 + p3620 + p3619 + p3618 + p3617 + p3616 + p3615 + p3614 + p3613 + p3612 + p3611 + p3610 + p3609 + p3608 + p3607 + p3606 + p3605 + p3604 + p3603 + p3602 + p3601 + p3600 + p3599) : MAX(p3434 + p3435 + p3436 + p3437 + p3438 + p3439 + p3440 + p3441 + p3442 + p3443 + p3444 + p3445 + p3446 + p3447 + p3448 + p3449 + p3450 + p3451 + p3452 + p3453 + p3454 + p3455 + p3456 + p3457 + p3458 + p3459 + p3460 + p3461 + p3462 + p3463 + p3464 + p3465 + p3466) : MAX(p3701) : MAX(p3699) : MAX(p3700) : MAX(p3367 + p3366 + p3365 + p3364 + p3363 + p3362 + p3361 + p3360 + p3359 + p3358 + p3357 + p3356 + p3355 + p3354 + p3353 + p3352 + p3351 + p3350 + p3349 + p3348 + p3347 + p3346 + p3345 + p3344 + p3343 + p3342 + p3341 + p3340 + p3339 + p3338 + p3337 + p3336 + p3335) : MAX(p3500 + p3501 + p3502 + p3503 + p3504 + p3505 + p3506 + p3507 + p3508 + p3509 + p3510 + p3511 + p3512 + p3513 + p3514 + p3515 + p3516 + p3517 + p3518 + p3519 + p3520 + p3521 + p3522 + p3523 + p3524 + p3525 + p3526 + p3527 + p3528 + p3529 + p3530 + p3531 + p3532) : MAX(p3702) : MAX(p1) : MAX(p3598 + p3597 + p3596 + p3595 + p3594 + p3593 + p3592 + p3591 + p3590 + p3589 + p3588 + p3587 + p3586 + p3585 + p3584 + p3583 + p3582 + p3581 + p3580 + p3579 + p3578 + p3577 + p3576 + p3575 + p3574 + p3573 + p3572 + p3571 + p3570 + p3569 + p3568 + p3567 + p3566) : MAX(p3598 + p3597 + p3596 + p3595 + p3594 + p3593 + p3592 + p3591 + p3590 + p3589 + p3588 + p3587 + p3586 + p3585 + p3584 + p3583 + p3582 + p3581 + p3580 + p3579 + p3578 + p3577 + p3576 + p3575 + p3574 + p3573 + p3572 + p3571 + p3570 + p3569 + p3568 + p3567 + p3566) : MAX(p3704) : MAX(p3565 + p3564 + p3563 + p3562 + p3561 + p3560 + p3559 + p3558 + p3557 + p3556 + p3555 + p3554 + p3553 + p3552 + p3551 + p3550 + p3549 + p3548 + p3547 + p3546 + p3545 + p3544 + p3543 + p3542 + p3541 + p3540 + p3539 + p3538 + p3537 + p3536 + p3535 + p3534 + p3533) : MAX(p3433 + p3432 + p3431 + p3430 + p3429 + p3428 + p3427 + p3426 + p3425 + p3424 + p3423 + p3422 + p3421 + p3420 + p3419 + p3418 + p3417 + p3416 + p3415 + p3414 + p3413 + p3412 + p3411 + p3410 + p3409 + p3408 + p3407 + p3406 + p3405 + p3404 + p3403 + p3402 + p3401)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3701)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3701)
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: 37 markings, 36 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3699)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3699)
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: 72 markings, 71 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3700)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3700)
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: 71 markings, 70 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3702)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3702)
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: 36 markings, 35 edges
lola: ========================================
lola: subprocess 4 will run for 297 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: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3704)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3704)
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: 106 markings, 105 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3631 + p3630 + p3629 + p3628 + p3627 + p3626 + p3625 + p3624 + p3623 + p3622 + p3621 + p3620 + p3619 + p3618 + p3617 + p3616 + p3615 + p3614 + p3613 + p3612 + p3611 + p3610 + p3609 + p3608 + p3607 + p3606 + p3605 + p3604 + p3603 + p3602 + p3601 + p3600 + p3599)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3631 + p3630 + p3629 + p3628 + p3627 + p3626 + p3625 + p3624 + p3623 + p3622 + p3621 + p3620 + p3619 + p3618 + p3617 + p3616 + p3615 + p3614 + p3613 + p3612 + p3611 + p3610 + p3609 + p3608 + p3607 + p3606 + p3605 + p3604 + p3603 + p3602 + p3601 + p3600 + p3599)
lola: processed formula length: 266
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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 70 markings, 69 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3367 + p3366 + p3365 + p3364 + p3363 + p3362 + p3361 + p3360 + p3359 + p3358 + p3357 + p3356 + p3355 + p3354 + p3353 + p3352 + p3351 + p3350 + p3349 + p3348 + p3347 + p3346 + p3345 + p3344 + p3343 + p3342 + p3341 + p3340 + p3339 + p3338 + p3337 + p3336 + p3335)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3367 + p3366 + p3365 + p3364 + p3363 + p3362 + p3361 + p3360 + p3359 + p3358 + p3357 + p3356 + p3355 + p3354 + p3353 + p3352 + p3351 + p3350 + p3349 + p3348 + p3347 + p3346 + p3345 + p3344 + p3343 + p3342 + p3341 + p3340 + p3339 + p3338 + p3337 + p3336 + p3335)
lola: processed formula length: 266
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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 70 markings, 69 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3500 + p3501 + p3502 + p3503 + p3504 + p3505 + p3506 + p3507 + p3508 + p3509 + p3510 + p3511 + p3512 + p3513 + p3514 + p3515 + p3516 + p3517 + p3518 + p3519 + p3520 + p3521 + p3522 + p3523 + p3524 + p3525 + p3526 + p3527 + p3528 + p3529 + p3530 + p3531 + p3532)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3500 + p3501 + p3502 + p3503 + p3504 + p3505 + p3506 + p3507 + p3508 + p3509 + p3510 + p3511 + p3512 + p3513 + p3514 + p3515 + p3516 + p3517 + p3518 + p3519 + p3520 + p3521 + p3522 + p3523 + p3524 + p3525 + p3526 + p3527 + p3528 + p3529 + p3530 + p3531 + p3532)
lola: processed formula length: 266
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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3434 + p3435 + p3436 + p3437 + p3438 + p3439 + p3440 + p3441 + p3442 + p3443 + p3444 + p3445 + p3446 + p3447 + p3448 + p3449 + p3450 + p3451 + p3452 + p3453 + p3454 + p3455 + p3456 + p3457 + p3458 + p3459 + p3460 + p3461 + p3462 + p3463 + p3464 + p3465 + p3466)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3434 + p3435 + p3436 + p3437 + p3438 + p3439 + p3440 + p3441 + p3442 + p3443 + p3444 + p3445 + p3446 + p3447 + p3448 + p3449 + p3450 + p3451 + p3452 + p3453 + p3454 + p3455 + p3456 + p3457 + p3458 + p3459 + p3460 + p3461 + p3462 + p3463 + p3464 + p3465 + p3466)
lola: processed formula length: 266
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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3694 + p3667 + p3666 + p3668 + p3669 + p3670 + p3671 + p3672 + p3673 + p3674 + p3675 + p3676 + p3677 + p3678 + p3679 + p3680 + p3681 + p3682 + p3683 + p3684 + p3685 + p3686 + p3687 + p3688 + p3689 + p3690 + p3691 + p3692 + p3693 + p3695 + p3696 + p3697 + p3698)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3694 + p3667 + p3666 + p3668 + p3669 + p3670 + p3671 + p3672 + p3673 + p3674 + p3675 + p3676 + p3677 + p3678 + p3679 + p3680 + p3681 + p3682 + p3683 + p3684 + p3685 + p3686 + p3687 + p3688 + p3689 + p3690 + p3691 + p3692 + p3693 + p3695 + p3696 + p3697 + p3698)
lola: processed formula length: 266
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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 171 markings, 170 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3598 + p3597 + p3596 + p3595 + p3594 + p3593 + p3592 + p3591 + p3590 + p3589 + p3588 + p3587 + p3586 + p3585 + p3584 + p3583 + p3582 + p3581 + p3580 + p3579 + p3578 + p3577 + p3576 + p3575 + p3574 + p3573 + p3572 + p3571 + p3570 + p3569 + p3568 + p3567 + p3566)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3598 + p3597 + p3596 + p3595 + p3594 + p3593 + p3592 + p3591 + p3590 + p3589 + p3588 + p3587 + p3586 + p3585 + p3584 + p3583 + p3582 + p3581 + p3580 + p3579 + p3578 + p3577 + p3576 + p3575 + p3574 + p3573 + p3572 + p3571 + p3570 + p3569 + p3568 + p3567 + p3566)
lola: processed formula length: 266
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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 35 markings, 34 edges
lola: ========================================
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3598 + p3597 + p3596 + p3595 + p3594 + p3593 + p3592 + p3591 + p3590 + p3589 + p3588 + p3587 + p3586 + p3585 + p3584 + p3583 + p3582 + p3581 + p3580 + p3579 + p3578 + p3577 + p3576 + p3575 + p3574 + p3573 + p3572 + p3571 + p3570 + p3569 + p3568 + p3567 + p3566)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3598 + p3597 + p3596 + p3595 + p3594 + p3593 + p3592 + p3591 + p3590 + p3589 + p3588 + p3587 + p3586 + p3585 + p3584 + p3583 + p3582 + p3581 + p3580 + p3579 + p3578 + p3577 + p3576 + p3575 + p3574 + p3573 + p3572 + p3571 + p3570 + p3569 + p3568 + p3567 + p3566)
lola: processed formula length: 266
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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 35 markings, 34 edges
lola: ========================================
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3499 + p3498 + p3497 + p3496 + p3495 + p3494 + p3493 + p3492 + p3491 + p3490 + p3489 + p3488 + p3487 + p3486 + p3485 + p3484 + p3483 + p3482 + p3481 + p3480 + p3479 + p3478 + p3477 + p3476 + p3475 + p3474 + p3473 + p3472 + p3471 + p3470 + p3469 + p3468 + p3467)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3499 + p3498 + p3497 + p3496 + p3495 + p3494 + p3493 + p3492 + p3491 + p3490 + p3489 + p3488 + p3487 + p3486 + p3485 + p3484 + p3483 + p3482 + p3481 + p3480 + p3479 + p3478 + p3477 + p3476 + p3475 + p3474 + p3473 + p3472 + p3471 + p3470 + p3469 + p3468 + p3467)
lola: processed formula length: 266
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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 138 markings, 137 edges
lola: ========================================
lola: subprocess 14 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3565 + p3564 + p3563 + p3562 + p3561 + p3560 + p3559 + p3558 + p3557 + p3556 + p3555 + p3554 + p3553 + p3552 + p3551 + p3550 + p3549 + p3548 + p3547 + p3546 + p3545 + p3544 + p3543 + p3542 + p3541 + p3540 + p3539 + p3538 + p3537 + p3536 + p3535 + p3534 + p3533)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3565 + p3564 + p3563 + p3562 + p3561 + p3560 + p3559 + p3558 + p3557 + p3556 + p3555 + p3554 + p3553 + p3552 + p3551 + p3550 + p3549 + p3548 + p3547 + p3546 + p3545 + p3544 + p3543 + p3542 + p3541 + p3540 + p3539 + p3538 + p3537 + p3536 + p3535 + p3534 + p3533)
lola: processed formula length: 266
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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3433 + p3432 + p3431 + p3430 + p3429 + p3428 + p3427 + p3426 + p3425 + p3424 + p3423 + p3422 + p3421 + p3420 + p3419 + p3418 + p3417 + p3416 + p3415 + p3414 + p3413 + p3412 + p3411 + p3410 + p3409 + p3408 + p3407 + p3406 + p3405 + p3404 + p3403 + p3402 + p3401)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3433 + p3432 + p3431 + p3430 + p3429 + p3428 + p3427 + p3426 + p3425 + p3424 + p3423 + p3422 + p3421 + p3420 + p3419 + p3418 + p3417 + p3416 + p3415 + p3414 + p3413 + p3412 + p3411 + p3410 + p3409 + p3408 + p3407 + p3406 + p3405 + p3404 + p3403 + p3402 + p3401)
lola: processed formula length: 266
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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 35 markings, 34 edges
lola: RESULT
lola:
SUMMARY: 33 33 33 33 1 1 1 33 33 1 19 33 33 1 33 33
lola:
preliminary result: 33 33 33 33 1 1 1 33 33 1 19 33 33 1 33 33
lola: ========================================
lola: memory consumption: 47072 KB
lola: time consumption: 13 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="QuasiCertifProtocol-COL-32"
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 QuasiCertifProtocol-COL-32, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987872300773"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-32.tgz
mv QuasiCertifProtocol-COL-32 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 ;