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 572K
-rw-r--r-- 1 mcc users 9.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K 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 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K 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 290K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578700072
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1526924243792

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-PT-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-PT-10 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ QuasiCertifProtocol-PT-10 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 17600
lola: finding significant places
lola: 550 places, 176 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 231 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-10-UpperBounds.task
lola: MAX(a3) : MAX(c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_10 + c1_9) : MAX(n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_5_0 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n8_6_8 + n8_6_9 + n8_3_10 + n8_7_1 + n8_7_2 + n8_7_3 + n8_7_4 + n8_7_5 + n8_7_6 + n8_7_7 + n8_7_8 + n8_7_9 + n8_4_9 + n8_4_8 + n8_4_7 + n8_8_0 + n8_8_1 + n8_8_2 + n8_8_3 + n8_8_4 + n8_8_5 + n8_8_6 + n8_8_7 + n8_8_8 + n8_8_9 + n8_4_6 + n8_4_5 + n8_9_0 + n8_9_1 + n8_9_2 + n8_9_3 + n8_9_4 + n8_9_5 + n8_9_6 + n8_9_7 + n8_9_8 + n8_9_9 + n8_4_4 + n8_2_10 + n8_4_3 + n8_4_2 + n8_4_1 + n8_7_10 + n8_4_0 + n8_3_9 + n8_3_8 + n8_3_7 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_1_10 + n8_2_9 + n8_2_8 + n8_2_7 + n8_2_6 + n8_2_5 + n8_6_10 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_9 + n8_1_8 + n8_1_7 + n8_1_6 + n8_1_5 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_0_10 + n8_0_9 + n8_0_8 + n8_0_7 + n8_0_6 + n8_0_5 + n8_0_4 + n8_0_3 + n8_0_2 + n8_0_1 + n8_10_0 + n8_10_1 + n8_10_2 + n8_10_3 + n8_10_4 + n8_10_5 + n8_10_6 + n8_10_7 + n8_10_8 + n8_10_9) : MAX(n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_5_0 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n8_6_8 + n8_6_9 + n8_3_10 + n8_7_1 + n8_7_2 + n8_7_3 + n8_7_4 + n8_7_5 + n8_7_6 + n8_7_7 + n8_7_8 + n8_7_9 + n8_4_9 + n8_4_8 + n8_4_7 + n8_8_0 + n8_8_1 + n8_8_2 + n8_8_3 + n8_8_4 + n8_8_5 + n8_8_6 + n8_8_7 + n8_8_8 + n8_8_9 + n8_4_6 + n8_4_5 + n8_9_0 + n8_9_1 + n8_9_2 + n8_9_3 + n8_9_4 + n8_9_5 + n8_9_6 + n8_9_7 + n8_9_8 + n8_9_9 + n8_4_4 + n8_2_10 + n8_4_3 + n8_4_2 + n8_4_1 + n8_7_10 + n8_4_0 + n8_3_9 + n8_3_8 + n8_3_7 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_1_10 + n8_2_9 + n8_2_8 + n8_2_7 + n8_2_6 + n8_2_5 + n8_6_10 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_9 + n8_1_8 + n8_1_7 + n8_1_6 + n8_1_5 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_0_10 + n8_0_9 + n8_0_8 + n8_0_7 + n8_0_6 + n8_0_5 + n8_0_4 + n8_0_3 + n8_0_2 + n8_0_1 + n8_10_0 + n8_10_1 + n8_10_2 + n8_10_3 + n8_10_4 + n8_10_5 + n8_10_6 + n8_10_7 + n8_10_8 + n8_10_9) : MAX(n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9) : MAX(n9_7_10 + n9_1_10 + n9_6_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_0_10 + n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_0_7 + n9_0_8 + n9_0_9 + n9_5_10 + n9_1_0 + n9_1_1 + n9_1_2 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_1_7 + n9_1_8 + n9_1_9 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9_2_5 + n9_2_6 + n9_2_7 + n9_2_8 + n9_2_9 + n9_3_0 + n9_3_1 + n9_3_2 + n9_3_3 + n9_3_4 + n9_3_5 + n9_3_6 + n9_3_7 + n9_3_8 + n9_3_9 + n9_4_10 + n9_4_0 + n9_4_1 + n9_4_2 + n9_4_3 + n9_4_4 + n9_4_5 + n9_4_6 + n9_4_7 + n9_4_8 + n9_4_9 + n9_9_10 + n9_10_10 + n9_5_0 + n9_5_1 + n9_5_2 + n9_5_3 + n9_5_4 + n9_5_5 + n9_5_6 + n9_5_7 + n9_5_8 + n9_5_9 + n9_6_0 + n9_6_1 + n9_6_2 + n9_6_3 + n9_6_4 + n9_6_5 + n9_6_6 + n9_6_7 + n9_6_8 + n9_6_9 + n9_3_10 + n9_7_0 + n9_7_1 + n9_7_2 + n9_7_3 + n9_7_4 + n9_7_5 + n9_7_6 + n9_7_7 + n9_7_8 + n9_7_9 + n9_8_10 + n9_8_0 + n9_8_1 + n9_8_2 + n9_8_3 + n9_8_4 + n9_8_5 + n9_8_6 + n9_8_7 + n9_8_8 + n9_8_9 + n9_9_0 + n9_9_1 + n9_9_2 + n9_9_3 + n9_9_4 + n9_9_5 + n9_9_6 + n9_9_7 + n9_9_8 + n9_9_9 + n9_2_10) : MAX(n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9) : MAX(s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10) : MAX(n7_5_8) : MAX(n9_7_3) : MAX(n2_3) : MAX(n8_7_4) : MAX(n6_7) : MAX(n4_0) : MAX(n5_2) : MAX(n8_1_2)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(a3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(a3)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-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: 15 markings, 14 edges

FORMULA QuasiCertifProtocol-PT-10-UpperBounds-0 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(n7_5_8)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n7_5_8)
lola: processed formula length: 11
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-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: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 30 markings, 29 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-10-UpperBounds-8 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(n9_7_3)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n9_7_3)
lola: processed formula length: 11
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-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: 63 markings, 62 edges
lola: ========================================

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

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

FORMULA QuasiCertifProtocol-PT-10-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n6_7)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n6_7)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-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: 29 markings, 28 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-10-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n4_0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n4_0)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-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: 16 markings, 15 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-10-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n5_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n5_2)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-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: 28 markings, 27 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-10-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n8_1_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n8_1_2)
lola: processed formula length: 11
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-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: 51 markings, 50 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-10-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_10 + c1_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_10 + c1_9)
lola: processed formula length: 80
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 61 markings, 60 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-10-UpperBounds-1 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9)
lola: processed formula length: 80
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 13 markings, 12 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-10-UpperBounds-4 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9)
lola: processed formula length: 80
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 26 markings, 25 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-10-UpperBounds-6 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 888 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10)
lola: processed formula length: 80
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-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: 11
lola: SUBRESULT
lola: result: 11
lola: produced by: state space
lola: The maximum value of the given expression is 11
lola: 50 markings, 49 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-10-UpperBounds-7 11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_5_0 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n8_6_8 + n8_6_9 + n8_3_10 + n8_7_1 + n8_7_2 + n8_7_3 + n8_7_4 + n8_7_5 + n8_7_6 + n8_7_7 + n8_7_8 + n8_7_9 + n8_4_9 + n8_4_8 + n8_4_7 + n8... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_5_0 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n8_6_8 + n8_6_9 + n8_3_10 + n8_7_1 + n8_7_2 + n8_7_3 + n8_7_4 + n8_7_5 + n8_7_6 + n8_7_7 + n8_7_8 + n8_7_9 + n8_4_9 + n8_4_8 + n8_4_7 + n8... (shortened)
lola: processed formula length: 1113
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-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: 121
lola: SUBRESULT
lola: result: 121
lola: produced by: state space
lola: The maximum value of the given expression is 121
lola: 61 markings, 60 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-10-UpperBounds-2 121 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n9_7_10 + n9_1_10 + n9_6_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_0_10 + n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_0_7 + n9_0_8 + n9_0_9 + n9_5_10 + n9_1_0 + n9_1_1 + n9_1_2 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_1_7 + n9_1_8 + n9_1_9 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9_2_5 + n9_2_6 + n9_... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n9_7_10 + n9_1_10 + n9_6_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_0_10 + n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_0_7 + n9_0_8 + n9_0_9 + n9_5_10 + n9_1_0 + n9_1_1 + n9_1_2 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_1_7 + n9_1_8 + n9_1_9 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9_2_5 + n9_2_6 + n9_... (shortened)
lola: processed formula length: 1113
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-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: 121
lola: SUBRESULT
lola: result: 121
lola: produced by: state space
lola: The maximum value of the given expression is 121
lola: 83 markings, 82 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-10-UpperBounds-5 121 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_5_0 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n8_6_8 + n8_6_9 + n8_3_10 + n8_7_1 + n8_7_2 + n8_7_3 + n8_7_4 + n8_7_5 + n8_7_6 + n8_7_7 + n8_7_8 + n8_7_9 + n8_4_9 + n8_4_8 + n8_4_7 + n8... (shortened)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_5_0 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n8_6_8 + n8_6_9 + n8_3_10 + n8_7_1 + n8_7_2 + n8_7_3 + n8_7_4 + n8_7_5 + n8_7_6 + n8_7_7 + n8_7_8 + n8_7_9 + n8_4_9 + n8_4_8 + n8_4_7 + n8... (shortened)
lola: processed formula length: 1113
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-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: 121
lola: SUBRESULT
lola: result: 121
lola: produced by: state space
lola: The maximum value of the given expression is 121
lola: 61 markings, 60 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-10-UpperBounds-3 121 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 1 11 121 121 11 121 11 11 1 1 1 1 1 1 1 1
lola:
preliminary result: 1 11 121 121 11 121 11 11 1 1 1 1 1 1 1 1
lola: memory consumption: 18964 KB
lola: time consumption: 16 seconds

BK_STOP 1526924280445

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-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/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-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 QuasiCertifProtocol-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 r136-qhx2-152673578700072"
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 ;