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-158987872400829.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-PT-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872400829
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 47K Apr 12 07:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 12 07:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 07:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 35K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 34K Apr 10 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 10 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 9 20:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 9 20:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.8M 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-PT-32-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-32-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591184731252

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 11:45:32] [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 11:45:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 11:45:33] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2020-06-03 11:45:33] [INFO ] Transformed 3806 places.
[2020-06-03 11:45:33] [INFO ] Transformed 506 transitions.
[2020-06-03 11:45:33] [INFO ] Parsed PT model containing 3806 places and 506 transitions in 227 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 32 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2020-06-03 11:45:33] [INFO ] Flatten gal took : 257 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 506 rows 3806 cols
[2020-06-03 11:45:33] [INFO ] Computed 3301 place invariants in 152 ms
Support contains 176 out of 3806 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3806/3806 places, 506/506 transitions.
Discarding 37 places :
Also discarding 0 output transitions
Graph (complete) has 43474 edges and 3806 vertex of which 3769 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.27 ms
Drop transitions removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Iterating post reduction 0 with 200 rules applied. Total rules applied 201 place count 3736 transition count 339
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 201 place count 3736 transition count 309
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 1 with 60 rules applied. Total rules applied 261 place count 3706 transition count 309
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 1 with 62 rules applied. Total rules applied 323 place count 3675 transition count 278
Applied a total of 323 rules in 854 ms. Remains 3675 /3806 variables (removed 131) and now considering 278/506 (removed 228) transitions.
Finished structural reductions, in 1 iterations. Remains : 3675/3806 places, 278/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 278 rows 3675 cols
[2020-06-03 11:45:34] [INFO ] Computed 3397 place invariants in 108 ms
Support contains 176 out of 3675 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3675/3675 places, 278/278 transitions.
Applied a total of 0 rules in 367 ms. Remains 3675 /3675 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3675/3675 places, 278/278 transitions.
Starting structural reductions, iteration 0 : 3675/3675 places, 278/278 transitions.
Applied a total of 0 rules in 189 ms. Remains 3675 /3675 variables (removed 0) and now considering 278/278 (removed 0) transitions.
// Phase 1: matrix 278 rows 3675 cols
[2020-06-03 11:45:35] [INFO ] Computed 3397 place invariants in 36 ms
[2020-06-03 11:45:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 11:46:14] [INFO ] Performed 1216/3675 implicitness test of which 67 returned IMPLICIT in 30 seconds.
[2020-06-03 11:46:44] [INFO ] Performed 2466/3675 implicitness test of which 67 returned IMPLICIT in 60 seconds.
[2020-06-03 11:47:03] [INFO ] Implicit Places using invariants in 87700 ms returned [38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 71, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 153]
Discarding 67 places :
Implicit Place search using SMT only with invariants took 87716 ms to find 67 implicit places.
[2020-06-03 11:47:03] [INFO ] Redundant transitions in 50 ms returned []
// Phase 1: matrix 278 rows 3608 cols
[2020-06-03 11:47:03] [INFO ] Computed 3330 place invariants in 31 ms
[2020-06-03 11:47:15] [INFO ] Dead Transitions using invariants and state equation in 12027 ms returned []
Starting structural reductions, iteration 1 : 3608/3675 places, 278/278 transitions.
Applied a total of 0 rules in 242 ms. Remains 3608 /3608 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2020-06-03 11:47:15] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 278 rows 3608 cols
[2020-06-03 11:47:15] [INFO ] Computed 3330 place invariants in 26 ms
[2020-06-03 11:47:27] [INFO ] Dead Transitions using invariants and state equation in 12439 ms returned []
Finished structural reductions, in 2 iterations. Remains : 3608/3675 places, 278/278 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 278 rows 3608 cols
[2020-06-03 11:47:27] [INFO ] Computed 3330 place invariants in 22 ms
Support contains 176 out of 3608 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3608/3608 places, 278/278 transitions.
Applied a total of 0 rules in 271 ms. Remains 3608 /3608 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3608/3608 places, 278/278 transitions.
Starting structural reductions, iteration 0 : 3608/3608 places, 278/278 transitions.
Applied a total of 0 rules in 225 ms. Remains 3608 /3608 variables (removed 0) and now considering 278/278 (removed 0) transitions.
// Phase 1: matrix 278 rows 3608 cols
[2020-06-03 11:47:28] [INFO ] Computed 3330 place invariants in 19 ms
[2020-06-03 11:48:06] [INFO ] Performed 1701/3608 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-06-03 11:48:36] [INFO ] Implicit Places using invariants in 68224 ms returned []
// Phase 1: matrix 278 rows 3608 cols
[2020-06-03 11:48:36] [INFO ] Computed 3330 place invariants in 24 ms
[2020-06-03 11:49:36] [INFO ] Performed 1051/3608 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-06-03 11:50:06] [INFO ] Performed 1743/3608 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2020-06-03 11:50:37] [INFO ] Performed 2164/3608 implicitness test of which 31 returned IMPLICIT in 90 seconds.
[2020-06-03 11:51:07] [INFO ] Performed 2446/3608 implicitness test of which 33 returned IMPLICIT in 121 seconds.
[2020-06-03 11:51:16] [INFO ] Implicit Places with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (and (>= s2158 1) (>= s2185 1) (>= s2386 1) (>= s2417 1) (>= s2452 1) (>= s2487 1) (>= s2511 1) (>= s2540 1) (>= s2569 1) (>= s2602 1) (>= s2616 1) (>= s2651 1) (>= s2686 1) (>= s2717 1) (>= s2757 1) (>= s2819 1) (>= s2848 1) (>= s2874 1) (>= s2905 1) (>= s2940 1) (>= s2975 1) (>= s3015 1) (>= s3044 1) (>= s3073 1) (>= s3106 1) (>= s3152 1) (>= s3222 1) (>= s3253 1) (>= s3277 1) (>= s3310 1) (>= s3339 1) (>= s3368 1) (< s2790 1))") after 160045 ms
Discarding 33 places :
Implicit Place search using SMT with State Equation took 228279 ms to find 33 implicit places.
[2020-06-03 11:51:16] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 278 rows 3575 cols
[2020-06-03 11:51:16] [INFO ] Computed 3297 place invariants in 32 ms
[2020-06-03 11:51:28] [INFO ] Dead Transitions using invariants and state equation in 11601 ms returned []
Starting structural reductions, iteration 1 : 3575/3608 places, 278/278 transitions.
Applied a total of 0 rules in 258 ms. Remains 3575 /3575 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2020-06-03 11:51:28] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 278 rows 3575 cols
[2020-06-03 11:51:28] [INFO ] Computed 3297 place invariants in 19 ms
[2020-06-03 11:51:40] [INFO ] Dead Transitions using invariants and state equation in 11681 ms returned []
Finished structural reductions, in 2 iterations. Remains : 3575/3608 places, 278/278 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 278 rows 3575 cols
[2020-06-03 11:51:40] [INFO ] Computed 3297 place invariants in 13 ms
Support contains 176 out of 3575 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3575/3575 places, 278/278 transitions.
Applied a total of 0 rules in 173 ms. Remains 3575 /3575 variables (removed 0) and now considering 278/278 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3575/3575 places, 278/278 transitions.
Starting structural reductions, iteration 0 : 3575/3575 places, 278/278 transitions.
Applied a total of 0 rules in 202 ms. Remains 3575 /3575 variables (removed 0) and now considering 278/278 (removed 0) transitions.
// Phase 1: matrix 278 rows 3575 cols
[2020-06-03 11:51:40] [INFO ] Computed 3297 place invariants in 16 ms
[2020-06-03 11:52:18] [INFO ] Performed 1398/3575 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-06-03 11:52:48] [INFO ] Performed 3174/3575 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2020-06-03 11:52:53] [INFO ] Implicit Places using invariants in 72388 ms returned []
// Phase 1: matrix 278 rows 3575 cols
[2020-06-03 11:52:53] [INFO ] Computed 3297 place invariants in 21 ms
[2020-06-03 11:53:32] [INFO ] Performed 1171/3575 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-06-03 11:54:02] [INFO ] Performed 2753/3575 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2020-06-03 11:54:16] [INFO ] Implicit Places using invariants and state equation in 83152 ms returned []
Implicit Place search using SMT with State Equation took 155542 ms to find 0 implicit places.
[2020-06-03 11:54:16] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 278 rows 3575 cols
[2020-06-03 11:54:16] [INFO ] Computed 3297 place invariants in 15 ms
[2020-06-03 11:54:29] [INFO ] Dead Transitions using invariants and state equation in 13161 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3575/3575 places, 278/278 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 322 ms. Remains 3575 /3575 variables (removed 0) and now considering 278/278 (removed 0) transitions.
// Phase 1: matrix 278 rows 3575 cols
[2020-06-03 11:54:29] [INFO ] Computed 3297 place invariants in 18 ms
[2020-06-03 11:54:29] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2020-06-03 11:54:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 34 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ QuasiCertifProtocol-PT-32 @ 3570 seconds

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-04 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-05 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-06 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-08 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-09 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-02 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-07 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-03 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-00 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-01 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3556
rslt: Output for UpperBounds @ QuasiCertifProtocol-PT-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 11:54:30 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(p73)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 35,
"markings": 36,
"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(p74)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 70,
"markings": 71,
"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(p88)",
"processed_size": 8,
"rewrites": 0
},
"result":
{
"edges": 69,
"markings": 70,
"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(p925)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 139,
"markings": 140,
"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(p2293)",
"processed_size": 10,
"rewrites": 0
},
"result":
{
"edges": 72,
"markings": 73,
"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(p2555)",
"processed_size": 10,
"rewrites": 0
},
"result":
{
"edges": 106,
"markings": 107,
"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(p342)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 139,
"markings": 140,
"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": 395
},
"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(p2938)",
"processed_size": 10,
"rewrites": 0
},
"result":
{
"edges": 106,
"markings": 107,
"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(p2968)",
"processed_size": 10,
"rewrites": 0
},
"result":
{
"edges": 106,
"markings": 107,
"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": 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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p1364)",
"processed_size": 10,
"rewrites": 0
},
"result":
{
"edges": 72,
"markings": 73,
"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": 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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p2138)",
"processed_size": 10,
"rewrites": 0
},
"result":
{
"edges": 106,
"markings": 107,
"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": 711
},
"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(p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p44 + p43 + p42 + p41 + p40 + p39)",
"processed_size": 200,
"rewrites": 0
},
"result":
{
"edges": 68,
"markings": 69,
"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": 889
},
"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(p3486 + p3485 + p3484 + p3483 + p3481 + p3478 + p3477 + p3476 + p3475 + p3474 + p3473 + p3472 + p3471 + p3470 + p3469 + p3468 + p3467 + p3466 + p3465 + p3464 + p3463 + p3462 + p3461 + p3460 + p3459 + p3458 + p3457 + p3456 + p3455 + p3450 + p3449 + p3448 + p3447)",
"processed_size": 266,
"rewrites": 0
},
"result":
{
"edges": 68,
"markings": 69,
"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(p3158 + p3157 + p3156 + p3155 + p3154 + p3153 + p3152 + p3151 + p3548 + p3551 + p3552 + p3553 + p3554 + p3555 + p3556 + p3557 + p3558 + p3559 + p3560 + p3561 + p3562 + p3563 + p3564 + p3565 + p3566 + p3567 + p3568 + p3569 + p3570 + p3571 + p3572 + p3573 + p3574)",
"processed_size": 266,
"rewrites": 0
},
"result":
{
"edges": 1,
"markings": 2,
"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(p3352 + p3353 + p3354 + p3355 + p3356 + p3357 + p3358 + p3359 + p3360 + p3361 + p3362 + p3363 + p3364 + p3365 + p3366 + p3367 + p3368 + p3369 + p3370 + p3371 + p3372 + p3373 + p3374 + p3375 + p3376 + p3377 + p3378 + p3379 + p3380 + p3381 + p3382 + p3391 + p3392)",
"processed_size": 266,
"rewrites": 0
},
"result":
{
"edges": 175,
"markings": 176,
"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(p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)",
"processed_size": 191,
"rewrites": 0
},
"result":
{
"edges": 138,
"markings": 139,
"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": 31828,
"runtime": 14.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": 7249,
"conflict_clusters": 177,
"places": 3575,
"places_significant": 278,
"singleton_clusters": 0,
"transitions": 278
},
"result":
{
"preliminary_value": "33 33 33 33 1 1 1 33 1 1 1 1 1 1 1 1 ",
"value": "33 33 33 33 1 1 1 33 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: 3853/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 114400
lola: finding significant places
lola: 3575 places, 278 transitions, 278 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(p3352 + p3353 + p3354 + p3355 + p3356 + p3357 + p3358 + p3359 + p3360 + p3361 + p3362 + p3363 + p3364 + p3365 + p3366 + p3367 + p3368 + p3369 + p3370 + p3371 + p3372 + p3373 + p3374 + p3375 + p3376 + p3377 + p3378 + p3379 + p3380 + p3381 + p3382 + p3391 + p3392) : MAX(p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) : MAX(p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p44 + p43 + p42 + p41 + p40 + p39) : MAX(p3158 + p3157 + p3156 + p3155 + p3154 + p3153 + p3152 + p3151 + p3548 + p3551 + p3552 + p3553 + p3554 + p3555 + p3556 + p3557 + p3558 + p3559 + p3560 + p3561 + p3562 + p3563 + p3564 + p3565 + p3566 + p3567 + p3568 + p3569 + p3570 + p3571 + p3572 + p3573 + p3574) : MAX(p73) : MAX(p74) : MAX(p88) : MAX(p3486 + p3485 + p3484 + p3483 + p3481 + p3478 + p3477 + p3476 + p3475 + p3474 + p3473 + p3472 + p3471 + p3470 + p3469 + p3468 + p3467 + p3466 + p3465 + p3464 + p3463 + p3462 + p3461 + p3460 + p3459 + p3458 + p3457 + p3456 + p3455 + p3450 + p3449 + p3448 + p3447) : MAX(p925) : MAX(p2293) : MAX(p2555) : MAX(p342) : MAX(p2938) : MAX(p2968) : MAX(p1364) : MAX(p2138)
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(p73)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p73)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 36 markings, 35 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p74)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p74)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 71 markings, 70 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p88)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p88)
lola: processed formula length: 8
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 70 markings, 69 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p925)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p925)
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: 140 markings, 139 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2293)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2293)
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: 73 markings, 72 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2555)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2555)
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: 107 markings, 106 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p342)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p342)
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: 140 markings, 139 edges
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2938)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2938)
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: 107 markings, 106 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2968)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2968)
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: 107 markings, 106 edges
lola: ========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1364)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1364)
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: 73 markings, 72 edges
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2138)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2138)
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: 107 markings, 106 edges
lola: ========================================
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p44 + p43 + p42 + p41 + p40 + p39)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p44 + p43 + p42 + p41 + p40 + p39)
lola: processed formula length: 200
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: 69 markings, 68 edges
lola: ========================================
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3486 + p3485 + p3484 + p3483 + p3481 + p3478 + p3477 + p3476 + p3475 + p3474 + p3473 + p3472 + p3471 + p3470 + p3469 + p3468 + p3467 + p3466 + p3465 + p3464 + p3463 + p3462 + p3461 + p3460 + p3459 + p3458 + p3457 + p3456 + p3455 + p3450 + p3449 + p3448 + p3447)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3486 + p3485 + p3484 + p3483 + p3481 + p3478 + p3477 + p3476 + p3475 + p3474 + p3473 + p3472 + p3471 + p3470 + p3469 + p3468 + p3467 + p3466 + p3465 + p3464 + p3463 + p3462 + p3461 + p3460 + p3459 + p3458 + p3457 + p3456 + p3455 + p3450 + p3449 + p3448 + p3447)
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: 69 markings, 68 edges
lola: ========================================
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3158 + p3157 + p3156 + p3155 + p3154 + p3153 + p3152 + p3151 + p3548 + p3551 + p3552 + p3553 + p3554 + p3555 + p3556 + p3557 + p3558 + p3559 + p3560 + p3561 + p3562 + p3563 + p3564 + p3565 + p3566 + p3567 + p3568 + p3569 + p3570 + p3571 + p3572 + p3573 + p3574)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3158 + p3157 + p3156 + p3155 + p3154 + p3153 + p3152 + p3151 + p3548 + p3551 + p3552 + p3553 + p3554 + p3555 + p3556 + p3557 + p3558 + p3559 + p3560 + p3561 + p3562 + p3563 + p3564 + p3565 + p3566 + p3567 + p3568 + p3569 + p3570 + p3571 + p3572 + p3573 + p3574)
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 14 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p3352 + p3353 + p3354 + p3355 + p3356 + p3357 + p3358 + p3359 + p3360 + p3361 + p3362 + p3363 + p3364 + p3365 + p3366 + p3367 + p3368 + p3369 + p3370 + p3371 + p3372 + p3373 + p3374 + p3375 + p3376 + p3377 + p3378 + p3379 + p3380 + p3381 + p3382 + p3391 + p3392)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p3352 + p3353 + p3354 + p3355 + p3356 + p3357 + p3358 + p3359 + p3360 + p3361 + p3362 + p3363 + p3364 + p3365 + p3366 + p3367 + p3368 + p3369 + p3370 + p3371 + p3372 + p3373 + p3374 + p3375 + p3376 + p3377 + p3378 + p3379 + p3380 + p3381 + p3382 + p3391 + p3392)
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: 176 markings, 175 edges
lola: ========================================
lola: subprocess 15 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p33 + p32 + p31 + p30 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)
lola: processed formula length: 191
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: 139 markings, 138 edges
lola: RESULT
lola:
SUMMARY: 33 33 33 33 1 1 1 33 1 1 1 1 1 1 1 1
lola:
preliminary result: 33 33 33 33 1 1 1 33 1 1 1 1 1 1 1 1
lola: ========================================
lola: memory consumption: 31828 KB
lola: time consumption: 14 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-PT-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-PT-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-158987872400829"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-32.tgz
mv QuasiCertifProtocol-PT-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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;