Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...............................................................................................
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 151K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 585K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 39K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 132K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 232K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 873K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 2.5M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PhilosophersDyn-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666470100877
=====================================================================

--------------------
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 PhilosophersDyn-PT-10-UpperBounds-00
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-01
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-02
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-03
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-04
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-05
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-06
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-07
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-08
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-09
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-10
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-11
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-12
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-13
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-14
FORMULA_NAME PhilosophersDyn-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1527065795311

info: Time: 3600 - MCC
===========================================================================================
prep: translating PhilosophersDyn-PT-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PhilosophersDyn-PT-10 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ PhilosophersDyn-PT-10 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2480/65536 symbol table entries, 65 collisions
lola: preprocessing...
lola: Size of bit vector: 5440
lola: finding significant places
lola: 170 places, 2310 transitions, 131 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4366 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-PT-10-UpperBounds.task
lola: MAX(Neighbourhood_2_10 + Neighbourhood_7_10 + Neighbourhood_1_10 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_1_9 + Neighbourhood_6_10 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhood_2_7 + Neighbourhood_2_8 + Neighbourhood_2_9 + Neighbourhood_3_1 + Neighbourhood_3_2 + Neighbourhood_3_3 + Neighbourhood_3_4 + Neighbourhood_3_5 + Neighbourhood_3_6 + Neighbourhood_3_7 + Neighbourhood_3_8 + Neighbourhood_3_9 + Neighbourhood_10_1 + Neighbourhood_10_2 + Neighbourhood_10_3 + Neighbourhood_10_4 + Neighbourhood_10_5 + Neighbourhood_10_6 + Neighbourhood_10_7 + Neighbourhood_10_8 + Neighbourhood_10_9 + Neighbourhood_4_1 + Neighbourhood_4_2 + Neighbourhood_4_3 + Neighbourhood_4_4 + Neighbourhood_4_5 + Neighbourhood_4_6 + Neighbourhood_4_7 + Neighbourhood_4_8 + Neighbourhood_4_9 + Neighbourhood_5_1 + Neighbourhood_5_2 + Neighbourhood_5_3 + Neighbourhood_5_4 + Neighbourhood_5_5 + Neighbourhood_5_6 + Neighbourhood_5_7 + Neighbourhood_5_8 + Neighbourhood_5_9 + Neighbourhood_6_1 + Neighbourhood_6_2 + Neighbourhood_6_3 + Neighbourhood_6_4 + Neighbourhood_6_5 + Neighbourhood_6_6 + Neighbourhood_6_7 + Neighbourhood_6_8 + Neighbourhood_10_10 + Neighbourhood_7_1 + Neighbourhood_7_2 + Neighbourhood_7_3 + Neighbourhood_7_4 + Neighbourhood_7_5 + Neighbourhood_7_6 + Neighbourhood_7_7 + Neighbourhood_7_8 + Neighbourhood_8_1 + Neighbourhood_8_2 + Neighbourhood_8_3 + Neighbourhood_8_4 + Neighbourhood_8_5 + Neighbourhood_8_6 + Neighbourhood_8_7 + Neighbourhood_8_8 + Neighbourhood_8_9 + Neighbourhood_9_3 + Neighbourhood_9_4 + Neighbourhood_9_5 + Neighbourhood_9_6 + Neighbourhood_9_7 + Neighbourhood_9_8 + Neighbourhood_9_9 + Neighbourhood_9_10 + Neighbourhood_3_10 + Neighbourhood_8_10 + Neighbourhood_9_2 + Neighbourhood_9_1 + Neighbourhood_4_10 + Neighbourhood_7_9 + Neighbourhood_6_9 + Neighbourhood_5_10) : MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10) : MAX(HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9) : MAX(Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1) : MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10) : MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10) : MAX(WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 + WaitRight_10) : MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10) : MAX(Think_5) : MAX(Neighbourhood_6_6) : MAX(Outside_8) : MAX(Neighbourhood_6_4) : MAX(HasLeft_8) : MAX(Neighbourhood_2_1) : MAX(HasLeft_3) : MAX(Neighbourhood_8_5)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Think_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Think_5)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================
check_solution: Constraint R1 = 4.6842512772e-310 is below its lower bound 1
check_solution: Constraint R36 = 0 is above its equality of -1
check_solution: Constraint R37 = 0 is above its equality of -1
check_solution: Constraint R38 = 0 is above its equality of -1
check_solution: Constraint R39 = 0 is above its equality of -1
check_solution: Constraint R40 = 0 is above its equality of -1
check_solution: Constraint R41 = 0 is above its equality of -1
check_solution: Constraint R42 = 0 is above its equality of -1
check_solution: Constraint R158 = 0 is above its equality of -1
check_solution: Constraint R161 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 1 (rel. error 1)

FORMULA PhilosophersDyn-PT-10-UpperBounds-8 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Neighbourhood_6_6)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Neighbourhood_6_6)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-10-UpperBounds.task
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: 3856 markings, 7834 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-UpperBounds-9 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Outside_8)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Outside_8)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-10-UpperBounds.task
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: ========================================

FORMULA PhilosophersDyn-PT-10-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Neighbourhood_6_4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Neighbourhood_6_4)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-10-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(HasLeft_8)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(HasLeft_8)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-10-UpperBounds.task
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: ========================================

FORMULA PhilosophersDyn-PT-10-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Neighbourhood_2_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Neighbourhood_2_1)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-10-UpperBounds.task
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: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges

FORMULA PhilosophersDyn-PT-10-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(HasLeft_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(HasLeft_3)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-10-UpperBounds.task
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

FORMULA PhilosophersDyn-PT-10-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Neighbourhood_8_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Neighbourhood_8_5)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-10-UpperBounds.task
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: ========================================
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges

FORMULA PhilosophersDyn-PT-10-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(HasRight_10 + HasRight_1 + HasRight_2 + HasRight_3 + HasRight_4 + HasRight_5 + HasRight_6 + HasRight_7 + HasRight_8 + HasRight_9)
lola: processed formula length: 133
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-10-UpperBounds.task
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: Structural Bound: 4294967295
lola: 1 markings, 0 edges, 0 markings/sec, 25 secs
lola: 16541 markings, 36129 edges, 3308 markings/sec, 30 secs
lola: 33088 markings, 76652 edges, 3309 markings/sec, 35 secs
lola: 49667 markings, 117219 edges, 3316 markings/sec, 40 secs
lola: 66318 markings, 160101 edges, 3330 markings/sec, 45 secs
lola: 82487 markings, 202738 edges, 3234 markings/sec, 50 secs
lola: 98807 markings, 245305 edges, 3264 markings/sec, 55 secs
lola: 115278 markings, 284706 edges, 3294 markings/sec, 60 secs
lola: 131826 markings, 324301 edges, 3310 markings/sec, 65 secs
lola: 148744 markings, 364958 edges, 3384 markings/sec, 70 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 163483 markings, 400995 edges

FORMULA PhilosophersDyn-PT-10-UpperBounds-2 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Outside_3 + Outside_4 + Outside_5 + Outside_6 + Outside_7 + Outside_8 + Outside_9 + Outside_10 + Outside_2 + Outside_1)
lola: processed formula length: 123
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-10-UpperBounds.task
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: 0 markings, 0 edges

FORMULA PhilosophersDyn-PT-10-UpperBounds-3 10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)
lola: processed formula length: 123
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-10-UpperBounds.task
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: ========================================
lola: Structural Bound: 10
lola: 15693 markings, 40806 edges, 3139 markings/sec, 0 secs
lola: 31738 markings, 85716 edges, 3209 markings/sec, 5 secs
lola: 47947 markings, 130907 edges, 3242 markings/sec, 10 secs
lola: 63849 markings, 176668 edges, 3180 markings/sec, 15 secs
lola: 79689 markings, 223633 edges, 3168 markings/sec, 20 secs
lola: 95555 markings, 271542 edges, 3173 markings/sec, 25 secs
lola: 111720 markings, 319156 edges, 3233 markings/sec, 30 secs
lola: 127403 markings, 365493 edges, 3137 markings/sec, 35 secs
lola: 143249 markings, 413626 edges, 3169 markings/sec, 40 secs
lola: 159199 markings, 463187 edges, 3190 markings/sec, 45 secs
lola: 174878 markings, 512122 edges, 3136 markings/sec, 50 secs
lola: 190504 markings, 560267 edges, 3125 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 587254 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-UpperBounds-4 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 676 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)
lola: processed formula length: 123
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-10-UpperBounds.task
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: 15709 markings, 40870 edges, 3142 markings/sec, 0 secs
lola: 32051 markings, 87156 edges, 3268 markings/sec, 5 secs
lola: 48260 markings, 131590 edges, 3242 markings/sec, 10 secs
lola: 63947 markings, 176966 edges, 3137 markings/sec, 15 secs
lola: 79917 markings, 224242 edges, 3194 markings/sec, 20 secs
lola: 95912 markings, 272434 edges, 3199 markings/sec, 25 secs
lola: 111824 markings, 319597 edges, 3182 markings/sec, 30 secs
lola: 127601 markings, 366095 edges, 3155 markings/sec, 35 secs
lola: 143427 markings, 414135 edges, 3165 markings/sec, 40 secs
lola: 159369 markings, 463626 edges, 3188 markings/sec, 45 secs
lola: 175218 markings, 512972 edges, 3170 markings/sec, 50 secs
lola: 191096 markings, 562423 edges, 3176 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 587254 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-UpperBounds-5 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 829 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 + WaitRight_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(WaitRight_1 + WaitRight_2 + WaitRight_3 + WaitRight_4 + WaitRight_5 + WaitRight_6 + WaitRight_7 + WaitRight_8 + WaitRight_9 + WaitRight_10)
lola: processed formula length: 143
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-10-UpperBounds.task
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: 15713 markings, 41904 edges, 3143 markings/sec, 0 secs
lola: 32974 markings, 91193 edges, 3452 markings/sec, 5 secs
lola: 49159 markings, 139474 edges, 3237 markings/sec, 10 secs
lola: 65446 markings, 187719 edges, 3257 markings/sec, 15 secs
lola: 81729 markings, 238024 edges, 3257 markings/sec, 20 secs
lola: 98039 markings, 288248 edges, 3262 markings/sec, 25 secs
lola: 114534 markings, 339294 edges, 3299 markings/sec, 30 secs
lola: 130852 markings, 389824 edges, 3264 markings/sec, 35 secs
lola: 147165 markings, 440476 edges, 3263 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 159811 markings, 481027 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-UpperBounds-6 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1090 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)
lola: processed formula length: 123
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-10-UpperBounds.task
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: 16025 markings, 42094 edges, 3205 markings/sec, 0 secs
lola: 32159 markings, 87339 edges, 3227 markings/sec, 5 secs
lola: 48381 markings, 131928 edges, 3244 markings/sec, 10 secs
lola: 64142 markings, 177515 edges, 3152 markings/sec, 15 secs
lola: 80252 markings, 225095 edges, 3222 markings/sec, 20 secs
lola: 96149 markings, 273024 edges, 3179 markings/sec, 25 secs
lola: 112066 markings, 320656 edges, 3183 markings/sec, 30 secs
lola: 127769 markings, 366581 edges, 3141 markings/sec, 35 secs
lola: 143515 markings, 414387 edges, 3149 markings/sec, 40 secs
lola: 159312 markings, 463484 edges, 3159 markings/sec, 45 secs
lola: 174881 markings, 512125 edges, 3114 markings/sec, 50 secs
lola: 190393 markings, 559723 edges, 3102 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 587254 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-UpperBounds-7 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1603 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(HasLeft_1 + HasLeft_2 + HasLeft_3 + HasLeft_4 + HasLeft_5 + HasLeft_6 + HasLeft_7 + HasLeft_8 + HasLeft_9 + HasLeft_10)
lola: processed formula length: 123
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-10-UpperBounds.task
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: 15824 markings, 41300 edges, 3165 markings/sec, 0 secs
lola: 31473 markings, 84673 edges, 3130 markings/sec, 5 secs
lola: 47231 markings, 128875 edges, 3152 markings/sec, 10 secs
lola: 62590 markings, 173384 edges, 3072 markings/sec, 15 secs
lola: 78259 markings, 220000 edges, 3134 markings/sec, 20 secs
lola: 94069 markings, 266041 edges, 3162 markings/sec, 25 secs
lola: 109729 markings, 312742 edges, 3132 markings/sec, 30 secs
lola: 124830 markings, 358721 edges, 3020 markings/sec, 35 secs
lola: 140505 markings, 405348 edges, 3135 markings/sec, 40 secs
lola: 156357 markings, 453964 edges, 3170 markings/sec, 45 secs
lola: 171964 markings, 502476 edges, 3121 markings/sec, 50 secs
lola: 187514 markings, 551028 edges, 3110 markings/sec, 55 secs
lola: SUBRESULT
lola: result: 2
lola: produced by: state space
lola: The maximum value of the given expression is 2
lola: 199051 markings, 587254 edges

FORMULA PhilosophersDyn-PT-10-UpperBounds-1 2 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3143 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Neighbourhood_2_10 + Neighbourhood_7_10 + Neighbourhood_1_10 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_1_9 + Neighbourhood_6_10 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhoo... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Neighbourhood_2_10 + Neighbourhood_7_10 + Neighbourhood_1_10 + Neighbourhood_1_1 + Neighbourhood_1_2 + Neighbourhood_1_3 + Neighbourhood_1_4 + Neighbourhood_1_5 + Neighbourhood_1_6 + Neighbourhood_1_7 + Neighbourhood_1_8 + Neighbourhood_1_9 + Neighbourhood_6_10 + Neighbourhood_2_1 + Neighbourhood_2_2 + Neighbourhood_2_3 + Neighbourhood_2_4 + Neighbourhood_2_5 + Neighbourhood_2_6 + Neighbourhoo... (shortened)
lola: processed formula length: 2022
lola: 0 rewrites
lola: closed formula file PhilosophersDyn-PT-10-UpperBounds.task
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: 14108 markings, 30508 edges, 2822 markings/sec, 0 secs
lola: 31453 markings, 67720 edges, 3469 markings/sec, 5 secs
lola: 48341 markings, 106843 edges, 3378 markings/sec, 10 secs
lola: 65240 markings, 146726 edges, 3380 markings/sec, 15 secs
lola: 82375 markings, 187211 edges, 3427 markings/sec, 20 secs
lola: 99284 markings, 231546 edges, 3382 markings/sec, 25 secs
lola: 116119 markings, 273856 edges, 3367 markings/sec, 30 secs
lola: 133050 markings, 316858 edges, 3386 markings/sec, 35 secs
lola: 149950 markings, 356991 edges, 3380 markings/sec, 40 secs
lola: SUBRESULT
lola: result: 4
lola: produced by: state space
lola: The maximum value of the given expression is 4
lola: 154192 markings, 367726 edges
lola: ========================================

FORMULA PhilosophersDyn-PT-10-UpperBounds-0 4 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 4 2 2 10 2 2 4 2 1 1 1 1 1 1 1 1
lola:
preliminary result: 4 2 2 10 2 2 4 2 1 1 1 1 1 1 1 1
lola: memory consumption: 31976 KB
lola: time consumption: 473 seconds

BK_STOP 1527066268821

--------------------
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="PhilosophersDyn-PT-10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
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

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-PT-10.tgz
mv PhilosophersDyn-PT-10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is PhilosophersDyn-PT-10, 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 r112-csrt-152666470100877"
echo "====================================================================="
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
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 ;