About the Execution of LoLa for PolyORBLF-PT-S06J04T04
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1460.610 | 2901428.00 | 5814993.00 | 495.20 | ??F???FT?F?????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 PolyORBLF-PT-S06J04T04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369089000772
=====================================================================
--------------------
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 PolyORBLF-COL-S06J04T04-ReachabilityCardinality-0
FORMULA_NAME PolyORBLF-COL-S06J04T04-ReachabilityCardinality-1
FORMULA_NAME PolyORBLF-COL-S06J04T04-ReachabilityCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-ReachabilityCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-ReachabilityCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-ReachabilityCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-ReachabilityCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-ReachabilityCardinality-15
FORMULA_NAME PolyORBLF-COL-S06J04T04-ReachabilityCardinality-2
FORMULA_NAME PolyORBLF-COL-S06J04T04-ReachabilityCardinality-3
FORMULA_NAME PolyORBLF-COL-S06J04T04-ReachabilityCardinality-4
FORMULA_NAME PolyORBLF-COL-S06J04T04-ReachabilityCardinality-5
FORMULA_NAME PolyORBLF-COL-S06J04T04-ReachabilityCardinality-6
FORMULA_NAME PolyORBLF-COL-S06J04T04-ReachabilityCardinality-7
FORMULA_NAME PolyORBLF-COL-S06J04T04-ReachabilityCardinality-8
FORMULA_NAME PolyORBLF-COL-S06J04T04-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1463732268315
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PolyORBLF-PT-S06J04T04
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityCardinality-0 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityCardinality-1 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityCardinality-2 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityCardinality-4 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityCardinality-5 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityCardinality-6 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityCardinality-7 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityCardinality-8 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityCardinality-11 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityCardinality-12 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityCardinality-13 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T04-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T04-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: 7448/65536 symbol table entries, 4121 collisions
lola: preprocessing...
lola: finding significant places
lola: 454 places, 6994 transitions, 404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1823 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T04-ReachabilityCardinality.task
lola: read: EF ((((1 <= FetchJobB_1 + FetchJobB_3 + FetchJobB_4 + FetchJobB_2 OR P_1724_0 + P_1724_2 + P_1724_1 + P_1724_4 + P_1724_3 <= AwakeTasks_2 + AwakeTasks_1 + AwakeTasks_4 + AwakeTasks_3) OR (P_2318_4 + P_2318_3 + P_2318_2 + P_2318_1 <= P_1726 OR P_1716 <= NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_3)) AND (Create... (shortened)
lola: formula length: 10228
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 (((-FetchJobB_4 + -FetchJobB_3 + -FetchJobB_2 + -FetchJobB_1 <= -1 OR (P_1724_4 + P_1724_3 + P_1724_2 + P_1724_1 + P_1724_0 + -AwakeTasks_4 + -AwakeTasks_3 + -AwakeTasks_2 + -AwakeTasks_1 <= 0 OR (-P_1726 + P_2318_4 + P_2318_3 + P_2318_2 + P_2318_1 <= 0 OR P_1716 + -NotifyEventEndOfCheckSourcesE_4 + -NotifyEventEndOfCheckSourcesE_3 + -NotifyEventEndOfCheckSourcesE_2 + -NotifyEventEndOfCheckSour... (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 1616 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 PolyORBLF-COL-S06J04T04-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
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: EF ((-P_2321_1 + -P_2321_2 + -P_2321_3 + -P_2321_4 <= -3 OR -DisablePollingE_1_1 + -DisablePollingE_1_2 + -DisablePollingE_1_3 + -DisablePollingE_1_4 + -DisablePollingE_1_5 + -DisablePollingE_1_6 + -DisablePollingE_2_1 + -DisablePollingE_2_2 + -DisablePollingE_2_3 + -DisablePollingE_2_4 + -DisablePollingE_2_5 + -DisablePollingE_2_6 + -DisablePollingE_4_6 + -DisablePollingE_4_5 + -DisablePollingE_4... (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 1616 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 2 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
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: EF (((-cIsMonitoring > -2 OR (DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_1_3 + DisablePollingE_1_4 + DisablePollingE_1_5 + DisablePollingE_1_6 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_2_3 + DisablePollingE_2_4 + DisablePollingE_2_5 + DisablePollingE_2_6 + DisablePollingE_4_6 + DisablePollingE_4_5 + DisablePollingE_4_4 + DisablePollingE_4_3 + DisablePollingE_4_... (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 1616 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 7 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-NotifyEventSourceAddedB_4 + -NotifyEventSourceAddedB_3 + -NotifyEventSourceAddedB_2 + -NotifyEventSourceAddedB_1 <= -3 AND (-DisablePollingB_4_6 + ModifiedSrc_6 + -DisablePollingB_2_6 + -DisablePollingB_2_5 + -DisablePollingB_2_4 + -DisablePollingB_2_3 + -DisablePollingB_2_2 + -DisablePollingB_2_1 + -DisablePollingB_3_1 + -DisablePollingB_3_2 + -DisablePollingB_3_3 + -DisablePollingB_3_4 + -... (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 1616 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 PolyORBLF-COL-S06J04T04-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P_1617_4 + -P_1617_3 + -P_1617_2 + -P_1617_1 <= -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 1616 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 PolyORBLF-COL-S06J04T04-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P_2321_1 + -P_2321_2 + -P_2321_3 + -P_2321_4 <= -2 AND (-P_1716 > -3 AND -cBlockedTasks + CanInjectEvent > 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 1616 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 PolyORBLF-COL-S06J04T04-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((P_1095 + -Try_Check_Sources_B_4 + -Try_Check_Sources_B_3 + -Try_Check_Sources_B_2 + -Try_Check_Sources_B_1 <= 0 OR (-P_1716 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_1 <= 0 OR (-EnablePollingB_4 + -EnablePollingB_3 + -EnablePollingB_2 + -EnablePollingB_1 <= -3 OR -nyo_4 + -nyo_3 + -nyo_2 + -nyo_1 + NotifyEventSourceAddedB_4 + NotifyEventSour... (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 1616 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 4 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P_1726 + P_1095 > 0 OR (-Insert_Source_B_4_6 + -Insert_Source_B_4_5 + -Insert_Source_B_4_4 + -Insert_Source_B_4_3 + -Insert_Source_B_4_2 + -Insert_Source_B_4_1 + -Insert_Source_B_3_6 + -Insert_Source_B_3_5 + -Insert_Source_B_3_4 + -Insert_Source_B_3_3 + -Insert_Source_B_3_2 + -Insert_Source_B_3_1 + -Insert_Source_B_2_6 + -Insert_Source_B_2_5 + -Insert_Source_B_2_4 + -Insert_Source_B_2_3 + -I... (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 1616 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: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Check_Sources_B_4 + -Check_Sources_B_3 + -Check_Sources_B_2 + -Check_Sources_B_1 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_1 <= 0 OR (SigAbort + -P_1716 > 0 OR -P_1095 > -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 1616 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 PolyORBLF-COL-S06J04T04-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (BlockedTasks + -Try_Check_Sources_B_4 + -Try_Check_Sources_B_3 + -Try_Check_Sources_B_2 + -Try_Check_Sources_B_1 <= 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 1616 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 PolyORBLF-COL-S06J04T04-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 266 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-DisablePollingE_1_1 + -DisablePollingE_1_2 + -DisablePollingE_1_3 + -DisablePollingE_1_4 + -DisablePollingE_1_5 + -DisablePollingE_1_6 + P_1716 + -DisablePollingE_2_1 + -DisablePollingE_2_2 + -DisablePollingE_2_3 + -DisablePollingE_2_4 + -DisablePollingE_2_5 + -DisablePollingE_2_6 + -DisablePollingE_4_6 + -DisablePollingE_4_5 + -DisablePollingE_4_4 + -DisablePollingE_4_3 + -DisablePollingE_4_... (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 1616 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 PolyORBLF-COL-S06J04T04-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-ScheduleTaskB_4 + -ScheduleTaskB_3 + -ScheduleTaskB_2 + -ScheduleTaskB_1 + EnablePollingB_4 + EnablePollingB_3 + EnablePollingB_2 + EnablePollingB_1 <= 0 AND Check_Sources_B_4 + Check_Sources_B_3 + Check_Sources_B_2 + Check_Sources_B_1 + -QueueJobB_4_4 + -QueueJobB_4_3 + -QueueJobB_4_2 + -QueueJobB_4_1 + -QueueJobB_4_0 + -QueueJobB_3_4 + -QueueJobB_3_3 + -QueueJobB_3_2 + -QueueJobB_3_1 + -Q... (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 1616 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 6 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-PollingAbort + P_1119_4_6 + P_1119_4_5 + P_1119_4_4 + P_1119_4_3 + P_1119_4_2 + P_1119_4_1 + P_1119_3_6 + P_1119_3_5 + P_1119_3_4 + P_1119_3_3 + P_1119_3_2 + P_1119_3_1 + P_1119_2_6 + P_1119_2_5 + P_1119_2_4 + P_1119_2_3 + P_1119_2_2 + P_1119_2_1 + P_1119_1_6 + P_1119_1_5 + P_1119_1_4 + P_1119_1_3 + P_1119_1_2 + P_1119_1_1 <= 0 AND (DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePolling... (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 1616 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 7 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-CanInjectEvent > -3 OR -NotifyEventJobCompletedE_4 + -NotifyEventJobCompletedE_3 + -NotifyEventJobCompletedE_2 + -NotifyEventJobCompletedE_1 <= -1))
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 1616 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 2 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 319 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((P_1717 + -ORB_Lock > 0 AND -AwakeTasks_4 + -AwakeTasks_3 + -AwakeTasks_2 + -AwakeTasks_1 > -2) OR Perform_Work_E_4 + Perform_Work_E_3 + Perform_Work_E_2 + Perform_Work_E_1 + -P_1725_4 + -P_1725_3 + -P_1725_2 + -P_1725_1 + -P_1725_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 1616 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 4 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 639 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-DisablePollingB_4_6 + -DisablePollingB_2_6 + -DisablePollingB_2_5 + -DisablePollingB_2_4 + -DisablePollingB_2_3 + -DisablePollingB_2_2 + -DisablePollingB_2_1 + -DisablePollingB_3_1 + -DisablePollingB_3_2 + -DisablePollingB_3_3 + -DisablePollingB_3_4 + -DisablePollingB_3_5 + -DisablePollingB_3_6 + -DisablePollingB_1_6 + -DisablePollingB_1_5 + -DisablePollingB_1_4 + -DisablePollingB_1_3 + -Dis... (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 1616 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 2 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T04-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: RESULT
lola: summary: unknown unknown unknown no unknown unknown unknown unknown unknown yes no unknown unknown unknown no yes
lola: ========================================
BK_STOP 1463735169743
--------------------
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="PolyORBLF-PT-S06J04T04"
export BK_EXAMINATION="ReachabilityCardinality"
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/PolyORBLF-PT-S06J04T04.tgz
mv PolyORBLF-PT-S06J04T04 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 PolyORBLF-PT-S06J04T04, 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 r086kn-ebro-146369089000772"
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 ;