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

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

=== Now, execution of the tool begins

BK_START 1463731402176

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PolyORBLF-PT-S04J06T10
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityCardinality-0 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityCardinality-1 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityCardinality-5 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityCardinality-7 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityCardinality-11 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityCardinality-13 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T10-ReachabilityCardinality-14 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T10-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: 6320/65536 symbol table entries, 1503 collisions
lola: preprocessing...
lola: finding significant places
lola: 966 places, 5354 transitions, 904 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3657 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J06T10-ReachabilityCardinality.task
lola: read: EF (3 <= DisablePollingB_7_4 + DisablePollingB_8_2 + DisablePollingB_3_4 + DisablePollingB_2_2 + DisablePollingB_9_2 + DisablePollingB_10_4 + DisablePollingB_6_3 + DisablePollingB_6_1 + DisablePollingB_10_2 + DisablePollingB_4_4 + DisablePollingB_7_1 + DisablePollingB_1_2 + DisablePollingB_9_4 + DisablePollingB_4_2 + DisablePollingB_1_3 + DisablePollingB_4_1 + DisablePollingB_5_3 + DisablePollingB... (shortened)
lola: formula length: 20201
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 (-DisablePollingB_10_4 + -DisablePollingB_10_3 + -DisablePollingB_10_2 + -DisablePollingB_10_1 + -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_1_4 + -DisablePollingB_1_3 + -DisablePollingB_1_2 + -DisablePollingB_1_1 + -DisablePollingB_4_1 + -... (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 3616 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-S04J06T10-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-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: AG (((-TryAllocateOneTaskE_10 + -TryAllocateOneTaskE_9 + -TryAllocateOneTaskE_8 + -TryAllocateOneTaskE_7 + -TryAllocateOneTaskE_6 + -TryAllocateOneTaskE_5 + -TryAllocateOneTaskE_4 + -TryAllocateOneTaskE_3 + -TryAllocateOneTaskE_2 + -TryAllocateOneTaskE_1 > -2 AND -DisablePollingE_1_1 + -DisablePollingE_1_2 + -DisablePollingE_1_3 + -DisablePollingE_1_4 + -DisablePollingE_2_1 + -DisablePollingE_2_2 ... (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 3616 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-S04J06T10-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-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 (-P_2318_10 + -P_2318_9 + -P_2318_8 + -P_2318_7 + -P_2318_6 + -P_2318_5 + -P_2318_4 + -P_2318_3 + -P_2318_2 + -P_2318_1 <= -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 3616 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-S04J06T10-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Abort_Check_Sources_B_10 + -Abort_Check_Sources_B_9 + -Abort_Check_Sources_B_8 + -Abort_Check_Sources_B_7 + -Abort_Check_Sources_B_6 + -Abort_Check_Sources_B_5 + -Abort_Check_Sources_B_4 + -Abort_Check_Sources_B_3 + -Abort_Check_Sources_B_2 + -Abort_Check_Sources_B_1 <= -2 OR (-FetchJobE_9_6 + -FetchJobE_9_3 + -FetchJobE_9_2 + -FetchJobE_9_1 + -FetchJobE_9_0 + -FetchJobE_9_4 + -FetchJobE_9_... (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 3616 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-S04J06T10-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((-NotifyEventEndOfCheckSourcesE_9 + -NotifyEventEndOfCheckSourcesE_8 + -NotifyEventEndOfCheckSourcesE_7 + -NotifyEventEndOfCheckSourcesE_6 + -NotifyEventEndOfCheckSourcesE_5 + -NotifyEventEndOfCheckSourcesE_4 + -NotifyEventEndOfCheckSourcesE_3 + -NotifyEventEndOfCheckSourcesE_2 + -NotifyEventEndOfCheckSourcesE_1 + -NotifyEventEndOfCheckSourcesE_10 <= -3 OR -nyo_9 + -nyo_8 + -nyo_7 + -nyo_6 +... (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 3616 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 10 literals
lola: write sara problem file to PolyORBLF-COL-S04J06T10-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-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 3616 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-S04J06T10-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-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 281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P_1617_10 + -P_1617_9 + -P_1617_8 + -P_1617_7 + -P_1617_6 + -P_1617_5 + -P_1617_4 + -P_1617_3 + -P_1617_2 + -P_1617_1 > -1 OR (-RunE_10 + -RunE_9 + -RunE_8 + -RunE_7 + -RunE_6 + -RunE_5 + -RunE_4 + -RunE_3 + -RunE_2 + -RunE_1 + P_1617_10 + P_1617_9 + P_1617_8 + P_1617_7 + P_1617_6 + P_1617_5 + P_1617_4 + P_1617_3 + P_1617_2 + P_1617_1 > 0 OR (-Abort_Check_Sources_B_10 + Try_Check_Sources_B_1... (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 3616 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-S04J06T10-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-AvailableJobId_0 + -AvailableJobId_1 + -AvailableJobId_2 + -AvailableJobId_3 + -AvailableJobId_4 + -AvailableJobId_5 + -AvailableJobId_6 <= -1 OR -P_1717 + DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 <= 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 3616 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-S04J06T10-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-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 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (P_1158_10 + -P_1159_9 + -P_1159_8 + -P_1159_7 + -P_1159_6 + -P_1159_5 + -P_1159_4 + -P_1159_3 + -P_1159_2 + -P_1159_1 + P_1158_9 + P_1158_8 + P_1158_7 + P_1158_6 + P_1158_5 + P_1158_4 + P_1158_3 + P_1158_2 + P_1158_1 + -P_1159_10 <= 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 3616 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-S04J06T10-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (cPollingAbort + -P_2318_10 + -P_2318_9 + -P_2318_8 + -P_2318_7 + -P_2318_6 + -P_2318_5 + -P_2318_4 + -P_2318_3 + -P_2318_2 + -P_2318_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 3616 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-S04J06T10-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-JobCnt <= -2 AND (-P_1724_6 + -P_1724_5 + -P_1724_4 + -P_1724_3 + -P_1724_2 + -P_1724_1 + -P_1724_0 > -1 AND -NotifyEventEndOfCheckSourcesE_9 + -NotifyEventEndOfCheckSourcesE_8 + -NotifyEventEndOfCheckSourcesE_7 + -NotifyEventEndOfCheckSourcesE_6 + -NotifyEventEndOfCheckSourcesE_5 + -NotifyEventEndOfCheckSourcesE_4 + -NotifyEventEndOfCheckSourcesE_3 + -NotifyEventEndOfCheckSourcesE_2 + -Noti... (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 3616 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-S04J06T10-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 500 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-AvailableJobId_0 + -AvailableJobId_1 + -AvailableJobId_2 + -AvailableJobId_3 + -AvailableJobId_4 + -AvailableJobId_5 + -AvailableJobId_6 <= -2 OR -DisablePollingE_1_1 + -DisablePollingE_1_2 + -DisablePollingE_1_3 + -DisablePollingE_1_4 + -DisablePollingE_2_1 + -DisablePollingE_2_2 + -DisablePollingE_2_3 + -DisablePollingE_2_4 + -DisablePollingE_9_4 + -DisablePollingE_9_3 + -DisablePollingE_9... (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 3616 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-S04J06T10-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-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 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-PlaceSources_4 + -PlaceSources_3 + -PlaceSources_2 + -PlaceSources_1 <= -3 AND (-ModifiedSrc_4 + -ModifiedSrc_3 + -ModifiedSrc_2 + -ModifiedSrc_1 <= -3 AND P_1716 + -ScheduleTaskE_Work_9_6 + -ScheduleTaskE_Work_9_5 + -ScheduleTaskE_Work_9_4 + -ScheduleTaskE_Work_9_3 + -ScheduleTaskE_Work_9_2 + -ScheduleTaskE_Work_9_1 + -ScheduleTaskE_Work_9_0 + -ScheduleTaskE_Work_8_6 + -ScheduleTaskE_Work_... (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 3616 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-S04J06T10-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-P_1726 <= -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 3616 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-S04J06T10-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-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 667 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cIdleTasks > -1 AND (-NotifyEventJobQueuedB_1_6 + -NotifyEventJobQueuedB_1_5 + -NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB_1_2 + -NotifyEventJobQueuedB_1_1 + -NotifyEventJobQueuedB_1_0 + -NotifyEventJobQueuedB_9_6 + -NotifyEventJobQueuedB_9_5 + -NotifyEventJobQueuedB_9_4 + -NotifyEventJobQueuedB_9_3 + -NotifyEventJobQueuedB_9_2 + -NotifyEventJobQueuedB_9_... (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 3616 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-S04J06T10-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-ReachabilityCardinality-14.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 15 will run for 668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((NotifyEventJobQueuedB_1_6 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_0 + -BlockedTasks + NotifyEventJobQueuedB_9_6 + NotifyEventJobQueuedB_9_5 + NotifyEventJobQueuedB_9_4 + NotifyEventJobQueuedB_9_3 + NotifyEventJobQueuedB_9_2 + NotifyEventJobQueuedB_9_1 + NotifyEventJobQ... (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 3616 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-S04J06T10-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T10-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: time limit reached - aborting
lola: preliminary result: unknown unknown yes no yes unknown no unknown no yes yes unknown yes unknown unknown
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: unknown unknown yes no yes unknown no unknown no yes yes unknown yes unknown unknown unknown

BK_STOP 1463734943205

--------------------
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-S04J06T10"
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-S04J06T10.tgz
mv PolyORBLF-PT-S04J06T10 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-S04J06T10, 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-146369089000763"
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 ;