About the Execution of LoLa for PermAdmissibility-PT-10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
112.070 | 517.00 | 40.00 | 0.00 | TTFTTFTTTFTTTFTT | 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-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074kn-smll-146363811200331
=====================================================================
--------------------
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-10-ReachabilityCardinality-0
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-1
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-10
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-11
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-12
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-13
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-14
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-15
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-2
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-3
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-4
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-5
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-6
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-7
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-8
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1463709765591
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PermAdmissibility-PT-10
FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-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-10-ReachabilityCardinality.task
lola: read: EF (!(c12 <= in1_1 + in1_0)) : EF ((1 <= aux7_7 + aux7_6 + aux7_3 + aux7_2 AND (!(aux13_2 + aux13_1 + aux13_0 + aux13_7 + aux13_3 + aux13_4 + aux13_5 + aux13_6 <= out7_1 + out7_0 + out7_3 + out7_2 + out7_5 + out7_4 + out7_7 + out7_6) OR (in1_1 + in1_0 <= c17 AND 3 <= aux16_0 + aux16_1 + aux16_2 + aux16_3 + aux16_4 + aux16_5 + aux16_6 + aux16_7)))) : EF (!(!(!(c13 <= c18)))) : AG (((3 <= in1_1 + in... (shortened)
lola: formula length: 2864
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-in1_1 + -in1_0 + c12 > 0)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 1 literals
lola: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality.sara
lola: SUBRESULTlola:
lola: calling and running sara
result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-aux7_7 + -aux7_6 + -aux7_3 + -aux7_2 <= -1 AND (aux13_7 + -out7_7 + -out7_6 + -out7_5 + -out7_4 + -out7_3 + -out7_2 + -out7_1 + -out7_0 + aux13_6 + aux13_5 + aux13_4 + aux13_3 + aux13_2 + aux13_1 + aux13_0 > 0 OR (in1_1 + in1_0 + -c17 <= 0 AND -aux16_7 + -aux16_5 + -aux16_3 + -aux16_1 + -aux16_0 + -aux16_2 + -aux16_4 + -aux16_6 <= -3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 5 literals
lola: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-c18 + c13 > 0)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 1 literals
lola: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: yes
lola: sara: calling and running sara
try reading problem file PermAdmissibility-COL-10-ReachabilityCardinality.sara.
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-in1_1 + -in1_0 <= -3 OR (in2_3 + in2_2 + -c9 <= 0 OR (-c12 > -2 AND (-aux10_7 + -aux10_6 + -aux10_5 + -aux10_4 + -aux10_3 + -aux10_2 + -aux10_1 + -aux10_0 <= -2 OR -c110 <= -2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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)
sara: try reading problem file PermAdmissibility-COL-10-ReachabilityCardinality-2.sara.
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 7 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-out3_7 + out7_7 + out7_6 + out7_5 + out7_4 + out7_3 + out7_2 + out7_1 + out7_0 + -out3_6 + -out3_5 + -out3_4 + -out3_3 + -out3_2 + -out3_1 + -out3_0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 1 literals
lola: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PermAdmissibility-COL-10-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((out5_7 + out5_6 + out5_5 + out5_4 + out5_3 + out5_2 + out5_1 + out5_0 + -c6 <= 0 OR -c16 <= -2) AND (c6 + -c12 <= 0 AND (-aux15_7 + -aux15_6 + -aux15_5 + -aux15_4 + -aux15_3 + -aux15_2 + -aux15_1 + -aux15_0 <= -2 AND (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 OR -i... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 16 literals
lola: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: calling and running sara
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-c8 + c19 > 0 AND (-out4_7 + -out4_6 + -out4_5 + -out4_4 + -out4_3 + -out4_2 + -out4_1 + -out4_0 > -2 AND (-aux13_7 + -aux13_6 + -aux13_5 + -aux13_4 + -aux13_3 + -aux13_2 + -aux13_1 + -aux13_0 <= -2 OR (-out7_7 + -out7_6 + -out7_5 + -out7_4 + -out7_3 + -out7_2 + -out7_1 + -out7_0 + c11 <= 0 OR -aux9_7 + -aux9_5 + aux8_7 + aux8_6 + aux8_3 + aux8_2 + -aux9_0 + -aux9_1 + -aux9_2 + -aux9_3 + -aux... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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
sara: try reading problem file PermAdmissibility-COL-10-ReachabilityCardinality-5.sara.
lola: Transformation into DNF: expect 9 literals
lola: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((in1_1 + in1_0 + -c20 > 0 AND out8_7 + out8_0 + out8_1 + out8_2 + out8_3 + out8_4 + out8_5 + out8_6 + -c17 > 0) OR -c8 > -2))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-out6_7 + -out6_6 + -out6_5 + -out6_4 + -out6_3 + -out6_2 + -out6_1 + -out6_0 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 1 literals
lola: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-8.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-in4_7 + -in4_6 + out3_7 + out3_6 + out3_5 + out3_4 + out3_3 + out3_2 + out3_1 + out3_0 > 0 AND -c19 > -2) OR -c19 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 3 literals
lola: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-9.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-aux16_7 + -aux16_5 + -aux16_3 + -aux16_1 + -aux16_0 + -aux16_2 + -aux16_4 + -aux16_6 <= -1 OR (aux14_7 + aux14_6 + aux14_5 + aux14_4 + aux14_3 + aux14_2 + aux14_1 + aux14_0 + -c17 <= 0 OR (out4_7 + -aux14_7 + -aux14_6 + -aux14_5 + -aux14_4 + -aux14_3 + -aux14_2 + -aux14_1 + -aux14_0 + out4_6 + out4_5 + out4_4 + out4_3 + out4_2 + out4_1 + out4_0 > 0 OR (-c17 <= -2 AND -aux16_7 + -aux16_5 + -a... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 8 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-c15 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-aux8_7 + -aux8_6 + -aux8_3 + -aux8_2 + c20 > 0 AND (-aux7_7 + -aux7_6 + -aux7_3 + -aux7_2 > -2 AND -c12 > -3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 3 literals
lola: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-in4_7 + -in4_6 + aux15_7 + aux15_6 + aux15_5 + aux15_4 + aux15_3 + aux15_2 + aux15_1 + aux15_0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||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 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((-in3_5 + -in3_4 <= -2 AND -out3_7 + -out3_6 + -out3_5 + -out3_4 + -out3_3 + -out3_2 + -out3_1 + -out3_0 <= -1) OR -in1_1 + -in1_0 > -3) AND -out5_7 + -out5_6 + -out5_5 + -out5_4 + -out5_3 + -out5_2 + -out5_1 + -out5_0 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 5 literals
lola: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (out4_7 + -aux5_5 + -aux5_4 + -aux5_1 + -aux5_0 + out4_6 + out4_5 + out4_4 + out4_3 + out4_2 + out4_1 + out4_0 > 0)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||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: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: yes yes yes no yes yes yes no yes yes no yes yes no yes yes
sara: place or transition ordering is non-deterministic
BK_STOP 1463709766108
--------------------
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-10"
export BK_EXAMINATION="ReachabilityCardinality"
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-10.tgz
mv PermAdmissibility-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 PermAdmissibility-PT-10, examination is ReachabilityCardinality"
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-146363811200331"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 ;