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-S06J04T06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369089000781
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463733930198

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PolyORBLF-PT-S06J04T06
FORMULA PolyORBLF-COL-S06J04T06-ReachabilityCardinality-0 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T06-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-ReachabilityCardinality-3 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T06-ReachabilityCardinality-4 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T06-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-ReachabilityCardinality-7 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T06-ReachabilityCardinality-8 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T06-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-ReachabilityCardinality-11 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T06-ReachabilityCardinality-12 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T06-ReachabilityCardinality-13 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J04T06-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J04T06-ReachabilityCardinality-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: 11132/65536 symbol table entries, 6611 collisions
lola: preprocessing...
lola: finding significant places
lola: 632 places, 10500 transitions, 578 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2723 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T06-ReachabilityCardinality.task
lola: read: AG ((((1 <= DisablePollingE_5_5 + DisablePollingE_4_2 + DisablePollingE_1_5 + DisablePollingE_4_1 + DisablePollingE_5_2 + DisablePollingE_2_6 + DisablePollingE_6_3 + DisablePollingE_6_2 + DisablePollingE_2_5 + DisablePollingE_3_1 + DisablePollingE_1_6 + DisablePollingE_6_1 + DisablePollingE_1_3 + DisablePollingE_5_3 + DisablePollingE_4_3 + DisablePollingE_5_4 + DisablePollingE_4_6 + DisablePolling... (shortened)
lola: formula length: 10561
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 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 + -DisablePollingE_2_1 + -DisablePollingE_2_2 + -DisablePollingE_2_3 + -DisablePollingE_2_4 + -DisablePollingE_2_5 + -DisablePollingE_2_6 + -DisablePollingE_6_6 + -DisablePollingE_6_5 + -DisablePollingE_6_4 + -DisablePollingE_6_3 + -DisablePollingE_6_2 + -Di... (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 2312 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 20 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T06-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T06-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 ((-QueueJobB_6_4 + -QueueJobB_6_3 + -QueueJobB_6_2 + -QueueJobB_6_1 + -QueueJobB_6_0 + -QueueJobB_5_4 + -QueueJobB_5_3 + -QueueJobB_5_2 + -QueueJobB_5_1 + -QueueJobB_5_0 + -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 + -QueueJobB_3_0 + -QueueJobB_2_4 + -QueueJobB_2_3 + -QueueJobB_2_2 + -Que... (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 2312 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-S06J04T06-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T06-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P_2321_1 + -P_2321_2 + -P_2321_3 + -P_2321_4 + -P_2321_5 + -P_2321_6 + RunB_6 + RunB_5 + RunB_4 + RunB_3 + RunB_2 + RunB_1 <= 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 2312 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-S06J04T06-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T06-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-QueueJobE_6 + -QueueJobE_5 + -QueueJobE_4 + -QueueJobE_3 + -QueueJobE_2 + -QueueJobE_1 + P_2318_6 + P_2318_5 + P_2318_4 + P_2318_3 + P_2318_2 + P_2318_1 > 0 AND (-CanInjectEvent + P_1119_6_6 + P_1119_6_5 + P_1119_6_4 + P_1119_6_3 + P_1119_6_2 + P_1119_6_1 + P_1119_5_6 + P_1119_5_5 + P_1119_5_4 + P_1119_5_3 + P_1119_5_2 + P_1119_5_1 + P_1119_4_6 + P_1119_4_5 + P_1119_4_4 + P_1119_4_3 + P_1119... (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 2312 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-S06J04T06-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T06-ReachabilityCardinality-3.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 4 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((-cJobCnt <= -3 AND -NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB_1_2 + -NotifyEventJobQueuedB_1_1 + -NotifyEventJobQueuedB_1_0 + -NotifyEventJobQueuedB_6_4 + -NotifyEventJobQueuedB_6_3 + -NotifyEventJobQueuedB_6_2 + -NotifyEventJobQueuedB_6_1 + -NotifyEventJobQueuedB_6_0 + -NotifyEventJobQueuedB_5_4 + -NotifyEventJobQueuedB_5_3 + -NotifyEventJobQueuedB_5_2... (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 2312 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-S06J04T06-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T06-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 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P_2321_1 + -P_2321_2 + -P_2321_3 + -P_2321_4 + -P_2321_5 + -P_2321_6 <= -1 AND -P_1712_4 + -P_1712_3 + -P_1712_2 + -P_1712_1 + -P_1712_0 <= -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 2312 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-S06J04T06-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T06-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-FetchJobE_6_4 + -FetchJobE_6_3 + -FetchJobE_6_2 + -FetchJobE_6_1 + -FetchJobE_6_0 + -FetchJobE_5_4 + -FetchJobE_5_3 + -FetchJobE_5_2 + -FetchJobE_5_1 + -FetchJobE_5_0 + -FetchJobE_4_4 + -FetchJobE_4_3 + -FetchJobE_4_2 + -FetchJobE_4_1 + -FetchJobE_4_0 + -FetchJobE_3_4 + -FetchJobE_3_3 + -FetchJobE_3_2 + -FetchJobE_3_1 + -FetchJobE_3_0 + -FetchJobE_2_4 + -FetchJobE_2_3 + -FetchJobE_2_2 + -Fetc... (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 2312 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-S06J04T06-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T06-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-ScheduleTaskE_Idle_6 + -ScheduleTaskE_Idle_5 + -ScheduleTaskE_Idle_4 + -ScheduleTaskE_Idle_3 + -ScheduleTaskE_Idle_2 + -ScheduleTaskE_Idle_1 <= -2 OR -P_1726 <= -1) AND -CanInjectEvent <= -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 2312 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-S06J04T06-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T06-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 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-AbourtToModifySrc_6 + -AbourtToModifySrc_5 + -AbourtToModifySrc_4 + -AbourtToModifySrc_3 + -AbourtToModifySrc_2 + -AbourtToModifySrc_1 <= -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 2312 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-S06J04T06-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T06-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 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-IdleTasks_1 + -IdleTasks_2 + -IdleTasks_3 + -IdleTasks_4 + -IdleTasks_5 + -IdleTasks_6 > -2 AND (-P_1159_6 + -P_1159_5 + -P_1159_4 + -P_1159_3 + -P_1159_2 + -P_1159_1 > -1 AND (-P_1712_4 + -P_1712_3 + -P_1712_2 + -P_1712_1 + -P_1712_0 <= -1 AND (-PlaceSources_6 + -PlaceSources_5 + -PlaceSources_4 + -PlaceSources_3 + -PlaceSources_2 + -PlaceSources_1 <= -3 AND (P_1093 + -Abort_Check_Sources_E... (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 2312 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-S06J04T06-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T06-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 346 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((nyo_6 + nyo_5 + nyo_4 + nyo_3 + nyo_2 + nyo_1 + -TryAllocateOneTaskE_6 + -TryAllocateOneTaskE_5 + -TryAllocateOneTaskE_4 + -TryAllocateOneTaskE_3 + -TryAllocateOneTaskE_2 + -TryAllocateOneTaskE_1 <= 0 OR -nyo_6 + -nyo_5 + -nyo_4 + -nyo_3 + -nyo_2 + -nyo_1 <= -3))
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 2312 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-S06J04T06-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T06-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Check_Sources_B_6 + -Check_Sources_B_5 + -Check_Sources_B_4 + -Check_Sources_B_3 + -Check_Sources_B_2 + -Check_Sources_B_1 + P_1155_6 + P_1155_5 + P_1155_4 + P_1155_3 + P_1155_2 + P_1155_1 > 0 OR (P_1113_6 + P_1113_1 + P_1113_2 + P_1113_3 + P_1113_4 + P_1113_5 + -NotifyEventSourceAddedB_6 + -NotifyEventSourceAddedB_5 + -NotifyEventSourceAddedB_4 + -NotifyEventSourceAddedB_3 + -NotifyEventSou... (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 2312 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-S06J04T06-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T06-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 416 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 + DataOnSrc_6 + -cIdleTasks > 0 OR (-Insert_Source_E_6 + -Insert_Source_E_5 + -Insert_Source_E_4 + -Insert_Source_E_3 + -Insert_Source_E_2 + -Insert_Source_E_1 > -3 OR -P_1716 > -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 2312 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-S06J04T06-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T06-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 416 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((cBlockedTasks + -P_1159_6 + -P_1159_5 + -P_1159_4 + -P_1159_3 + -P_1159_2 + -P_1159_1 <= 0 OR (-ScheduleTaskB_6 + -ScheduleTaskB_5 + -ScheduleTaskB_4 + -ScheduleTaskB_3 + -ScheduleTaskB_2 + -ScheduleTaskB_1 + P_1099 <= 0 OR P_1727 + -ProcessingEvt_6 + -ProcessingEvt_5 + -ProcessingEvt_4 + -ProcessingEvt_3 + -ProcessingEvt_2 + -ProcessingEvt_1 <= 0)) AND (-TryAllocateOneTaskB_6 + -TryAllocate... (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 2312 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 12 literals
lola: write sara problem file to PolyORBLF-COL-S06J04T06-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T06-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 416 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-NotifyEventEndOfCheckSourcesE_6 + -NotifyEventEndOfCheckSourcesE_5 + -NotifyEventEndOfCheckSourcesE_4 + -NotifyEventEndOfCheckSourcesE_3 + -NotifyEventEndOfCheckSourcesE_2 + -NotifyEventEndOfCheckSourcesE_1 <= -3 AND CanInjectEvent + -P_1113_6 + -P_1113_1 + -P_1113_2 + -P_1113_3 + -P_1113_4 + -P_1113_5 <= 0) OR ((ModifiedSrc_6 + ModifiedSrc_5 + ModifiedSrc_4 + ModifiedSrc_3 + ModifiedSrc_2 ... (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 2312 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-S06J04T06-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T06-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 832 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-SigAbort + IsMonitoring <= 0 AND -EnablePollingB_6 + -EnablePollingB_5 + -EnablePollingB_4 + -EnablePollingB_3 + -EnablePollingB_2 + -EnablePollingB_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 2312 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-S06J04T06-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T06-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: time limit reached - aborting
lola: preliminary result: unknown yes no unknown unknown yes yes unknown unknown yes no unknown unknown unknown yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: caught signal User defined signal 1 - aborting LoLA

BK_STOP 1463737470654

--------------------
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-S06J04T06"
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-S06J04T06.tgz
mv PolyORBLF-PT-S06J04T06 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-S06J04T06, 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-146369089000781"
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 '' ReachabilityCardinality.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 ;