fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r136-qhx2-152673578800100
Last Updated
June 26, 2018

About the Execution of LoLA for QuasiCertifProtocol-PT-32

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
174.700 44785.00 31270.00 3097.20 33 33 33 33 33 33 33 19 1 1 1 1 1 1 1 1 normal

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 2.4M
-rw-r--r-- 1 mcc users 34K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 18K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K 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 8.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K 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 1.8M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-PT-32, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578800100
=====================================================================


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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1526935548013

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-PT-32 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-PT-32 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ QuasiCertifProtocol-PT-32 @ 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: 4312/65536 symbol table entries, 134 collisions
lola: preprocessing...
lola: Size of bit vector: 121792
lola: finding significant places
lola: 3806 places, 506 transitions, 505 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 671 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-32-UpperBounds.task
lola: MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10) : MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10) : MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10) : MAX(n6_32 + n6_31 + n6_30 + n6_29 + n6_28 + n6_27 + n6_26 + n6_25 + n6_24 + n6_23 + n6_22 + n6_21 + n6_20 + n6_19 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10 + n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9) : MAX(n4_10 + n4_11 + n4_12 + n4_13 + n4_14 + n4_15 + n4_16 + n4_17 + n4_18 + n4_19 + n4_20 + n4_21 + n4_22 + n4_23 + n4_24 + n4_25 + n4_26 + n4_27 + n4_28 + n4_29 + n4_30 + n4_31 + n4_32 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9) : MAX(Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 + Sstart_10 + Sstart_11 + Sstart_12 + Sstart_13 + Sstart_14 + Sstart_15 + Sstart_16 + Sstart_17 + Sstart_18 + Sstart_19 + Sstart_20 + Sstart_21 + Sstart_22 + Sstart_23 + Sstart_24 + Sstart_25 + Sstart_26 + Sstart_27 + Sstart_28 + Sstart_29 + Sstart_30 + Sstart_31 + Sstart_32) : MAX(n6_32 + n6_31 + n6_30 + n6_29 + n6_28 + n6_27 + n6_26 + n6_25 + n6_24 + n6_23 + n6_22 + n6_21 + n6_20 + n6_19 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10 + n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9) : MAX(malicious_reservoir) : MAX(n7_27_21) : MAX(n5_18) : MAX(n9_11_13) : MAX(n8_25_2) : MAX(n9_7_0) : MAX(n7_17_0) : MAX(n7_20_30) : MAX(n9_10_21)
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(malicious_reservoir)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(malicious_reservoir)
lola: processed formula length: 24
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-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: 19
lola: SUBRESULT
lola: result: 19
lola: produced by: state space
lola: The maximum value of the given expression is 19
lola: 0 markings, 0 edges
lola: ========================================

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

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

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

FORMULA QuasiCertifProtocol-PT-32-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_25_2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n8_25_2)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-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: 139 markings, 138 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-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(n9_7_0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n9_7_0)
lola: processed formula length: 11
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-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: 173 markings, 172 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-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(n7_17_0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n7_17_0)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-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: 74 markings, 73 edges

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

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

FORMULA QuasiCertifProtocol-PT-32-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(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10)
lola: processed formula length: 256
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 105 markings, 104 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-2 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n6_32 + n6_31 + n6_30 + n6_29 + n6_28 + n6_27 + n6_26 + n6_25 + n6_24 + n6_23 + n6_22 + n6_21 + n6_20 + n6_19 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10 + n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n6_32 + n6_31 + n6_30 + n6_29 + n6_28 + n6_27 + n6_26 + n6_25 + n6_24 + n6_23 + n6_22 + n6_21 + n6_20 + n6_19 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10 + n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9)
lola: processed formula length: 256
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 105 markings, 104 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-3 33 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_11 + n4_12 + n4_13 + n4_14 + n4_15 + n4_16 + n4_17 + n4_18 + n4_19 + n4_20 + n4_21 + n4_22 + n4_23 + n4_24 + n4_25 + n4_26 + n4_27 + n4_28 + n4_29 + n4_30 + n4_31 + n4_32 + 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_11 + n4_12 + n4_13 + n4_14 + n4_15 + n4_16 + n4_17 + n4_18 + n4_19 + n4_20 + n4_21 + n4_22 + n4_23 + n4_24 + n4_25 + n4_26 + n4_27 + n4_28 + n4_29 + n4_30 + n4_31 + n4_32 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9)
lola: processed formula length: 256
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 70 markings, 69 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-4 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 + Sstart_10 + Sstart_11 + Sstart_12 + Sstart_13 + Sstart_14 + Sstart_15 + Sstart_16 + Sstart_17 + Sstart_18 + Sstart_19 + Sstart_20 + Sstart_21 + Sstart_22 + Sstart_23 + Sstart_24 + Sstart_25 + Sstart_26 + Sstart_27 + Sstart_28 + Sstart_29 + Sstart_30 + Sstart_31 + Sstart_32)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 + Sstart_10 + Sstart_11 + Sstart_12 + Sstart_13 + Sstart_14 + Sstart_15 + Sstart_16 + Sstart_17 + Sstart_18 + Sstart_19 + Sstart_20 + Sstart_21 + Sstart_22 + Sstart_23 + Sstart_24 + Sstart_25 + Sstart_26 + Sstart_27 + Sstart_28 + Sstart_29 + Sstart_30 + Sstart_31 + Sstart_32)
lola: processed formula length: 388
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-5 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(n6_32 + n6_31 + n6_30 + n6_29 + n6_28 + n6_27 + n6_26 + n6_25 + n6_24 + n6_23 + n6_22 + n6_21 + n6_20 + n6_19 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10 + n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(n6_32 + n6_31 + n6_30 + n6_29 + n6_28 + n6_27 + n6_26 + n6_25 + n6_24 + n6_23 + n6_22 + n6_21 + n6_20 + n6_19 + n6_18 + n6_17 + n6_16 + n6_15 + n6_14 + n6_13 + n6_12 + n6_11 + n6_10 + n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9)
lola: processed formula length: 256
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 105 markings, 104 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-6 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1774 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10)
lola: processed formula length: 256
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 105 markings, 104 edges

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-0 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_32 + s4_31 + s4_30 + s4_29 + s4_28 + s4_27 + s4_26 + s4_25 + s4_24 + s4_23 + s4_22 + s4_21 + s4_20 + s4_19 + s4_18 + s4_17 + s4_16 + s4_15 + s4_14 + s4_13 + s4_12 + s4_11 + s4_10)
lola: processed formula length: 256
lola: 0 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-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: 33
lola: SUBRESULT
lola: result: 33
lola: produced by: state space
lola: The maximum value of the given expression is 33
lola: 105 markings, 104 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-UpperBounds-1 33 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 33 33 33 33 33 33 33 19 1 1 1 1 1 1 1 1
lola:
preliminary result: 33 33 33 33 33 33 33 19 1 1 1 1 1 1 1 1
lola: memory consumption: 21480 KB
lola: time consumption: 23 seconds

BK_STOP 1526935592798

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-32"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="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-32.tgz
mv QuasiCertifProtocol-PT-32 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-32, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-qhx2-152673578800100"
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 ;