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 PermAdmissibility-PT-50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074kn-smll-146363811200345
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463714965660

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ PermAdmissibility-PT-50
FORMULA PermAdmissibility-COL-50-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-50-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-50-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-50-CTLCardinality-3 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-50-CTLCardinality-4 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-50-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-50-CTLCardinality-6 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-50-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-50-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-50-CTLCardinality-9 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-50-CTLCardinality-10 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-50-CTLCardinality-11 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-50-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-50-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-50-CTLCardinality-14 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-50-CTLCardinality-15 CANNOT_COMPUTE
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-50-CTLCardinality.task
lola: read: (EX (EF (3 <= aux15_2 + aux15_1 + aux15_0 + aux15_6 + aux15_5 + aux15_4 + aux15_3 + aux15_7)) AND AX (AF (2 <= in4_6 + in4_7))) : AG (AG (!(3 <= c11))) : AF (2 <= c16) : EG (EF (3 <= aux5_1 + aux5_0 + aux5_5 + aux5_4)) : AF (2 <= out8_1 + out8_0 + out8_3 + out8_2 + out8_6 + out8_7 + out8_4 + out8_5) : EF (!(AG (2 <= in3_5 + in3_4))) : (E(out3_0 + out3_1 + out3_6 + out3_7 + out3_2 + out3_3 + out3_4... (shortened)
lola: formula length: 1912
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EX (EF (-aux15_7 + -aux15_6 + -aux15_5 + -aux15_4 + -aux15_3 + -aux15_2 + -aux15_1 + -aux15_0 <= -3)) AND AX (AF (-in4_7 + -in4_6 <= -2)))
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: EX (EF (-aux15_7 + -aux15_6 + -aux15_5 + -aux15_4 + -aux15_3 + -aux15_2 + -aux15_1 + -aux15_0 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U -aux15_7 + -aux15_6 + -aux15_5 + -aux15_4 + -aux15_3 + -aux15_2 + -aux15_1 + -aux15_0 <= -3))
lola: processed formula length: 105
lola: 1330 rewrites
lola: formula mentions 8 of 168 places; total mentions: 8
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (AF (-in4_7 + -in4_6 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U -in4_7 + -in4_6 <= -2))
lola: processed formula length: 35
lola: 1330 rewrites
lola: formula mentions 2 of 168 places; total mentions: 2
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-c11 > -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 544 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-c16 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -c16 <= -2)
lola: processed formula length: 20
lola: 1329 rewrites
lola: formula mentions 1 of 168 places; total mentions: 1
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (-aux5_5 + -aux5_4 + -aux5_1 + -aux5_0 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U -aux5_5 + -aux5_4 + -aux5_1 + -aux5_0 <= -3))))
lola: processed formula length: 69
lola: 1330 rewrites
lola: formula mentions 4 of 168 places; total mentions: 4
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-out8_7 + -out8_0 + -out8_1 + -out8_2 + -out8_3 + -out8_4 + -out8_5 + -out8_6 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -out8_7 + -out8_0 + -out8_1 + -out8_2 + -out8_3 + -out8_4 + -out8_5 + -out8_6 <= -2)
lola: processed formula length: 93
lola: 1329 rewrites
lola: formula mentions 8 of 168 places; total mentions: 8
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 5 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-in3_5 + -in3_4 > -2)
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 544 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 6 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E(-in2_3 + -in2_2 + out3_7 + out3_6 + out3_5 + out3_4 + out3_3 + out3_2 + out3_1 + out3_0 <= 0 U -c13 <= -3) OR ((AG (-c18 <= -3) AND EX (-c13 <= -2)) OR -aux12_7 + -aux12_6 + -aux12_5 + -aux12_4 + -aux12_3 + -aux12_2 + -aux12_1 + -aux12_0 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-in2_3 + -in2_2 + out3_7 + out3_6 + out3_5 + out3_4 + out3_3 + out3_2 + out3_1 + out3_0 <= 0 U -c13 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-in2_3 + -in2_2 + out3_7 + out3_6 + out3_5 + out3_4 + out3_3 + out3_2 + out3_1 + out3_0 <= 0 U -c13 <= -3)
lola: processed formula length: 108
lola: 1329 rewrites
lola: formula mentions 11 of 168 places; total mentions: 11
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-c18 <= -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 544 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 8 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -aux12_7 + -aux12_6 + -aux12_5 + -aux12_4 + -aux12_3 + -aux12_2 + -aux12_1 + -aux12_0 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-c8 + c13 > 0 AND in4_7 + in4_6 + -c110 > 0) R (in4_7 + in4_6 + -c14 > 0 AND -c16 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(!((-c8 + c13 > 0 AND in4_7 + in4_6 + -c110 > 0)) U !((in4_7 + in4_6 + -c14 > 0 AND -c16 > -2))))
lola: processed formula length: 100
lola: 1329 rewrites
lola: formula mentions 7 of 168 places; total mentions: 9
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX (-aux16_7 + -aux16_5 + -aux16_3 + -aux16_1 + -aux16_0 + -aux16_2 + -aux16_4 + -aux16_6 > -1) AND EF ((-aux5_5 + -aux5_4 + -aux5_1 + -aux5_0 + c15 > 0 OR out2_7 + out2_6 + out2_5 + out2_4 + out2_3 + out2_2 + out2_1 + out2_0 + -c9 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-aux16_7 + -aux16_5 + -aux16_3 + -aux16_1 + -aux16_0 + -aux16_2 + -aux16_4 + -aux16_6 > -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-aux16_7 + -aux16_5 + -aux16_3 + -aux16_1 + -aux16_0 + -aux16_2 + -aux16_4 + -aux16_6 > -1)
lola: processed formula length: 94
lola: 1329 rewrites
lola: formula mentions 8 of 168 places; total mentions: 8
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 9 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-aux5_5 + -aux5_4 + -aux5_1 + -aux5_0 + c15 > 0 OR out2_7 + out2_6 + out2_5 + out2_4 + out2_3 + out2_2 + out2_1 + out2_0 + -c9 > 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 544 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 9 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (((-aux10_7 + -aux10_6 + -aux10_5 + -aux10_4 + -aux10_3 + -aux10_2 + -aux10_1 + -aux10_0 <= -2 OR -aux5_5 + -aux5_4 + -aux5_1 + -aux5_0 <= -1) AND -aux8_7 + -aux8_6 + -aux8_3 + -aux8_2 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((-aux10_7 + -aux10_6 + -aux10_5 + -aux10_4 + -aux10_3 + -aux10_2 + -aux10_1 + -aux10_0 <= -2 OR -aux5_5 + -aux5_4 + -aux5_1 + -aux5_0 <= -1) AND -aux8_7 + -aux8_6 + -aux8_3 + -aux8_2 <= -2))
lola: processed formula length: 200
lola: 1329 rewrites
lola: formula mentions 16 of 168 places; total mentions: 16
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 10 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (EG (-c17 > -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(!(A(TRUE U !(-c17 > -1))))
lola: processed formula length: 29
lola: 1330 rewrites
lola: formula mentions 1 of 168 places; total mentions: 1
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 11 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-aux13_7 + -aux13_6 + -aux13_5 + -aux13_4 + -aux13_3 + -aux13_2 + -aux13_1 + -aux13_0 + c5 <= 0 AND ((-aux7_7 + -aux7_6 + -aux7_3 + -aux7_2 + c7 <= 0 OR -out7_7 + -out7_6 + -out7_5 + -out7_4 + -out7_3 + -out7_2 + -out7_1 + -out7_0 <= -1) AND (-c16 <= -2 OR -in1_1 + -in1_0 + c11 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-aux13_7 + -aux13_6 + -aux13_5 + -aux13_4 + -aux13_3 + -aux13_2 + -aux13_1 + -aux13_0 + c5 <= 0 AND ((-aux7_7 + -aux7_6 + -aux7_3 + -aux7_2 + c7 <= 0 OR -out7_7 + -out7_6 + -out7_5 + -out7_4 + -out7_3 + -out7_2 + -out7_1 + -out7_0 <= -1) AND (-c16 <= -2 OR -in1_1 + -in1_0 + c11 <= 0))))
lola: processed formula length: 297
lola: 1329 rewrites
lola: formula mentions 26 of 168 places; total mentions: 26
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 12 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E(aux16_7 + aux16_5 + aux16_3 + aux16_1 + aux16_0 + aux16_2 + aux16_4 + aux16_6 + -c6 > 0 R -aux15_7 + -aux15_6 + -aux15_5 + -aux15_4 + -aux15_3 + -aux15_2 + -aux15_1 + -aux15_0 > -3) AND (EF (-in4_7 + -in4_6 > -1) AND EF (-aux9_7 + -aux9_5 + -aux9_0 + -aux9_1 + -aux9_2 + -aux9_3 + -aux9_4 + -aux9_6 > -1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(aux16_7 + aux16_5 + aux16_3 + aux16_1 + aux16_0 + aux16_2 + aux16_4 + aux16_6 + -c6 > 0 R -aux15_7 + -aux15_6 + -aux15_5 + -aux15_4 + -aux15_3 + -aux15_2 + -aux15_1 + -aux15_0 > -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(!(aux16_7 + aux16_5 + aux16_3 + aux16_1 + aux16_0 + aux16_2 + aux16_4 + aux16_6 + -c6 > 0) U !(-aux15_7 + -aux15_6 + -aux15_5 + -aux15_4 + -aux15_3 + -aux15_2 + -aux15_1 + -aux15_0 > -3)))
lola: processed formula length: 192
lola: 1329 rewrites
lola: formula mentions 17 of 168 places; total mentions: 17
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 13 will run for 519 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-in4_7 + -in4_6 > -1)
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 544 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 14 will run for 779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-aux9_7 + -aux9_5 + -aux9_0 + -aux9_1 + -aux9_2 + -aux9_3 + -aux9_4 + -aux9_6 > -1)
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 544 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 13 will run for 519 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (-in1_1 + -in1_0 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U -in1_1 + -in1_0 > -3))))
lola: processed formula length: 46
lola: 1330 rewrites
lola: formula mentions 2 of 168 places; total mentions: 2
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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 14 will run for 779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EG (-out5_7 + -out5_6 + -out5_5 + -out5_4 + -out5_3 + -out5_2 + -out5_1 + -out5_0 > -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(!(A(TRUE U !(-out5_7 + -out5_6 + -out5_5 + -out5_4 + -out5_3 + -out5_2 + -out5_1 + -out5_0 > -1))))))
lola: processed formula length: 114
lola: 1330 rewrites
lola: formula mentions 8 of 168 places; total mentions: 8
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 1241 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AX ((-out6_7 + -out6_6 + -out6_5 + -out6_4 + -out6_3 + -out6_2 + -out6_1 + -out6_0 <= -2 AND -aux5_5 + aux7_7 + aux7_6 + aux7_3 + aux7_2 + -aux5_4 + -aux5_1 + -aux5_0 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((-out6_7 + -out6_6 + -out6_5 + -out6_4 + -out6_3 + -out6_2 + -out6_1 + -out6_0 <= -2 AND -aux5_5 + aux7_7 + aux7_6 + aux7_3 + aux7_2 + -aux5_4 + -aux5_1 + -aux5_0 <= 0)))
lola: processed formula length: 182
lola: 1330 rewrites
lola: formula mentions 16 of 168 places; total mentions: 16
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: RESULT
lola: summary: yes no no unknown unknown yes unknown no yes unknown unknown unknown yes yes unknown unknown

BK_STOP 1463718505611

--------------------
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="PermAdmissibility-PT-50"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-50.tgz
mv PermAdmissibility-PT-50 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 PermAdmissibility-PT-50, 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 r074kn-smll-146363811200345"
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 ;