About the Execution of LoLa for Raft-PT-09
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15947.290 | 3110930.00 | 3027364.00 | 6731.80 | F????FF?F??????? | 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)
..............
=====================================================================
Generated by BenchKit 2-2979
Executing tool lola
Input is Raft-PT-09, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140400201
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Raft-PT-09-CTLCardinality-0
FORMULA_NAME Raft-PT-09-CTLCardinality-1
FORMULA_NAME Raft-PT-09-CTLCardinality-10
FORMULA_NAME Raft-PT-09-CTLCardinality-11
FORMULA_NAME Raft-PT-09-CTLCardinality-12
FORMULA_NAME Raft-PT-09-CTLCardinality-13
FORMULA_NAME Raft-PT-09-CTLCardinality-14
FORMULA_NAME Raft-PT-09-CTLCardinality-15
FORMULA_NAME Raft-PT-09-CTLCardinality-2
FORMULA_NAME Raft-PT-09-CTLCardinality-3
FORMULA_NAME Raft-PT-09-CTLCardinality-4
FORMULA_NAME Raft-PT-09-CTLCardinality-5
FORMULA_NAME Raft-PT-09-CTLCardinality-6
FORMULA_NAME Raft-PT-09-CTLCardinality-7
FORMULA_NAME Raft-PT-09-CTLCardinality-8
FORMULA_NAME Raft-PT-09-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1463751283859
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ Raft-PT-09
FORMULA Raft-PT-09-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-09-CTLCardinality-1 CANNOT_COMPUTE
FORMULA Raft-PT-09-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-09-CTLCardinality-3 CANNOT_COMPUTE
FORMULA Raft-PT-09-CTLCardinality-4 CANNOT_COMPUTE
FORMULA Raft-PT-09-CTLCardinality-5 CANNOT_COMPUTE
FORMULA Raft-PT-09-CTLCardinality-6 CANNOT_COMPUTE
FORMULA Raft-PT-09-CTLCardinality-7 CANNOT_COMPUTE
FORMULA Raft-PT-09-CTLCardinality-8 CANNOT_COMPUTE
FORMULA Raft-PT-09-CTLCardinality-9 CANNOT_COMPUTE
FORMULA Raft-PT-09-CTLCardinality-10 CANNOT_COMPUTE
FORMULA Raft-PT-09-CTLCardinality-11 CANNOT_COMPUTE
FORMULA Raft-PT-09-CTLCardinality-12 CANNOT_COMPUTE
FORMULA Raft-PT-09-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-09-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Raft-PT-09-CTLCardinality-15 CANNOT_COMPUTE
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1123/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 413 places, 710 transitions, 332 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 700 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-09-CTLCardinality.task
lola: read: AG ((((2 <= p335 OR p34 <= p16) AND (p287 <= p311 AND 1 <= p365)) OR (p13 <= p282 OR !(p76 <= p190)))) : (1 <= p320 OR EF (AG (2 <= p118))) : AG (((p361 <= p218 OR !(p51 <= p14)) OR p204 <= p389)) : AG (EG (!(3 <= p168))) : E(p173 <= p23 U 2 <= p170) : EF (AF ((2 <= p113 AND 2 <= p383))) : (E((p411 <= p49 OR p182 <= p275) U (2 <= p325 AND 2 <= p180)) AND EF (!(3 <= p152))) : (AF (EF (3 <= p277)) A... (shortened)
lola: formula length: 846
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-p335 <= -2 OR -p16 + p34 <= 0) AND (-p311 + p287 <= 0 AND -p365 <= -1)) OR (p13 + -p282 <= 0 OR -p190 + p76 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-p320 <= -1 OR EF (AG (-p118 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -p320 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (-p118 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !(-p118 <= -2))))
lola: processed formula length: 37
lola: 194 rewrites
lola: formula mentions 1 of 413 places; total mentions: 1
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((p361 + -p218 <= 0 OR (-p14 + p51 > 0 OR -p389 + p204 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EG (-p168 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(!(A(TRUE U !(-p168 > -3))))))
lola: processed formula length: 42
lola: 194 rewrites
lola: formula mentions 1 of 413 places; total mentions: 1
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-p23 + p173 <= 0 U -p170 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-p23 + p173 <= 0 U -p170 <= -2)
lola: processed formula length: 33
lola: 193 rewrites
lola: formula mentions 3 of 413 places; total mentions: 3
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AF ((-p113 <= -2 AND -p383 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (-p113 <= -2 AND -p383 <= -2)))
lola: processed formula length: 49
lola: 194 rewrites
lola: formula mentions 2 of 413 places; total mentions: 2
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E((p411 + -p49 <= 0 OR -p275 + p182 <= 0) U (-p325 <= -2 AND -p180 <= -2)) AND EF (-p152 > -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((p411 + -p49 <= 0 OR -p275 + p182 <= 0) U (-p325 <= -2 AND -p180 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p411 + -p49 <= 0 OR -p275 + p182 <= 0) U (-p325 <= -2 AND -p180 <= -2))
lola: processed formula length: 74
lola: 193 rewrites
lola: formula mentions 6 of 413 places; total mentions: 6
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-p152 > -3)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (EF (-p277 <= -3)) AND AF ((p255 + -p352 > 0 OR (-p359 <= -3 AND -p385 <= -3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EF (-p277 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U -p277 <= -3))
lola: processed formula length: 31
lola: 194 rewrites
lola: formula mentions 1 of 413 places; total mentions: 1
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((p255 + -p352 > 0 OR (-p359 <= -3 AND -p385 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p255 + -p352 > 0 OR (-p359 <= -3 AND -p385 <= -3)))
lola: processed formula length: 61
lola: 193 rewrites
lola: formula mentions 4 of 413 places; total mentions: 4
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 8 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((AG (-p257 <= -3) OR (-p354 > -3 OR -p160 > -3)) AND AG (-p334 > -3)) OR -p177 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-p257 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-p354 > -3 OR -p160 > -3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-p334 > -3)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: local time limit reached - aborting
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AF (-p317 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(TRUE U -p317 > -2))))
lola: processed formula length: 36
lola: 194 rewrites
lola: formula mentions 1 of 413 places; total mentions: 1
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-p281 + p231 <= 0 U EF (-p181 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-p281 + p231 <= 0 U E(TRUE U -p181 <= -3))
lola: processed formula length: 44
lola: 194 rewrites
lola: formula mentions 3 of 413 places; total mentions: 3
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-p319 + p78 > 0 OR EF (-p350 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -p319 + p78 > 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 330 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-p350 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EF (-p37 + p323 <= 0) U EX (-p6 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U -p37 + p323 <= 0) U EX(-p6 <= -3))
lola: processed formula length: 45
lola: 195 rewrites
lola: formula mentions 3 of 413 places; total mentions: 3
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-p387 > -1)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 397 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(AX (-p14 + p212 <= 0) U AG (p402 + -p197 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(AX(-p14 + p212 <= 0) U !(E(TRUE U !(p402 + -p197 <= 0))))
lola: processed formula length: 59
lola: 195 rewrites
lola: formula mentions 4 of 413 places; total mentions: 4
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 795 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((AX (p180 + -p381 <= 0) AND (-p373 + p98 <= 0 OR (-p349 <= -2 OR (-p377 + p209 <= 0 AND -p355 + p412 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (AX(p180 + -p381 <= 0) AND (-p373 + p98 <= 0 OR (-p349 <= -2 OR (-p377 + p209 <= 0 AND -p355 + p412 <= 0)))))
lola: processed formula length: 118
lola: 194 rewrites
lola: formula mentions 9 of 413 places; total mentions: 9
lola: closed formula file Raft-PT-09-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1328 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: no unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown no no unknown
BK_STOP 1463754394789
--------------------
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="Raft-PT-09"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/Raft-PT-09.tgz
mv Raft-PT-09 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is Raft-PT-09, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098kn-smll-146369140400201"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 ;