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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 4.1K Apr 12 05:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 05:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 04:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 04:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 10 12:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 10 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 17:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 17:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S02J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-COL-S02J04T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1591139250527

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:07: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-02 23:07:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:07:32] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-02 23:07:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 603 ms
[2020-06-02 23:07:33] [INFO ] sort/places :
D4->DisablePollingE,DisablePollingB,Insert_Source_B,P_1119,P_2579,
Threads->AwakeTasks,IdleTasks,NotifyEventJobQueuedE,QueueJobE,P_2321,TryAllocateOneTaskE,TryAllocateOneTaskB,P_2318,EnablePollingE,EnablePollingB,FetchJobB,ScheduleTaskE_Check,ScheduleTaskB,Abort_Check_Sources_E,Abort_Check_Sources_B,NotifyEventSourceAddedB,Insert_Source_E,NotifyEventSourceAddedE,P_1113,ProcessingEvt,P_1155,nyo,P_1158,P_1159,P_1160,NotifyEventEndOfCheckSourcesB,NotifyEventEndOfCheckSourcesE,Check_Sources_B,Check_Sources_E,Idle,NotifyEventJobCompletedE,NotifyEventJobCompletedB,RunE,RunB,Perform_Work_E,Try_Check_Sources_B,Try_Check_Sources_E,P_1617,ScheduleTaskE_Idle,
D6->CreatedJobs,
Jobs->P_1725,P_1724,P_1712,AvailableJobId,
Dot->cJobCnt,JobCnt,cBlockedTasks,PollingAbort,cPollingAbort,BlockedTasks,MarkerWrite,P_1727,P_1726,MarkerRead,P_1717,P_1716,CanInjectEvent,SigAbort,NoSigAbort,P_1093,P_1095,P_1097,P_1099,cSources,cIsMonitoring,IsMonitoring,cIdleTasks,ORB_Lock,
Sources->DataOnSrc,PlaceSources,ModifiedSrc,AbourtToModifySrc,
D1->NotifyEventJobQueuedB,QueueJobB,FetchJobE,ScheduleTaskE_Work,

[2020-06-02 23:07:33] [INFO ] ms2 symmetric to ms1 in transition T_1124
[2020-06-02 23:07:33] [INFO ] ms3 symmetric to ms2 in transition T_1125
[2020-06-02 23:07:33] [INFO ] ms2 symmetric to ms1 in transition T_1125
[2020-06-02 23:07:33] [INFO ] ms3 symmetric to ms2 in transition T_1126
[2020-06-02 23:07:33] [INFO ] ms2 symmetric to ms1 in transition T_1126
[2020-06-02 23:07:33] [INFO ] ms1 symmetric to ms4 in transition T_1126
[2020-06-02 23:07:33] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 476 PT places and 952.0 transition bindings in 24 ms.
[2020-06-02 23:07:33] [INFO ] Computed order based on color domains.
[2020-06-02 23:07:33] [INFO ] Unfolded HLPN to a Petri net with 476 places and 824 transitions in 23 ms.
[2020-06-02 23:07:33] [INFO ] Unfolded HLPN properties in 0 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 46 ms.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2020-06-02 23:07:33] [INFO ] Flatten gal took : 94 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 )
[2020-06-02 23:07:33] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2020-06-02 23:07:33] [INFO ] Computed 46 place invariants in 35 ms
Support contains 76 out of 476 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 474 transition count 794
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 444 transition count 794
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 62 place count 444 transition count 752
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 146 place count 402 transition count 752
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 170 place count 390 transition count 740
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 176 place count 390 transition count 734
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 182 place count 384 transition count 734
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 188 place count 384 transition count 734
Applied a total of 188 rules in 130 ms. Remains 384 /476 variables (removed 92) and now considering 734/824 (removed 90) transitions.
[2020-06-02 23:07:33] [INFO ] Flow matrix only has 722 transitions (discarded 12 similar events)
// Phase 1: matrix 722 rows 384 cols
[2020-06-02 23:07:33] [INFO ] Computed 44 place invariants in 17 ms
[2020-06-02 23:07:34] [INFO ] Dead Transitions using invariants and state equation in 1431 ms returned [332, 333, 334, 335, 336, 337, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403]
Found 66 dead transitions using SMT.
Drop transitions removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions :[403, 402, 401, 400, 399, 398, 397, 396, 395, 394, 393, 392, 391, 390, 389, 388, 387, 386, 385, 384, 383, 382, 381, 380, 379, 378, 377, 376, 375, 374, 373, 372, 371, 370, 369, 368, 367, 366, 365, 364, 363, 362, 361, 360, 359, 358, 357, 356, 355, 354, 353, 352, 351, 350, 349, 348, 347, 346, 345, 344, 337, 336, 335, 334, 333, 332]
Starting structural reductions, iteration 1 : 384/476 places, 668/824 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 382 transition count 656
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 370 transition count 644
Applied a total of 14 rules in 27 ms. Remains 370 /384 variables (removed 14) and now considering 644/668 (removed 24) transitions.
Finished structural reductions, in 2 iterations. Remains : 370/476 places, 644/824 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2020-06-02 23:07:35] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
// Phase 1: matrix 632 rows 370 cols
[2020-06-02 23:07:35] [INFO ] Computed 44 place invariants in 14 ms
Support contains 76 out of 370 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 370/370 places, 644/644 transitions.
Applied a total of 0 rules in 18 ms. Remains 370 /370 variables (removed 0) and now considering 644/644 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 370/370 places, 644/644 transitions.
Starting structural reductions, iteration 0 : 370/370 places, 644/644 transitions.
Applied a total of 0 rules in 17 ms. Remains 370 /370 variables (removed 0) and now considering 644/644 (removed 0) transitions.
[2020-06-02 23:07:35] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
// Phase 1: matrix 632 rows 370 cols
[2020-06-02 23:07:35] [INFO ] Computed 44 place invariants in 13 ms
[2020-06-02 23:07:35] [INFO ] Implicit Places using invariants in 560 ms returned []
[2020-06-02 23:07:35] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
// Phase 1: matrix 632 rows 370 cols
[2020-06-02 23:07:35] [INFO ] Computed 44 place invariants in 43 ms
[2020-06-02 23:07:36] [INFO ] State equation strengthened by 78 read => feed constraints.
[2020-06-02 23:07:39] [INFO ] Implicit Places using invariants and state equation in 4033 ms returned []
Implicit Place search using SMT with State Equation took 4594 ms to find 0 implicit places.
[2020-06-02 23:07:39] [INFO ] Redundant transitions in 63 ms returned []
[2020-06-02 23:07:39] [INFO ] Flow matrix only has 632 transitions (discarded 12 similar events)
// Phase 1: matrix 632 rows 370 cols
[2020-06-02 23:07:39] [INFO ] Computed 44 place invariants in 15 ms
[2020-06-02 23:07:40] [INFO ] Dead Transitions using invariants and state equation in 1032 ms returned []
Finished structural reductions, in 1 iterations. Remains : 370/370 places, 644/644 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 370 transition count 632
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 24 place count 364 transition count 632
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 364 transition count 626
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 36 place count 358 transition count 626
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 358 transition count 620
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 352 transition count 620
Partial Post-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 72 place count 352 transition count 620
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 84 place count 352 transition count 608
Applied a total of 84 rules in 84 ms. Remains 352 /370 variables (removed 18) and now considering 608/644 (removed 36) transitions.
// Phase 1: matrix 608 rows 352 cols
[2020-06-02 23:07:40] [INFO ] Computed 44 place invariants in 9 ms
[2020-06-02 23:07:40] [INFO ] Export to MCC properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2020-06-02 23:07:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 9 ms.
info: Time: 3600 - MCC
vrfy: Checking UpperBounds @ PolyORBLF-COL-S02J04T06 @ 3570 seconds

FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-01 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-13 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-00 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-09 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-06 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-07 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-08 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-02 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-04 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-05 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-14 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA PolyORBLF-COL-S02J04T06-UpperBounds-03 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3028
rslt: Output for UpperBounds @ PolyORBLF-COL-S02J04T06

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=UpperBounds.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--timelimit=3570",
"--localtimelimit=0",
"--json=UpperBounds.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue Jun 2 23:07:41 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 223
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "MAX(p183)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 68,
"markings": 69,
"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(p207)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"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(p110)",
"processed_size": 9,
"rewrites": 0
},
"result":
{
"edges": 12,
"markings": 13,
"produced_by": "search",
"value": 10
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "MAX(p208 + p209)",
"processed_size": 16,
"rewrites": 0
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "search",
"value": 2
},
"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": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "MAX(p146 + p147 + p148 + p149 + p150)",
"processed_size": 37,
"rewrites": 0
},
"result":
{
"edges": 22,
"markings": 23,
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p322 + p323 + p324 + p325 + p326 + p327)",
"processed_size": 44,
"rewrites": 0
},
"result":
{
"edges": 51,
"markings": 52,
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p296 + p297 + p298 + p299 + p300 + p301)",
"processed_size": 44,
"rewrites": 0
},
"result":
{
"edges": 11,
"markings": 12,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p195 + p196 + p197 + p198 + p199 + p200)",
"processed_size": 44,
"rewrites": 0
},
"result":
{
"edges": 13,
"markings": 14,
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p2 + p3 + p4 + p5 + p6 + p7)",
"processed_size": 32,
"rewrites": 0
},
"result":
{
"edges": 33737990,
"markings": 21501163,
"produced_by": "search",
"value": 5
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 468
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p296 + p297 + p298 + p299 + p300 + p301)",
"processed_size": 44,
"rewrites": 0
},
"result":
{
"edges": 11,
"markings": 12,
"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": 547
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p334 + p335 + p336 + p337 + p338 + p339)",
"processed_size": 44,
"rewrites": 0
},
"result":
{
"edges": 14,
"markings": 15,
"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": 656
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p236 + p237 + p238 + p239 + p240 + p241)",
"processed_size": 44,
"rewrites": 0
},
"result":
{
"edges": 49,
"markings": 50,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 820
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p284 + p285 + p286 + p287 + p288 + p289)",
"processed_size": 44,
"rewrites": 0
},
"result":
{
"edges": 9,
"markings": 10,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1093
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p318 + p319 + p320 + p321 + p317 + p316)",
"processed_size": 44,
"rewrites": 0
},
"result":
{
"edges": 32370552,
"markings": 21167652,
"produced_by": "search",
"value": 5
},
"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": 1514
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "MAX(p272 + p273 + p274 + p275 + p276 + p277)",
"processed_size": 44,
"rewrites": 0
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3028
},
"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": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "MAX(p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235)",
"processed_size": 86,
"rewrites": 0
},
"result":
{
"edges": 35,
"markings": 36,
"produced_by": "search",
"value": 1
},
"task":
{
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "bound preserving/insertion"
},
"type": "dfs"
},
"type": "bound",
"workflow": "search"
}
}
],
"exit":
{
"error": null,
"memory": 22824,
"runtime": 542.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": 3004,
"conflict_clusters": 83,
"places": 370,
"places_significant": 326,
"singleton_clusters": 0,
"transitions": 644
},
"result":
{
"preliminary_value": "2 1 5 1 1 1 1 1 1 1 1 1 1 10 5 1 ",
"value": "2 1 5 1 1 1 1 1 1 1 1 1 1 10 5 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: 1014/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 11840
lola: finding significant places
lola: 370 places, 644 transitions, 326 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(p208 + p209) : MAX(p183) : MAX(p2 + p3 + p4 + p5 + p6 + p7) : MAX(p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235) : MAX(p334 + p335 + p336 + p337 + p338 + p339) : MAX(p284 + p285 + p286 + p287 + p288 + p289) : MAX(p322 + p323 + p324 + p325 + p326 + p327) : MAX(p296 + p297 + p298 + p299 + p300 + p301) : MAX(p195 + p196 + p197 + p198 + p199 + p200) : MAX(p146 + p147 + p148 + p149 + p150) : MAX(p296 + p297 + p298 + p299 + p300 + p301) : MAX(p207) : MAX(p236 + p237 + p238 + p239 + p240 + p241) : MAX(p110) : MAX(p318 + p319 + p320 + p321 + p317 + p316) : MAX(p272 + p273 + p274 + p275 + p276 + p277)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p183)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p183)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 69 markings, 68 edges
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p207)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p207)
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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p110)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p110)
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: 10
lola: SUBRESULT
lola: result: 10
lola: produced by: state space
lola: The maximum value of the given expression is 10
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p208 + p209)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p208 + p209)
lola: processed formula length: 16
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: 2
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p146 + p147 + p148 + p149 + p150)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p146 + p147 + p148 + p149 + p150)
lola: processed formula length: 37
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p322 + p323 + p324 + p325 + p326 + p327)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p322 + p323 + p324 + p325 + p326 + p327)
lola: processed formula length: 44
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 52 markings, 51 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p296 + p297 + p298 + p299 + p300 + p301)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p296 + p297 + p298 + p299 + p300 + p301)
lola: processed formula length: 44
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p195 + p196 + p197 + p198 + p199 + p200)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p195 + p196 + p197 + p198 + p199 + p200)
lola: processed formula length: 44
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p2 + p3 + p4 + p5 + p6 + p7)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p2 + p3 + p4 + p5 + p6 + p7)
lola: processed formula length: 32
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: 0 markings, 0 edges, 0 markings/sec, 5 secs
lola: 0 markings, 0 edges, 0 markings/sec, 10 secs
lola: 0 markings, 0 edges, 0 markings/sec, 15 secs
lola: 0 markings, 0 edges, 0 markings/sec, 20 secs
lola: 0 markings, 0 edges, 0 markings/sec, 25 secs
lola: Structural Bound: 4294967295
lola: 444446 markings, 516011 edges, 88889 markings/sec, 30 secs
lola: 889967 markings, 1060667 edges, 89104 markings/sec, 35 secs
lola: 1353131 markings, 1630628 edges, 92633 markings/sec, 40 secs
lola: 1794741 markings, 2181706 edges, 88322 markings/sec, 45 secs
lola: 2249135 markings, 2760995 edges, 90879 markings/sec, 50 secs
lola: 2714649 markings, 3383762 edges, 93103 markings/sec, 55 secs
lola: 3181938 markings, 4005204 edges, 93458 markings/sec, 60 secs
lola: 3611962 markings, 4587859 edges, 86005 markings/sec, 65 secs
lola: 4043452 markings, 5185213 edges, 86298 markings/sec, 70 secs
lola: 4498261 markings, 5818326 edges, 90962 markings/sec, 75 secs
lola: 4967524 markings, 6483137 edges, 93853 markings/sec, 80 secs
lola: 5430577 markings, 7152998 edges, 92611 markings/sec, 85 secs
lola: 5904906 markings, 7817490 edges, 94866 markings/sec, 90 secs
lola: 6368482 markings, 8512412 edges, 92715 markings/sec, 95 secs
lola: 6784628 markings, 9232750 edges, 83229 markings/sec, 100 secs
lola: 7202366 markings, 9838910 edges, 83548 markings/sec, 105 secs
lola: 7611049 markings, 10484789 edges, 81737 markings/sec, 110 secs
lola: 8041795 markings, 11113220 edges, 86149 markings/sec, 115 secs
lola: 8487792 markings, 11839165 edges, 89199 markings/sec, 120 secs
lola: 8931554 markings, 12557691 edges, 88752 markings/sec, 125 secs
lola: 9369872 markings, 13288373 edges, 87664 markings/sec, 130 secs
lola: 9801537 markings, 14055242 edges, 86333 markings/sec, 135 secs
lola: 10229875 markings, 14837141 edges, 85668 markings/sec, 140 secs
lola: 10643314 markings, 15670285 edges, 82688 markings/sec, 145 secs
lola: 11064629 markings, 16461606 edges, 84263 markings/sec, 150 secs
lola: 11485245 markings, 17233454 edges, 84123 markings/sec, 155 secs
lola: 11933030 markings, 17881783 edges, 89557 markings/sec, 160 secs
lola: 12345219 markings, 18490470 edges, 82438 markings/sec, 165 secs
lola: 12745302 markings, 19098621 edges, 80017 markings/sec, 170 secs
lola: 13159244 markings, 19739614 edges, 82788 markings/sec, 175 secs
lola: 13582693 markings, 20391556 edges, 84690 markings/sec, 180 secs
lola: 14025588 markings, 21068186 edges, 88579 markings/sec, 185 secs
lola: 14463296 markings, 21748192 edges, 87542 markings/sec, 190 secs
lola: 14867126 markings, 22373165 edges, 80766 markings/sec, 195 secs
lola: 15275703 markings, 23007168 edges, 81715 markings/sec, 200 secs
lola: 15704413 markings, 23683021 edges, 85742 markings/sec, 205 secs
lola: 16109161 markings, 24319614 edges, 80950 markings/sec, 210 secs
lola: 16523641 markings, 24969314 edges, 82896 markings/sec, 215 secs
lola: 16938082 markings, 25616071 edges, 82888 markings/sec, 220 secs
lola: 17347292 markings, 26256139 edges, 81842 markings/sec, 225 secs
lola: 17767627 markings, 26914559 edges, 84067 markings/sec, 230 secs
lola: 18187980 markings, 27587250 edges, 84071 markings/sec, 235 secs
lola: 18611455 markings, 28258103 edges, 84695 markings/sec, 240 secs
lola: 19029394 markings, 28953771 edges, 83588 markings/sec, 245 secs
lola: 19426848 markings, 29707612 edges, 79491 markings/sec, 250 secs
lola: 19834821 markings, 30460360 edges, 81595 markings/sec, 255 secs
lola: 20226799 markings, 31242397 edges, 78396 markings/sec, 260 secs
lola: 20617537 markings, 32021306 edges, 78148 markings/sec, 265 secs
lola: 21004632 markings, 32784566 edges, 77419 markings/sec, 270 secs
lola: 21391444 markings, 33534377 edges, 77362 markings/sec, 275 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 21501163 markings, 33737990 edges
lola: ========================================
lola: subprocess 9 will run for 468 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p296 + p297 + p298 + p299 + p300 + p301)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p296 + p297 + p298 + p299 + p300 + p301)
lola: processed formula length: 44
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p334 + p335 + p336 + p337 + p338 + p339)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p334 + p335 + p336 + p337 + p338 + p339)
lola: processed formula length: 44
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 11 will run for 656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p236 + p237 + p238 + p239 + p240 + p241)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p236 + p237 + p238 + p239 + p240 + p241)
lola: processed formula length: 44
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 50 markings, 49 edges
lola: ========================================
lola: subprocess 12 will run for 820 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p284 + p285 + p286 + p287 + p288 + p289)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p284 + p285 + p286 + p287 + p288 + p289)
lola: processed formula length: 44
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 13 will run for 1093 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p318 + p319 + p320 + p321 + p317 + p316)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p318 + p319 + p320 + p321 + p317 + p316)
lola: processed formula length: 44
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 6
lola: 438739 markings, 539080 edges, 87748 markings/sec, 0 secs
lola: 875080 markings, 1096185 edges, 87268 markings/sec, 5 secs
lola: 1284816 markings, 1629578 edges, 81947 markings/sec, 10 secs
lola: 1727190 markings, 2222053 edges, 88475 markings/sec, 15 secs
lola: 2168749 markings, 2819899 edges, 88312 markings/sec, 20 secs
lola: 2621470 markings, 3404393 edges, 90544 markings/sec, 25 secs
lola: 3078709 markings, 3990328 edges, 91448 markings/sec, 30 secs
lola: 3532161 markings, 4580465 edges, 90690 markings/sec, 35 secs
lola: 3983264 markings, 5172734 edges, 90221 markings/sec, 40 secs
lola: 4431747 markings, 5764837 edges, 89697 markings/sec, 45 secs
lola: 4871775 markings, 6404017 edges, 88006 markings/sec, 50 secs
lola: 5321875 markings, 7005637 edges, 90020 markings/sec, 55 secs
lola: 5766212 markings, 7632643 edges, 88867 markings/sec, 60 secs
lola: 6203773 markings, 8279455 edges, 87512 markings/sec, 65 secs
lola: 6651977 markings, 8877476 edges, 89641 markings/sec, 70 secs
lola: 7099066 markings, 9475488 edges, 89418 markings/sec, 75 secs
lola: 7539235 markings, 10099185 edges, 88034 markings/sec, 80 secs
lola: 7974369 markings, 10747175 edges, 87027 markings/sec, 85 secs
lola: 8404893 markings, 11414199 edges, 86105 markings/sec, 90 secs
lola: 8831591 markings, 12097388 edges, 85340 markings/sec, 95 secs
lola: 9261199 markings, 12763353 edges, 85922 markings/sec, 100 secs
lola: 9688923 markings, 13439612 edges, 85545 markings/sec, 105 secs
lola: 10103921 markings, 14095804 edges, 83000 markings/sec, 110 secs
lola: 10482347 markings, 14684994 edges, 75685 markings/sec, 115 secs
lola: 10885695 markings, 15323047 edges, 80670 markings/sec, 120 secs
lola: 11308757 markings, 15957257 edges, 84612 markings/sec, 125 secs
lola: 11726504 markings, 16586689 edges, 83549 markings/sec, 130 secs
lola: 12151507 markings, 17231206 edges, 85001 markings/sec, 135 secs
lola: 12576592 markings, 17887784 edges, 85017 markings/sec, 140 secs
lola: 13000851 markings, 18551054 edges, 84852 markings/sec, 145 secs
lola: 13421788 markings, 19204014 edges, 84187 markings/sec, 150 secs
lola: 13839853 markings, 19852779 edges, 83613 markings/sec, 155 secs
lola: 14254138 markings, 20514541 edges, 82857 markings/sec, 160 secs
lola: 14669381 markings, 21168802 edges, 83049 markings/sec, 165 secs
lola: 15085582 markings, 21831093 edges, 83240 markings/sec, 170 secs
lola: 15496800 markings, 22488754 edges, 82244 markings/sec, 175 secs
lola: 15907840 markings, 23153277 edges, 82208 markings/sec, 180 secs
lola: 16319816 markings, 23807830 edges, 82395 markings/sec, 185 secs
lola: 16728786 markings, 24470140 edges, 81794 markings/sec, 190 secs
lola: 17134028 markings, 25146064 edges, 81048 markings/sec, 195 secs
lola: 17539641 markings, 25821963 edges, 81123 markings/sec, 200 secs
lola: 17943851 markings, 26503662 edges, 80842 markings/sec, 205 secs
lola: 18343408 markings, 27178835 edges, 79911 markings/sec, 210 secs
lola: 18738595 markings, 27864494 edges, 79037 markings/sec, 215 secs
lola: 19133633 markings, 28546722 edges, 79008 markings/sec, 220 secs
lola: 19523852 markings, 29241906 edges, 78044 markings/sec, 225 secs
lola: 19911921 markings, 29926599 edges, 77614 markings/sec, 230 secs
lola: 20293770 markings, 30630495 edges, 76370 markings/sec, 235 secs
lola: 20669777 markings, 31346574 edges, 75201 markings/sec, 240 secs
lola: 21035040 markings, 32071361 edges, 73053 markings/sec, 245 secs
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 21167652 markings, 32370552 edges
lola: ========================================
lola: subprocess 14 will run for 1514 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p272 + p273 + p274 + p275 + p276 + p277)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p272 + p273 + p274 + p275 + p276 + p277)
lola: processed formula length: 44
lola: 0 rewrites
lola: closed formula file UpperBounds.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 15 will run for 3028 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235)
lola: processed formula length: 86
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: RESULT
lola:
SUMMARY: 2 1 5 1 1 1 1 1 1 1 1 1 1 10 5 1
lola:
preliminary result: 2 1 5 1 1 1 1 1 1 1 1 1 1 10 5 1
lola: ========================================
lola: memory consumption: 22824 KB
lola: time consumption: 542 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="PolyORBLF-COL-S02J04T06"
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 PolyORBLF-COL-S02J04T06, 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-158987871600269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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