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

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

=== Now, execution of the tool begins

BK_START 1463508152713

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ CSRepetitions-PT-10
FORMULA CSRepetitions-COL-10-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-CTLCardinality-5 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-10-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-10-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: 3611/65536 symbol table entries, 88 collisions
lola: preprocessing...
lola: finding significant places
lola: 1311 places, 2300 transitions, 1201 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3501 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-COL-10-CTLCardinality.task
lola: read: !(AG (((Server_Anwering_64_1 + Server_Anwering_43_6 + Server_Anwering_91_2 + Server_Anwering_39_9 + Server_Anwering_15_10 + Server_Anwering_8_6 + Server_Anwering_34_6 + Server_Anwering_53_7 + Server_Anwering_46_7 + Server_Anwering_87_1 + Server_Anwering_11_9 + Server_Anwering_25_7 + Server_Anwering_50_6 + Server_Anwering_27_7 + Server_Anwering_38_3 + Server_Anwering_22_2 + Server_Anwering_25_9 + S... (shortened)
lola: formula length: 328928
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 197 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((Server_Anwering_71_9 + Server_Anwering_71_8 + Server_Anwering_71_7 + Server_Anwering_71_6 + Server_Anwering_71_5 + Server_Anwering_71_4 + Server_Anwering_71_3 + Server_Anwering_71_2 + Server_Anwering_71_1 + Server_Anwering_99_10 + Server_Anwering_21_7 + Server_Anwering_21_6 + Server_Anwering_21_5 + Server_Anwering_21_4 + Server_Anwering_21_3 + Server_Anwering_21_2 + Server_Anwering_21_1 + Ser... (shortened)
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 4804 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: subprocess 1 will run for 210 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EX (Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 + Client_Sending_100 + Client_Sending_99 + Client_Sending_98 + Client_Sending_97 + Client_Sending_96 + Client_Sending_95 + Client_Sending_94 + Client_Sending_93 + Client_Sending_92 + Client_Sending_91 + Client_Sending_90 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX(Client_Sending_1 + Client_Sending_2 + Client_Sending_3 + Client_Sending_4 + Client_Sending_5 + Client_Sending_6 + Client_Sending_7 + Client_Sending_8 + Client_Sending_9 + Client_Sending_100 + Client_Sending_99 + Client_Sending_98 + Client_Sending_97 + Client_Sending_96 + Client_Sending_95 + Client_Sending_94 + Client_Sending_93 + Client_Sending_92 + Client_Sending_91 + Client_Sending_90 + Cl... (shortened)
lola: processed formula length: 2024
lola: 8840719 rewrites
lola: formula mentions 101 of 1311 places; total mentions: 101
lola: closed formula file CSRepetitions-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4804 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 2 will run for 225 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file CSRepetitions-COL-10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Server_Waiting_1 + -Server_Waiting_2 + -Server_Waiting_3 + -Server_Waiting_4 + -Server_Waiting_5 + -Server_Waiting_6 + -Server_Waiting_7 + -Server_Waiting_8 + -Server_Waiting_9 + -Server_Waiting_10 <= -2 AND -Client_Waiting_10 + -Client_Waiting_11 + -Client_Waiting_12 + -Client_Waiting_13 + -Client_Waiting_14 + -Client_Waiting_15 + -Client_Waiting_16 + -Client_Waiting_17 + -Client_Waiting_1... (shortened)
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 4804 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 4 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(AG (-Client_Waiting_10 + -Client_Waiting_11 + -Client_Waiting_12 + -Client_Waiting_13 + -Client_Waiting_14 + -Client_Waiting_15 + -Client_Waiting_16 + -Client_Waiting_17 + -Client_Waiting_18 + -Client_Waiting_19 + -Client_Waiting_20 + -Client_Waiting_21 + -Client_Waiting_22 + -Client_Waiting_23 + -Client_Waiting_24 + -Client_Waiting_25 + -Client_Waiting_26 + -Client_Waiting_27 + -Client_Waiting_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(!(E(TRUE U !(-Client_Waiting_10 + -Client_Waiting_11 + -Client_Waiting_12 + -Client_Waiting_13 + -Client_Waiting_14 + -Client_Waiting_15 + -Client_Waiting_16 + -Client_Waiting_17 + -Client_Waiting_18 + -Client_Waiting_19 + -Client_Waiting_20 + -Client_Waiting_21 + -Client_Waiting_22 + -Client_Waiting_23 + -Client_Waiting_24 + -Client_Waiting_25 + -Client_Waiting_26 + -Client_Waiting_27 + -Client... (shortened)
lola: processed formula length: 28131
lola: 8840719 rewrites
lola: formula mentions 1100 of 1311 places; total mentions: 1200
lola: closed formula file CSRepetitions-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4804 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 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EX (-RequestBuffer_99 + -RequestBuffer_98 + -RequestBuffer_97 + -RequestBuffer_96 + -RequestBuffer_95 + -RequestBuffer_94 + -RequestBuffer_93 + -RequestBuffer_92 + -RequestBuffer_91 + -RequestBuffer_90 + -RequestBuffer_89 + -RequestBuffer_88 + -RequestBuffer_87 + -RequestBuffer_86 + -RequestBuffer_85 + -RequestBuffer_84 + -RequestBuffer_83 + -RequestBuffer_82 + -RequestBuffer_81 + -RequestBuff... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(EX(-RequestBuffer_99 + -RequestBuffer_98 + -RequestBuffer_97 + -RequestBuffer_96 + -RequestBuffer_95 + -RequestBuffer_94 + -RequestBuffer_93 + -RequestBuffer_92 + -RequestBuffer_91 + -RequestBuffer_90 + -RequestBuffer_89 + -RequestBuffer_88 + -RequestBuffer_87 + -RequestBuffer_86 + -RequestBuffer_85 + -RequestBuffer_84 + -RequestBuffer_83 + -RequestBuffer_82 + -RequestBuffer_81 + -Req... (shortened)
lola: processed formula length: 2014
lola: 8840719 rewrites
lola: formula mentions 100 of 1311 places; total mentions: 100
lola: closed formula file CSRepetitions-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4804 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file CSRepetitions-COL-10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 + -Client_Sending_5 + -Client_Sending_6 + -Client_Sending_7 + -Client_Sending_8 + -Client_Sending_9 + -Client_Sending_100 + -Client_Sending_99 + -Client_Sending_98 + -Client_Sending_97 + -Client_Sending_96 + -Client_Sending_95 + -Client_Sending_94 + -Client_Sending_93 + -Client_Sending_92 + -Client_Sending_91 + -Client... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 + -Client_Sending_5 + -Client_Sending_6 + -Client_Sending_7 + -Client_Sending_8 + -Client_Sending_9 + -Client_Sending_100 + -Client_Sending_99 + -Client_Sending_98 + -Client_Sending_97 + -Client_Sending_96 + -Client_Sending_95 + -Client_Sending_94 + -Client_Sending_93 + -Client_Sending_92 + -Client_Sending_91 + -Client_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 7 atomic propositions
lola: closed formula file CSRepetitions-COL-10-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 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-RequestBuffer_99 + -RequestBuffer_98 + -RequestBuffer_97 + -RequestBuffer_96 + -RequestBuffer_95 + -RequestBuffer_94 + -RequestBuffer_93 + -RequestBuffer_92 + -RequestBuffer_91 + -RequestBuffer_90 + -RequestBuffer_89 + -RequestBuffer_88 + -RequestBuffer_87 + -RequestBuffer_86 + -RequestBuffer_85 + -RequestBuffer_84 + -RequestBuffer_83 + -RequestBuffer_82 + -RequestBuffer_81 + -RequestBuffer_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-RequestBuffer_99 + -RequestBuffer_98 + -RequestBuffer_97 + -RequestBuffer_96 + -RequestBuffer_95 + -RequestBuffer_94 + -RequestBuffer_93 + -RequestBuffer_92 + -RequestBuffer_91 + -RequestBuffer_90 + -RequestBuffer_89 + -RequestBuffer_88 + -RequestBuffer_87 + -RequestBuffer_86 + -RequestBuffer_85 + -RequestBuffer_84 + -RequestBuffer_83 + -RequestBuffer_82 + -RequestBuffer_81 + -Reque... (shortened)
lola: processed formula length: 4200
lola: 8840718 rewrites
lola: formula mentions 110 of 1311 places; total mentions: 210
lola: closed formula file CSRepetitions-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4804 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 359 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (Server_Anwering_71_9 + Server_Anwering_71_8 + Server_Anwering_71_7 + Server_Anwering_71_6 + Server_Anwering_71_5 + Server_Anwering_71_4 + Server_Anwering_71_3 + Server_Anwering_71_2 + Server_Anwering_71_1 + Server_Anwering_99_10 + Server_Anwering_21_7 + Server_Anwering_21_6 + Server_Anwering_21_5 + Server_Anwering_21_4 + Server_Anwering_21_3 + Server_Anwering_21_2 + Server_Anwering_21_1 + Serv... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(Server_Anwering_71_9 + Server_Anwering_71_8 + Server_Anwering_71_7 + Server_Anwering_71_6 + Server_Anwering_71_5 + Server_Anwering_71_4 + Server_Anwering_71_3 + Server_Anwering_71_2 + Server_Anwering_71_1 + Server_Anwering_99_10 + Server_Anwering_21_7 + Server_Anwering_21_6 + Server_Anwering_21_5 + Server_Anwering_21_4 + Server_Anwering_21_3 + Server_Anwering_21_2 + Server_Anwering_21... (shortened)
lola: processed formula length: 23239
lola: 8840718 rewrites
lola: formula mentions 1010 of 1311 places; total mentions: 1010
lola: closed formula file CSRepetitions-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4804 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 9 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (Client_Waiting_10 + Client_Waiting_11 + Client_Waiting_12 + Client_Waiting_13 + Client_Waiting_14 + Client_Waiting_15 + Client_Waiting_16 + Client_Waiting_17 + Client_Waiting_18 + Client_Waiting_19 + Client_Waiting_20 + Client_Waiting_21 + Client_Waiting_22 + Client_Waiting_23 + Client_Waiting_24 + Client_Waiting_25 + Client_Waiting_26 + Client_Waiting_27 + Client_Waiting_28 + Client_Waiting_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (Client_Waiting_10 + Client_Waiting_11 + Client_Waiting_12 + Client_Waiting_13 + Client_Waiting_14 + Client_Waiting_15 + Client_Waiting_16 + Client_Waiting_17 + Client_Waiting_18 + Client_Waiting_19 + Client_Waiting_20 + Client_Waiting_21 + Client_Waiting_22 + Client_Waiting_23 + Client_Waiting_24 + Client_Waiting_25 + Client_Waiting_26 + Client_Waiting_27 + Client_Waiting_28 + Client_Waiting_2... (shortened)
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 4804 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 10 will run for 478 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (Server_Anwering_71_9 + Server_Anwering_71_8 + Server_Anwering_71_7 + Server_Anwering_71_6 + Server_Anwering_71_5 + Server_Anwering_71_4 + Server_Anwering_71_3 + Server_Anwering_71_2 + Server_Anwering_71_1 + Server_Anwering_99_10 + -Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 + -Client_Sending_5 + -Client_Sending_6 + -Client_Sending_7 + -Client_Sending_8 + -Clie... (shortened)
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 4804 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 574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (AF ((RequestBuffer_99 + RequestBuffer_98 + RequestBuffer_97 + RequestBuffer_96 + RequestBuffer_95 + RequestBuffer_94 + RequestBuffer_93 + RequestBuffer_92 + RequestBuffer_91 + RequestBuffer_90 + RequestBuffer_89 + RequestBuffer_88 + RequestBuffer_87 + RequestBuffer_86 + RequestBuffer_85 + RequestBuffer_84 + RequestBuffer_83 + RequestBuffer_82 + RequestBuffer_81 + RequestBuffer_80 + RequestBuff... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(TRUE U (RequestBuffer_99 + RequestBuffer_98 + RequestBuffer_97 + RequestBuffer_96 + RequestBuffer_95 + RequestBuffer_94 + RequestBuffer_93 + RequestBuffer_92 + RequestBuffer_91 + RequestBuffer_90 + RequestBuffer_89 + RequestBuffer_88 + RequestBuffer_87 + RequestBuffer_86 + RequestBuffer_85 + RequestBuffer_84 + RequestBuffer_83 + RequestBuffer_82 + RequestBuffer_81 + RequestBuffer_80... (shortened)
lola: processed formula length: 2164
lola: 8840719 rewrites
lola: formula mentions 111 of 1311 places; total mentions: 112
lola: closed formula file CSRepetitions-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4804 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 12 will run for 717 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-Server_Anwering_71_9 + -Server_Anwering_71_8 + -Server_Anwering_71_7 + -Server_Anwering_71_6 + -Server_Anwering_71_5 + -Server_Anwering_71_4 + -Server_Anwering_71_3 + -Server_Anwering_71_2 + -Server_Anwering_71_1 + -Server_Anwering_99_10 + -Server_Anwering_21_7 + -Server_Anwering_21_6 + -Server_Anwering_21_5 + -Server_Anwering_21_4 + -Server_Anwering_21_3 + -Server_Anwering_21_2 + -Server_Anw... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -Server_Anwering_71_9 + -Server_Anwering_71_8 + -Server_Anwering_71_7 + -Server_Anwering_71_6 + -Server_Anwering_71_5 + -Server_Anwering_71_4 + -Server_Anwering_71_3 + -Server_Anwering_71_2 + -Server_Anwering_71_1 + -Server_Anwering_99_10 + -Server_Anwering_21_7 + -Server_Anwering_21_6 + -Server_Anwering_21_5 + -Server_Anwering_21_4 + -Server_Anwering_21_3 + -Server_Anwering_21_2 + -Serve... (shortened)
lola: processed formula length: 24033
lola: 8840718 rewrites
lola: formula mentions 1000 of 1311 places; total mentions: 1000
lola: closed formula file CSRepetitions-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4804 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 13 will run for 957 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (A(-Server_Waiting_1 + -Server_Waiting_2 + -Server_Waiting_3 + -Server_Waiting_4 + -Server_Waiting_5 + -Server_Waiting_6 + -Server_Waiting_7 + -Server_Waiting_8 + -Server_Waiting_9 + -Server_Waiting_10 <= -3 U -Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 + -Client_Sending_5 + -Client_Sending_6 + -Client_Sending_7 + -Client_Sending_8 + -Client_Sending_9 + -Client... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(A(-Server_Waiting_1 + -Server_Waiting_2 + -Server_Waiting_3 + -Server_Waiting_4 + -Server_Waiting_5 + -Server_Waiting_6 + -Server_Waiting_7 + -Server_Waiting_8 + -Server_Waiting_9 + -Server_Waiting_10 <= -3 U -Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 + -Client_Sending_5 + -Client_Sending_6 + -Client_Sending_7 + -Client_Sending_8 + -Client_Sending_9 ... (shortened)
lola: processed formula length: 2321
lola: 8840719 rewrites
lola: formula mentions 110 of 1311 places; total mentions: 110
lola: closed formula file CSRepetitions-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4804 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 14 will run for 1435 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Server_Anwering_71_9 + -Server_Anwering_71_8 + -Server_Anwering_71_7 + -Server_Anwering_71_6 + -Server_Anwering_71_5 + -Server_Anwering_71_4 + -Server_Anwering_71_3 + -Server_Anwering_71_2 + -Server_Anwering_71_1 + -Server_Anwering_99_10 + -Server_Anwering_21_7 + -Server_Anwering_21_6 + -Server_Anwering_21_5 + -Server_Anwering_21_4 + -Server_Anwering_21_3 + -Server_Anwering_21_2 + -Server_Anw... (shortened)
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 4804 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: subprocess 15 will run for 2871 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (-RequestBuffer_99 + -RequestBuffer_98 + -RequestBuffer_97 + -RequestBuffer_96 + -RequestBuffer_95 + -RequestBuffer_94 + -RequestBuffer_93 + -RequestBuffer_92 + -RequestBuffer_91 + -RequestBuffer_90 + -RequestBuffer_89 + -RequestBuffer_88 + -RequestBuffer_87 + -RequestBuffer_86 + -RequestBuffer_85 + -RequestBuffer_84 + -RequestBuffer_83 + -RequestBuffer_82 + -RequestBuffer_81 + -RequestBuffer_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2871 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-RequestBuffer_99 + -RequestBuffer_98 + -RequestBuffer_97 + -RequestBuffer_96 + -RequestBuffer_95 + -RequestBuffer_94 + -RequestBuffer_93 + -RequestBuffer_92 + -RequestBuffer_91 + -RequestBuffer_90 + -RequestBuffer_89 + -RequestBuffer_88 + -RequestBuffer_87 + -RequestBuffer_86 + -RequestBuffer_85 + -RequestBuffer_84 + -RequestBuffer_83 + -RequestBuffer_82 + -RequestBuffer_81 + -RequestBuffer_8... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -RequestBuffer_99 + -RequestBuffer_98 + -RequestBuffer_97 + -RequestBuffer_96 + -RequestBuffer_95 + -RequestBuffer_94 + -RequestBuffer_93 + -RequestBuffer_92 + -RequestBuffer_91 + -RequestBuffer_90 + -RequestBuffer_89 + -RequestBuffer_88 + -RequestBuffer_87 + -RequestBuffer_86 + -RequestBuffer_85 + -RequestBuffer_84 + -RequestBuffer_83 + -RequestBuffer_82 + -RequestBuffer_81 + -RequestBuf... (shortened)
lola: processed formula length: 2004
lola: 8840718 rewrites
lola: formula mentions 100 of 1311 places; total mentions: 100
lola: closed formula file CSRepetitions-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 4804 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Server_Waiting_1 + -Server_Waiting_2 + -Server_Waiting_3 + -Server_Waiting_4 + -Server_Waiting_5 + -Server_Waiting_6 + -Server_Waiting_7 + -Server_Waiting_8 + -Server_Waiting_9 + -Server_Waiting_10 <= -3 OR -Client_Sending_1 + -Client_Sending_2 + -Client_Sending_3 + -Client_Sending_4 + -Client_Sending_5 + -Client_Sending_6 + -Client_Sending_7 + -Client_Sending_8 + -Client_Sending_9 + -Client... (shortened)
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 4804 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: RESULT
lola: summary: yes yes no no no unknown no yes yes yes no no no no yes no

BK_STOP 1463508822203

--------------------
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-10"
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-10.tgz
mv CSRepetitions-PT-10 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-10, 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-146347662600534"
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 ;