About the Execution of LoLA for SmallOperatingSystem-PT-MT1024DC0256
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 184K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 127 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 365 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 8.1K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SmallOperatingSystem-PT-MT1024DC0256, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r160-smll-152705512400079
=====================================================================
--------------------
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 SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-00
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-01
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-02
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-03
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-04
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-05
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-06
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-07
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-08
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-09
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-10
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-11
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-12
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-13
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-14
FORMULA_NAME SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1527227184339
info: Time: 3600 - MCC
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT1024DC0256 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT1024DC0256 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ SmallOperatingSystem-PT-MT1024DC0256 @ 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: 17/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from SmallOperatingSystem-PT-MT1024DC0256-UpperBounds.task
lola: LP says that atomic proposition is always false: (TaskOnDisk <= 0)
lola: MAX(LoadingMem) : MAX(DiskControllerUnit) : MAX(LoadingMem) : MAX(TransferToDisk) : MAX(DiskControllerUnit) : MAX(LoadingMem) : MAX(ExecutingTask) : MAX(TaskReady) : MAX(FreeMemSegment) : MAX(FreeMemSegment) : MAX(DiskControllerUnit) : MAX(CPUUnit) : MAX(TransferToDisk) : MAX(ExecutingTask) : MAX(TaskOnDisk) : MAX(FreeMemSegment)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TaskOnDisk)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TaskOnDisk)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0256-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: 1024
lola: SUBRESULT
lola: result: 1024
lola: produced by: state space
lola: The maximum value of the given expression is 1024
lola: 0 markings, 0 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-14 1024 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(DiskControllerUnit)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(DiskControllerUnit)
lola: processed formula length: 23
lola: 0 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0256-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: 256
lola: SUBRESULT
lola: result: 256
lola: produced by: state space
lola: The maximum value of the given expression is 256
lola: 0 markings, 0 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-1 256 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(LoadingMem)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(LoadingMem)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0256-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: 256
lola: SUBRESULT
lola: result: 256
lola: produced by: state space
lola: The maximum value of the given expression is 256
lola: 257 markings, 256 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-2 256 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TransferToDisk)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TransferToDisk)
lola: processed formula length: 19
lola: 0 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0256-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: 256
lola: SUBRESULT
lola: result: 256
lola: produced by: state space
lola: The maximum value of the given expression is 256
lola: 133044 markings, 177761 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-3 256 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(DiskControllerUnit)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(DiskControllerUnit)
lola: processed formula length: 23
lola: 0 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0256-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: 256
lola: SUBRESULT
lola: result: 256
lola: produced by: state space
lola: The maximum value of the given expression is 256
lola: 0 markings, 0 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-4 256 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(LoadingMem)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(LoadingMem)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0256-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: 256
lola: SUBRESULT
lola: result: 256
lola: produced by: state space
lola: The maximum value of the given expression is 256
lola: 257 markings, 256 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-5 256 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ExecutingTask)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ExecutingTask)
lola: processed formula length: 18
lola: 0 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0256-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: 512
lola: SUBRESULT
lola: result: 512
lola: produced by: state space
lola: The maximum value of the given expression is 512
lola: 752262 markings, 1307403 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-6 512 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TaskReady)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TaskReady)
lola: processed formula length: 14
lola: 0 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0256-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: 1024
lola: SUBRESULT
lola: result: 1024
lola: produced by: state space
lola: The maximum value of the given expression is 1024
lola: 2049 markings, 2048 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-7 1024 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(FreeMemSegment)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(FreeMemSegment)
lola: processed formula length: 19
lola: 0 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0256-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: 1024
lola: SUBRESULT
lola: result: 1024
lola: produced by: state space
lola: The maximum value of the given expression is 1024
lola: 0 markings, 0 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-8 1024 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(FreeMemSegment)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(FreeMemSegment)
lola: processed formula length: 19
lola: 0 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0256-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: 1024
lola: SUBRESULT
lola: result: 1024
lola: produced by: state space
lola: The maximum value of the given expression is 1024
lola: 0 markings, 0 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-9 1024 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(DiskControllerUnit)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(DiskControllerUnit)
lola: processed formula length: 23
lola: 0 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0256-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: 256
lola: SUBRESULT
lola: result: 256
lola: produced by: state space
lola: The maximum value of the given expression is 256
lola: 0 markings, 0 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-10 256 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(CPUUnit)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(CPUUnit)
lola: processed formula length: 12
lola: 0 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0256-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: 512
lola: SUBRESULT
lola: result: 512
lola: produced by: state space
lola: The maximum value of the given expression is 512
lola: 0 markings, 0 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-11 512 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TransferToDisk)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TransferToDisk)
lola: processed formula length: 19
lola: 0 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0256-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: 256
lola: SUBRESULT
lola: result: 256
lola: produced by: state space
lola: The maximum value of the given expression is 256
lola: 133044 markings, 177761 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-12 256 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(ExecutingTask)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(ExecutingTask)
lola: processed formula length: 18
lola: 0 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0256-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: 512
lola: SUBRESULT
lola: result: 512
lola: produced by: state space
lola: The maximum value of the given expression is 512
lola: 752262 markings, 1307403 edges
FORMULA SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-13 512 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(LoadingMem)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(LoadingMem)
lola: processed formula length: 15
lola: 0 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0256-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: 256
lola: SUBRESULT
lola: result: 256
lola: produced by: state space
lola: The maximum value of the given expression is 256
lola: 257 markings, 256 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-0 256 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(FreeMemSegment)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(FreeMemSegment)
lola: processed formula length: 19
lola: 0 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT1024DC0256-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: 1024
lola: SUBRESULT
lola: result: 1024
lola: produced by: state space
lola: The maximum value of the given expression is 1024
lola: 0 markings, 0 edges
lola:
FORMULA SmallOperatingSystem-PT-MT1024DC0256-UpperBounds-15 1024 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: RESULT
lola:
SUMMARY: 256 256 256 256 256 256 512 1024 1024 1024 256 512 256 512 1024 1024
lola:
preliminary result: 256 256 256 256 256 256 512 1024 1024 1024 256 512 256 512 1024 1024
lola: memory consumption: 17856 KB
lola: time consumption: 2 seconds
BK_STOP 1527227187003
--------------------
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="SmallOperatingSystem-PT-MT1024DC0256"
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/SmallOperatingSystem-PT-MT1024DC0256.tgz
mv SmallOperatingSystem-PT-MT1024DC0256 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 SmallOperatingSystem-PT-MT1024DC0256, 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 r160-smll-152705512400079"
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 '
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 ;