About the Execution of LoLa for PermAdmissibility-PT-05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15953.040 | 1885074.00 | 1888649.00 | 5129.40 | ??TTF?FTFTT?TF?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-2979
Executing tool lola
Input is PermAdmissibility-PT-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074kn-smll-146363811200318
=====================================================================
--------------------
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-05-CTLCardinality-0
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-1
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-15
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-2
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-3
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-4
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-5
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-6
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-7
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-8
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1463700740707
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ PermAdmissibility-PT-05
FORMULA PermAdmissibility-COL-05-CTLCardinality-0 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-05-CTLCardinality-1 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-05-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-CTLCardinality-5 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-05-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-CTLCardinality-8 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-05-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-CTLCardinality-13 CANNOT_COMPUTE
FORMULA PermAdmissibility-COL-05-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-05-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: 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-05-CTLCardinality.task
lola: read: AF (!(EF (3 <= in1_1 + in1_0))) : !(!(AF (!(out7_1 + out7_0 + out7_3 + out7_2 + out7_5 + out7_4 + out7_7 + out7_6 <= c17)))) : ((EX (!(1 <= aux11_5 + aux11_4 + aux11_3 + aux11_2 + aux11_1 + aux11_0 + aux11_7 + aux11_6)) OR AX (1 <= c6)) AND AF (AF (3 <= aux10_0 + aux10_2 + aux10_1 + aux10_4 + aux10_3 + aux10_5 + aux10_6 + aux10_7))) : (AX ((!(c13 <= c110) AND 3 <= aux14_0 + aux14_1 + aux14_2 + aux... (shortened)
lola: formula length: 3361
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG (-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: 2751 rewrites
lola: formula mentions 2 of 168 places; total mentions: 2
lola: closed formula file PermAdmissibility-COL-05-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 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (out7_7 + out7_6 + out7_5 + out7_4 + out7_3 + out7_2 + out7_1 + out7_0 + -c17 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U out7_7 + out7_6 + out7_5 + out7_4 + out7_3 + out7_2 + out7_1 + out7_0 + -c17 > 0)
lola: processed formula length: 90
lola: 2750 rewrites
lola: formula mentions 9 of 168 places; total mentions: 9
lola: closed formula file PermAdmissibility-COL-05-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 2 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EX (-aux11_7 + -aux11_6 + -aux11_5 + -aux11_4 + -aux11_3 + -aux11_2 + -aux11_1 + -aux11_0 > -1) OR AX (-c6 <= -1)) AND AF (-aux10_7 + -aux10_6 + -aux10_5 + -aux10_4 + -aux10_3 + -aux10_2 + -aux10_1 + -aux10_0 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (-aux11_7 + -aux11_6 + -aux11_5 + -aux11_4 + -aux11_3 + -aux11_2 + -aux11_1 + -aux11_0 > -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(-aux11_7 + -aux11_6 + -aux11_5 + -aux11_4 + -aux11_3 + -aux11_2 + -aux11_1 + -aux11_0 > -1)
lola: processed formula length: 94
lola: 2750 rewrites
lola: formula mentions 8 of 168 places; total mentions: 8
lola: closed formula file PermAdmissibility-COL-05-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 3 will run for 238 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 <= -3)
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 <= -3)
lola: processed formula length: 101
lola: 2750 rewrites
lola: formula mentions 8 of 168 places; total mentions: 8
lola: closed formula file PermAdmissibility-COL-05-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX ((-c110 + c13 > 0 AND -aux14_7 + -aux14_6 + -aux14_5 + -aux14_4 + -aux14_3 + -aux14_2 + -aux14_1 + -aux14_0 <= -3)) OR EF (-aux14_7 + -aux14_6 + -aux14_5 + -aux14_4 + -aux14_3 + -aux14_2 + -aux14_1 + -aux14_0 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((-c110 + c13 > 0 AND -aux14_7 + -aux14_6 + -aux14_5 + -aux14_4 + -aux14_3 + -aux14_2 + -aux14_1 + -aux14_0 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((-c110 + c13 > 0 AND -aux14_7 + -aux14_6 + -aux14_5 + -aux14_4 + -aux14_3 + -aux14_2 + -aux14_1 + -aux14_0 <= -3))
lola: processed formula length: 117
lola: 2750 rewrites
lola: formula mentions 10 of 168 places; total mentions: 10
lola: closed formula file PermAdmissibility-COL-05-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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-aux14_7 + -aux14_6 + -aux14_5 + -aux14_4 + -aux14_3 + -aux14_2 + -aux14_1 + -aux14_0 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 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 4 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((EX (-aux7_7 + -aux7_6 + -aux7_3 + -aux7_2 + c12 <= 0) OR aux11_7 + -aux13_7 + -aux13_6 + -aux13_5 + -aux13_4 + -aux13_3 + -aux13_2 + -aux13_1 + -aux13_0 + aux11_6 + aux11_5 + aux11_4 + aux11_3 + aux11_2 + aux11_1 + aux11_0 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((EX(-aux7_7 + -aux7_6 + -aux7_3 + -aux7_2 + c12 <= 0) OR aux11_7 + -aux13_7 + -aux13_6 + -aux13_5 + -aux13_4 + -aux13_3 + -aux13_2 + -aux13_1 + -aux13_0 + aux11_6 + aux11_5 + aux11_4 + aux11_3 + aux11_2 + aux11_1 + aux11_0 <= 0))))
lola: processed formula length: 244
lola: 2751 rewrites
lola: formula mentions 21 of 168 places; total mentions: 21
lola: closed formula file PermAdmissibility-COL-05-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 5 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(((out6_7 + out6_6 + out6_5 + out6_4 + out6_3 + out6_2 + out6_1 + out6_0 + -c9 <= 0 OR out2_7 + -out6_7 + -out6_6 + -out6_5 + -out6_4 + -out6_3 + -out6_2 + -out6_1 + -out6_0 + out2_6 + out2_5 + out2_4 + out2_3 + out2_2 + out2_1 + out2_0 <= 0) AND (out7_7 + out7_6 + out7_5 + out7_4 + out7_3 + out7_2 + out7_1 + out7_0 + -c11 <= 0 OR -out2_7 + out4_7 + out4_6 + out4_5 + out4_4 + out4_3 + out4_2 + ou... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((out6_7 + out6_6 + out6_5 + out6_4 + out6_3 + out6_2 + out6_1 + out6_0 + -c9 <= 0 OR out2_7 + -out6_7 + -out6_6 + -out6_5 + -out6_4 + -out6_3 + -out6_2 + -out6_1 + -out6_0 + out2_6 + out2_5 + out2_4 + out2_3 + out2_2 + out2_1 + out2_0 <= 0) AND (out7_7 + out7_6 + out7_5 + out7_4 + out7_3 + out7_2 + out7_1 + out7_0 + -c11 <= 0 OR -out2_7 + out4_7 + out4_6 + out4_5 + out4_4 + out4_3 + out4_2 + ou... (shortened)
lola: processed formula length: 519
lola: 2751 rewrites
lola: formula mentions 35 of 168 places; total mentions: 51
lola: closed formula file PermAdmissibility-COL-05-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 6 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX ((EF (in1_1 + in1_0 + -aux10_7 + -aux10_6 + -aux10_5 + -aux10_4 + -aux10_3 + -aux10_2 + -aux10_1 + -aux10_0 <= 0) OR (c9 + -c14 > 0 AND -aux8_7 + -aux8_6 + -aux8_3 + -aux8_2 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((E(TRUE U in1_1 + in1_0 + -aux10_7 + -aux10_6 + -aux10_5 + -aux10_4 + -aux10_3 + -aux10_2 + -aux10_1 + -aux10_0 <= 0) OR (c9 + -c14 > 0 AND -aux8_7 + -aux8_6 + -aux8_3 + -aux8_2 <= -1)))
lola: processed formula length: 189
lola: 2751 rewrites
lola: formula mentions 16 of 168 places; total mentions: 16
lola: closed formula file PermAdmissibility-COL-05-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 7 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-c11 > -3 AND (-c18 > -2 AND AG (-c8 <= -2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-c11 > -3 AND (-c18 > -2 AND !(E(TRUE U !(-c8 <= -2))))))
lola: processed formula length: 67
lola: 2751 rewrites
lola: formula mentions 3 of 168 places; total mentions: 3
lola: closed formula file PermAdmissibility-COL-05-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: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-aux6_5 + -aux6_4 + -aux6_1 + -aux6_0 <= -3 OR ((-out4_7 + -out4_6 + -out4_5 + -out4_4 + -out4_3 + -out4_2 + -out4_1 + -out4_0 <= -1 AND (-in3_5 + -in3_4 > -1 OR in2_3 + in2_2 + -in1_1 + -in1_0 > 0)) OR EG (out6_7 + out6_6 + out6_5 + out6_4 + out6_3 + out6_2 + out6_1 + out6_0 + -c13 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -aux6_5 + -aux6_4 + -aux6_1 + -aux6_0 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PermAdmissibility-COL-05-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 402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-out4_7 + -out4_6 + -out4_5 + -out4_4 + -out4_3 + -out4_2 + -out4_1 + -out4_0 <= -1 AND (-in3_5 + -in3_4 > -1 OR in2_3 + in2_2 + -in1_1 + -in1_0 > 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 469 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (out6_7 + out6_6 + out6_5 + out6_4 + out6_3 + out6_2 + out6_1 + out6_0 + -c13 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(out6_7 + out6_6 + out6_5 + out6_4 + out6_3 + out6_2 + out6_1 + out6_0 + -c13 <= 0)))
lola: processed formula length: 97
lola: 2750 rewrites
lola: formula mentions 9 of 168 places; total mentions: 9
lola: closed formula file PermAdmissibility-COL-05-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: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-aux10_7 + -aux10_6 + -aux10_5 + -aux10_4 + -aux10_3 + -aux10_2 + -aux10_1 + -aux10_0 > -2 AND EG (-c14 > -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -aux10_7 + -aux10_6 + -aux10_5 + -aux10_4 + -aux10_3 + -aux10_2 + -aux10_1 + -aux10_0 > -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-c14 > -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-c14 > -3)))
lola: processed formula length: 25
lola: 2750 rewrites
lola: formula mentions 1 of 168 places; total mentions: 1
lola: closed formula file PermAdmissibility-COL-05-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 10 will run for 410 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(EG (-aux8_7 + -aux8_6 + -aux8_3 + -aux8_2 <= -3) U EF (-aux10_7 + -aux10_6 + -aux10_5 + -aux10_4 + -aux10_3 + -aux10_2 + -aux10_1 + -aux10_0 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(!(A(TRUE U !(-aux8_7 + -aux8_6 + -aux8_3 + -aux8_2 <= -3))) U E(TRUE U -aux10_7 + -aux10_6 + -aux10_5 + -aux10_4 + -aux10_3 + -aux10_2 + -aux10_1 + -aux10_0 <= -1))
lola: processed formula length: 166
lola: 2752 rewrites
lola: formula mentions 12 of 168 places; total mentions: 12
lola: closed formula file PermAdmissibility-COL-05-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 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EG (-c14 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(A(TRUE U !(-c14 > -2))))
lola: processed formula length: 35
lola: 2751 rewrites
lola: formula mentions 1 of 168 places; total mentions: 1
lola: closed formula file PermAdmissibility-COL-05-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 12 will run for 616 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-out8_7 + -out8_0 + -out8_1 + -out8_2 + -out8_3 + -out8_4 + -out8_5 + -out8_6 > -1 AND -out1_7 + -out1_6 + -out1_5 + -out1_4 + -out1_3 + -out1_2 + -out1_1 + -out1_0 > -2) OR (-aux9_7 + -aux9_5 + out6_7 + out6_6 + out6_5 + out6_4 + out6_3 + out6_2 + out6_1 + out6_0 + -aux9_0 + -aux9_1 + -aux9_2 + -aux9_3 + -aux9_4 + -aux9_6 > 0 AND -aux12_7 + -aux12_6 + -aux12_5 + -aux12_4 + -aux12_3 + -aux12... (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 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 13 will run for 821 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-c17 > -3 OR ((-c110 <= -1 AND aux9_7 + aux9_5 + aux9_0 + aux9_1 + aux9_2 + aux9_3 + aux9_4 + aux9_6 + -c15 <= 0) OR AX (-out3_7 + -out3_6 + -out3_5 + -out3_4 + -out3_3 + -out3_2 + -out3_1 + -out3_0 <= -3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !((-c17 > -3 OR ((-c110 <= -1 AND aux9_7 + aux9_5 + aux9_0 + aux9_1 + aux9_2 + aux9_3 + aux9_4 + aux9_6 + -c15 <= 0) OR AX(-out3_7 + -out3_6 + -out3_5 + -out3_4 + -out3_3 + -out3_2 + -out3_1 + -out3_0 <= -3))))))
lola: processed formula length: 223
lola: 2751 rewrites
lola: formula mentions 19 of 168 places; total mentions: 19
lola: closed formula file PermAdmissibility-COL-05-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 14 will run for 827 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX ((AG (aux14_7 + aux14_6 + aux14_5 + aux14_4 + aux14_3 + aux14_2 + aux14_1 + aux14_0 + -c11 <= 0) OR ((-out6_7 + -out6_6 + -out6_5 + -out6_4 + -out6_3 + -out6_2 + -out6_1 + -out6_0 + c6 <= 0 OR out5_7 + out5_6 + out5_5 + out5_4 + out5_3 + out5_2 + out5_1 + out5_0 + -out1_7 + -out1_6 + -out1_5 + -out1_4 + -out1_3 + -out1_2 + -out1_1 + -out1_0 <= 0) AND (-aux13_7 + -aux13_6 + -aux13_5 + -aux13_4 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((!(E(TRUE U !(aux14_7 + aux14_6 + aux14_5 + aux14_4 + aux14_3 + aux14_2 + aux14_1 + aux14_0 + -c11 <= 0))) OR ((-out6_7 + -out6_6 + -out6_5 + -out6_4 + -out6_3 + -out6_2 + -out6_1 + -out6_0 + c6 <= 0 OR out5_7 + out5_6 + out5_5 + out5_4 + out5_3 + out5_2 + out5_1 + out5_0 + -out1_7 + -out1_6 + -out1_5 + -out1_4 + -out1_3 + -out1_2 + -out1_1 + -out1_0 <= 0) AND (-aux13_7 + -aux13_6 + -aux13_5 + ... (shortened)
lola: processed formula length: 553
lola: 2751 rewrites
lola: formula mentions 43 of 168 places; total mentions: 51
lola: closed formula file PermAdmissibility-COL-05-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 15 will run for 1655 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((EG (-out8_7 + -out8_0 + -out8_1 + -out8_2 + -out8_3 + -out8_4 + -out8_5 + -out8_6 + c6 <= 0) AND ((-in1_1 + -in1_0 <= -1 OR -aux7_7 + -aux7_6 + -aux7_3 + -aux7_2 + c15 <= 0) AND (-out6_7 + -out6_6 + -out6_5 + -out6_4 + -out6_3 + -out6_2 + -out6_1 + -out6_0 + c13 <= 0 OR -c18 <= -1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (!(A(TRUE U !(-out8_7 + -out8_0 + -out8_1 + -out8_2 + -out8_3 + -out8_4 + -out8_5 + -out8_6 + c6 <= 0))) AND ((-in1_1 + -in1_0 <= -1 OR -aux7_7 + -aux7_6 + -aux7_3 + -aux7_2 + c15 <= 0) AND (-out6_7 + -out6_6 + -out6_5 + -out6_4 + -out6_3 + -out6_2 + -out6_1 + -out6_0 + c13 <= 0 OR -c18 <= -1))))
lola: processed formula length: 306
lola: 2751 rewrites
lola: formula mentions 26 of 168 places; total mentions: 26
lola: closed formula file PermAdmissibility-COL-05-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: RESULT
lola: summary: unknown unknown no yes yes unknown yes no unknown yes yes yes no unknown no yes
lola: ========================================
BK_STOP 1463702625781
--------------------
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-05"
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-05.tgz
mv PermAdmissibility-PT-05 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-05, 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-146363811200318"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;