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 SmallOperatingSystem-PT-MT0064DC0032, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r122kn-qhx2-146373367800129
=====================================================================

--------------------
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 SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-0
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-1
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-15
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-2
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-3
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-4
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-5
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-6
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-7
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-8
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1463749040369

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ SmallOperatingSystem-PT-MT0064DC0032
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 17/65536 symbol table entries, 0 collisions
lola: preprocessing...
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-MT0064DC0032-CTLCardinality.task
lola: read: ((((!(2 <= LoadingMem) AND TransferToDisk <= CPUUnit) OR !(!(3 <= DiskControllerUnit))) AND EF ((1 <= TaskSuspended AND FreeMemSegment <= TaskSuspended))) OR FreeMemSegment <= ExecutingTask) : A(EF (DiskControllerUnit <= TaskOnDisk) U ((1 <= CPUUnit OR 1 <= TaskReady) AND (ExecutingTask <= TaskOnDisk AND 1 <= TaskReady))) : (E(!(3 <= LoadingMem) U !(LoadingMem <= LoadingMem)) OR !((EX (TaskSuspend... (shortened)
lola: formula length: 1436
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((-LoadingMem > -2 AND TransferToDisk + -CPUUnit <= 0) OR -DiskControllerUnit <= -3) AND EF ((-TaskSuspended <= -1 AND FreeMemSegment + -TaskSuspended <= 0))) OR FreeMemSegment + -ExecutingTask <= 0)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-LoadingMem > -2 AND TransferToDisk + -CPUUnit <= 0) OR -DiskControllerUnit <= -3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-TaskSuspended <= -1 AND FreeMemSegment + -TaskSuspended <= 0))
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 20 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(EF (DiskControllerUnit + -TaskOnDisk <= 0) U ((-CPUUnit <= -1 OR -TaskReady <= -1) AND (ExecutingTask + -TaskOnDisk <= 0 AND -TaskReady <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U DiskControllerUnit + -TaskOnDisk <= 0) U ((-CPUUnit <= -1 OR -TaskReady <= -1) AND (ExecutingTask + -TaskOnDisk <= 0 AND -TaskReady <= -1)))
lola: processed formula length: 151
lola: 218 rewrites
lola: formula mentions 5 of 9 places; total mentions: 7
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((-TransferToDisk + TaskSuspended > 0 AND -ExecutingTask > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((-TransferToDisk + TaskSuspended > 0 AND -ExecutingTask > -2))
lola: processed formula length: 65
lola: 217 rewrites
lola: formula mentions 3 of 9 places; total mentions: 3
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (EF (-ExecutingTask <= -1)) AND EF ((ExecutingTask + -DiskControllerUnit > 0 OR (-LoadingMem <= -2 OR -ExecutingTask + LoadingMem <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-ExecutingTask <= -1))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -ExecutingTask <= -1))))
lola: processed formula length: 46
lola: 218 rewrites
lola: formula mentions 1 of 9 places; total mentions: 1
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((ExecutingTask + -DiskControllerUnit > 0 OR (-LoadingMem <= -2 OR -ExecutingTask + LoadingMem <= 0)))
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 20 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: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((AG (-CPUUnit <= -1) AND EX (-TaskOnDisk <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((!(E(TRUE U !(-CPUUnit <= -1))) AND EX(-TaskOnDisk <= -2)))))
lola: processed formula length: 74
lola: 219 rewrites
lola: formula mentions 2 of 9 places; total mentions: 2
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 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 5 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((DiskControllerUnit + -TaskReady > 0 AND (DiskControllerUnit + -TaskOnDisk > 0 AND EG (-TransferToDisk + CPUUnit <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (DiskControllerUnit + -TaskReady > 0 AND (DiskControllerUnit + -TaskOnDisk > 0 AND !(A(TRUE U !(-TransferToDisk + CPUUnit <= 0))))))
lola: processed formula length: 141
lola: 218 rewrites
lola: formula mentions 5 of 9 places; total mentions: 6
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 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 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (-CPUUnit <= -3) AND (-TransferToDisk <= -1 OR (-ExecutingTask + TaskOnDisk <= 0 OR -DiskControllerUnit <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-CPUUnit <= -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 20 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (EF (-TaskOnDisk > -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U -TaskOnDisk > -1))
lola: processed formula length: 30
lola: 218 rewrites
lola: formula mentions 1 of 9 places; total mentions: 1
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ExecutingTask + -LoadingMem <= 0 AND AG ((DiskControllerUnit + -TaskReady <= 0 OR (-TaskReady <= -1 OR -FreeMemSegment <= -3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ExecutingTask + -LoadingMem <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 460 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((DiskControllerUnit + -TaskReady <= 0 OR (-TaskReady <= -1 OR -FreeMemSegment <= -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 20 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 460 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((TransferToDisk + -FreeMemSegment > 0 OR -ExecutingTask > -3) AND AG (-TransferToDisk + FreeMemSegment > 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 460 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (TransferToDisk + -FreeMemSegment > 0 OR -ExecutingTask > -3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-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 536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-TransferToDisk + FreeMemSegment > 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 20 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-FreeMemSegment <= -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 20 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 11 will run for 644 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EF (DiskControllerUnit + -TaskSuspended <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U DiskControllerUnit + -TaskSuspended <= 0))
lola: processed formula length: 54
lola: 218 rewrites
lola: formula mentions 2 of 9 places; total mentions: 2
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 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: ========================================
lola: subprocess 12 will run for 805 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AF (ExecutingTask + -CPUUnit > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U ExecutingTask + -CPUUnit > 0))
lola: processed formula length: 48
lola: 218 rewrites
lola: formula mentions 2 of 9 places; total mentions: 2
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 994 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (EX (-CPUUnit <= -1)) AND TaskReady + -TaskOnDisk <= 0)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 994 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EX (-CPUUnit <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(EX(-CPUUnit <= -1))))
lola: processed formula length: 34
lola: 218 rewrites
lola: formula mentions 1 of 9 places; total mentions: 1
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 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: ========================================
lola: subprocess 14 will run for 1439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TaskReady + -TaskOnDisk <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AG ((-TransferToDisk <= -3 OR -FreeMemSegment <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(!(E(TRUE U !((-TransferToDisk <= -3 OR -FreeMemSegment <= -2)))))))
lola: processed formula length: 80
lola: 218 rewrites
lola: formula mentions 2 of 9 places; total mentions: 2
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0032-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 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 2879 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((DiskControllerUnit + -LoadingMem <= 0 OR -DiskControllerUnit <= -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 20 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: RESULT
lola: summary: yes yes no yes no no no no no no no yes yes yes no no
lola: ========================================

BK_STOP 1463749702106

--------------------
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-MT0064DC0032"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/fko/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-MT0064DC0032.tgz
mv SmallOperatingSystem-PT-MT0064DC0032 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 SmallOperatingSystem-PT-MT0064DC0032, 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 r122kn-qhx2-146373367800129"
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 '' CTLCardinality.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 ;