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 CSRepetitions-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002kn-ebro-146347662600489
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463504444240

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ CSRepetitions-PT-02
FORMULA CSRepetitions-COL-02-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-02-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-02-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-02-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-02-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-02-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-02-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-02-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-02-CTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-02-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-02-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-02-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-02-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-02-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-02-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-02-CTLCardinality-15 TRUE 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: 51/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 23 places, 28 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 45 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-COL-02-CTLCardinality.task
lola: read: E(EF (1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_4 + RequestBuffer_3) U AG (Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_4 + RequestBuffer_3)) : AG (!(AG (Server_Waiting_2 + Server_Waiting_1 <= RequestBufferSlots))) : EG (2 <= Server_Waiting_2 + Server_Waiting_1) : EG (AG ((RequestBufferSlots <= Client_Wa... (shortened)
lola: formula length: 4834
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EF (-RequestBuffer_4 + -RequestBuffer_3 + -RequestBuffer_2 + -RequestBuffer_1 <= -1) U AG (Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + -RequestBuffer_4 + -RequestBuffer_3 + -RequestBuffer_2 + -RequestBuffer_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U -RequestBuffer_4 + -RequestBuffer_3 + -RequestBuffer_2 + -RequestBuffer_1 <= -1) U !(E(TRUE U !(Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + -RequestBuffer_4 + -RequestBuffer_3 + -RequestBuffer_2 + -RequestBuffer_1 <= 0))))
lola: processed formula length: 265
lola: 1749 rewrites
lola: formula mentions 8 of 23 places; total mentions: 12
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (Server_Waiting_1 + Server_Waiting_2 + -RequestBufferSlots > 0))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U Server_Waiting_1 + Server_Waiting_2 + -RequestBufferSlots > 0))))
lola: processed formula length: 87
lola: 1748 rewrites
lola: formula mentions 3 of 23 places; total mentions: 3
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: EG (-Server_Waiting_1 + -Server_Waiting_2 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-Server_Waiting_1 + -Server_Waiting_2 <= -2)))
lola: processed formula length: 59
lola: 1747 rewrites
lola: formula mentions 2 of 23 places; total mentions: 2
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (AG ((RequestBufferSlots + -Client_Waiting_4 + -Client_Waiting_3 + -Client_Waiting_2 + -Client_Waiting_1 <= 0 OR -Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(!(E(TRUE U !((RequestBufferSlots + -Client_Waiting_4 + -Client_Waiting_3 + -Client_Waiting_2 + -Client_Waiting_1 <= 0 OR -Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 <= -1)))))))
lola: processed formula length: 224
lola: 1748 rewrites
lola: formula mentions 9 of 23 places; total mentions: 9
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-Server_Waiting_1 + -Server_Waiting_2 <= -1 AND Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + -RequestBuffer_4 + -RequestBuffer_3 + -RequestBuffer_2 + -RequestBuffer_1 <= 0) U AF (-Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_2 + -Server_Anwering_1_1 + -Server_Anwering_2_1 + -Server_Anwering_2_2 + Server_Waiting_1 + Server_Waiting_2 + -Server_Anw... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((-Server_Waiting_1 + -Server_Waiting_2 <= -1 AND Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + -RequestBuffer_4 + -RequestBuffer_3 + -RequestBuffer_2 + -RequestBuffer_1 <= 0) U A(TRUE U -Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_2 + -Server_Anwering_1_1 + -Server_Anwering_2_1 + -Server_Anwering_2_2 + Server_Waiting_1 + Server_Waiting_2 + -Serve... (shortened)
lola: processed formula length: 444
lola: 1748 rewrites
lola: formula mentions 18 of 23 places; total mentions: 20
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EX (-Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_2 + -Server_Anwering_1_1 + -Server_Anwering_2_1 + -Server_Anwering_2_2 + -Server_Anwering_4_2 + -Server_Anwering_4_1 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(EX(-Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_2 + -Server_Anwering_1_1 + -Server_Anwering_2_1 + -Server_Anwering_2_2 + -Server_Anwering_4_2 + -Server_Anwering_4_1 > -2))))
lola: processed formula length: 206
lola: 1748 rewrites
lola: formula mentions 8 of 23 places; total mentions: 8
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EX (Server_Anwering_3_2 + Server_Anwering_3_1 + -Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_4_2 + Server_Anwering_4_1 <= 0) AND (-RequestBufferSlots <= -1 AND (-Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 <= -3 OR AG (Server_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (Server_Anwering_3_2 + Server_Anwering_3_1 + -Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_4_2 + Server_Anwering_4_1 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(Server_Anwering_3_2 + Server_Anwering_3_1 + -Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_2_1 + Server_Anwering_2_2 + Server_Anwering_4_2 + Server_Anwering_4_1 <= 0)
lola: processed formula length: 262
lola: 1747 rewrites
lola: formula mentions 12 of 23 places; total mentions: 12
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -RequestBufferSlots <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (Server_Waiting_1 + Server_Waiting_2 + -RequestBufferSlots <= 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 68 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 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-Server_Waiting_1 + -Server_Waiting_2 <= -2 U -Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_2 + -Server_Anwering_1_1 + -Server_Anwering_2_1 + -Server_Anwering_2_2 + -Server_Anwering_4_2 + -Server_Anwering_4_1 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-Server_Waiting_1 + -Server_Waiting_2 <= -2 U -Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_2 + -Server_Anwering_1_1 + -Server_Anwering_2_1 + -Server_Anwering_2_2 + -Server_Anwering_4_2 + -Server_Anwering_4_1 <= -1)
lola: processed formula length: 236
lola: 1747 rewrites
lola: formula mentions 10 of 23 places; total mentions: 10
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-Client_Waiting_4 + -Client_Waiting_3 + -Client_Waiting_2 + -Client_Waiting_1 <= -1 AND ((-RequestBufferSlots <= -3 OR -Client_Waiting_4 + -Client_Waiting_3 + -Client_Waiting_2 + -Client_Waiting_1 <= -3) AND (Server_Anwering_3_2 + Server_Anwering_3_1 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_2_1 + Server_Anwering_2_2 + -Client_Waiting_4 + -Client_Waiting_3 + -Client_Waiting_2 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 5 atomic propositions
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EF (-Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_2 + -Server_Anwering_1_1 + -Server_Anwering_2_1 + -Server_Anwering_2_2 + Server_Waiting_1 + Server_Waiting_2 + -Server_Anwering_4_2 + -Server_Anwering_4_1 <= 0) U -Server_Waiting_1 + -Server_Waiting_2 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U -Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_2 + -Server_Anwering_1_1 + -Server_Anwering_2_1 + -Server_Anwering_2_2 + Server_Waiting_1 + Server_Waiting_2 + -Server_Anwering_4_2 + -Server_Anwering_4_1 <= 0) U -Server_Waiting_1 + -Server_Waiting_2 <= -3)
lola: processed formula length: 283
lola: 1748 rewrites
lola: formula mentions 10 of 23 places; total mentions: 12
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (AF (-Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_2 + -Server_Anwering_1_1 + -Server_Anwering_2_1 + -Server_Anwering_2_2 + -Server_Anwering_4_2 + -Server_Anwering_4_1 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U -Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_2 + -Server_Anwering_1_1 + -Server_Anwering_2_1 + -Server_Anwering_2_2 + -Server_Anwering_4_2 + -Server_Anwering_4_1 <= -1))
lola: processed formula length: 201
lola: 1748 rewrites
lola: formula mentions 8 of 23 places; total mentions: 8
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-RequestBuffer_4 + -RequestBuffer_3 + -RequestBuffer_2 + -RequestBuffer_1 > -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 68 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 invariant.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (AG (-RequestBufferSlots <= -3)) AND AX (Server_Anwering_3_2 + Server_Anwering_3_1 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_2_1 + Server_Anwering_2_2 + -RequestBufferSlots + Server_Anwering_4_2 + Server_Anwering_4_1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG (-RequestBufferSlots <= -3))
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 !(-RequestBufferSlots <= -3))))
lola: processed formula length: 51
lola: 1748 rewrites
lola: formula mentions 1 of 23 places; total mentions: 1
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_2 + -Server_Anwering_1_1 + -Server_Anwering_2_1 + -Server_Anwering_2_2 + RequestBuffer_4 + RequestBuffer_3 + RequestBuffer_2 + RequestBuffer_1 + -Server_Anwering_4_2 + -Server_Anwering_4_1 <= 0 OR AG (-Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_2 + -Server_Anwering_1_1 + -Server_Anwering_2_1 + -Server_Anwering_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_2 + -Server_Anwering_1_1 + -Server_Anwering_2_1 + -Server_Anwering_2_2 + RequestBuffer_4 + RequestBuffer_3 + RequestBuffer_2 + RequestBuffer_1 + -Server_Anwering_4_2 + -Server_Anwering_4_1 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EG (-Server_Waiting_1 + -Server_Waiting_2 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(A(TRUE U !(-Server_Waiting_1 + -Server_Waiting_2 <= -3))))
lola: processed formula length: 69
lola: 1748 rewrites
lola: formula mentions 2 of 23 places; total mentions: 2
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Server_Waiting_1 + -Server_Waiting_2 + Client_Waiting_4 + Client_Waiting_3 + Client_Waiting_2 + Client_Waiting_1 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 + RequestBuffer_4 + RequestBuffer_3 + RequestBuffer_2 + RequestBuffer_1 > 0 AND -Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_2 + -Server_Anwering_1_1 + -Server_Anwering_2_1 + -Server_Anwering_2_2 + RequestBuffer_4 + RequestBuffer_3 + RequestBuffer_2 + RequestBuffer_1 + -Server_Anwering_4_2 + -Ser... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 + RequestBuffer_4 + RequestBuffer_3 + RequestBuffer_2 + RequestBuffer_1 > 0 AND -Server_Anwering_3_2 + -Server_Anwering_3_1 + -Server_Anwering_1_2 + -Server_Anwering_1_1 + -Server_Anwering_2_1 + -Server_Anwering_2_2 + RequestBuffer_4 + RequestBuffer_3 + RequestBuffer_2 + RequestBuffer_1 + -Server_Anwering_4_2 +... (shortened)
lola: processed formula length: 428
lola: 1747 rewrites
lola: formula mentions 16 of 23 places; total mentions: 20
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Server_Waiting_1 + -Server_Waiting_2 > -1 OR (Server_Anwering_3_2 + Server_Anwering_3_1 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_2_1 + Server_Anwering_2_2 + -Server_Waiting_1 + -Server_Waiting_2 + Server_Anwering_4_2 + Server_Anwering_4_1 <= 0 OR (-Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 + RequestBufferSlots <= 0 OR AX (-Client_Waitin... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((-Server_Waiting_1 + -Server_Waiting_2 > -1 OR (Server_Anwering_3_2 + Server_Anwering_3_1 + Server_Anwering_1_2 + Server_Anwering_1_1 + Server_Anwering_2_1 + Server_Anwering_2_2 + -Server_Waiting_1 + -Server_Waiting_2 + Server_Anwering_4_2 + Server_Anwering_4_1 <= 0 OR (-Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 + RequestBufferSlots <= 0 OR AX(-Clien... (shortened)
lola: processed formula length: 484
lola: 1748 rewrites
lola: formula mentions 19 of 23 places; total mentions: 21
lola: closed formula file CSRepetitions-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 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: RESULT
lola: summary: no yes yes yes no no no no no yes no no no no no yes

BK_STOP 1463504445390

--------------------
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="CSRepetitions-PT-02"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/CSRepetitions-PT-02.tgz
mv CSRepetitions-PT-02 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 CSRepetitions-PT-02, 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 r002kn-ebro-146347662600489"
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 ;