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

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

=== Now, execution of the tool begins

BK_START 1463729386371

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PolyORBLF-PT-S04J06T08
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-3 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-4 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-6 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-9 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-13 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityCardinality-15 FALSE 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: 5060/65536 symbol table entries, 1254 collisions
lola: preprocessing...
lola: finding significant places
lola: 792 places, 4268 transitions, 734 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2899 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J06T08-ReachabilityCardinality.task
lola: read: EF (2 <= EnablePollingB_4 + EnablePollingB_3 + EnablePollingB_5 + EnablePollingB_6 + EnablePollingB_7 + EnablePollingB_8 + EnablePollingB_2 + EnablePollingB_1) : AG (RunB_1 + RunB_2 + RunB_3 + RunB_8 + RunB_4 + RunB_7 + RunB_5 + RunB_6 <= NoSigAbort) : AG (((!(3 <= cSources) OR !(ORB_Lock <= cJobCnt)) OR ((ScheduleTaskE_Work_8_0 + ScheduleTaskE_Work_3_4 + ScheduleTaskE_Work_7_0 + ScheduleTaskE_Wor... (shortened)
lola: formula length: 11001
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 (-EnablePollingB_8 + -EnablePollingB_7 + -EnablePollingB_6 + -EnablePollingB_5 + -EnablePollingB_4 + -EnablePollingB_3 + -EnablePollingB_2 + -EnablePollingB_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 2936 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-S04J06T08-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-ReachabilityCardinality.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 1 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (RunB_8 + RunB_7 + RunB_6 + RunB_5 + RunB_4 + RunB_3 + RunB_2 + RunB_1 + -NoSigAbort <= 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 2936 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-S04J06T08-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-cSources > -3 OR (-cJobCnt + ORB_Lock > 0 OR ((ScheduleTaskE_Work_8_6 + ScheduleTaskE_Work_8_5 + ScheduleTaskE_Work_8_4 + ScheduleTaskE_Work_8_3 + ScheduleTaskE_Work_8_2 + ScheduleTaskE_Work_8_1 + ScheduleTaskE_Work_8_0 + ScheduleTaskE_Work_7_6 + ScheduleTaskE_Work_7_5 + ScheduleTaskE_Work_7_4 + ScheduleTaskE_Work_7_3 + ScheduleTaskE_Work_7_2 + ScheduleTaskE_Work_7_1 + ScheduleTaskE_Work_7_0... (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 2936 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-S04J06T08-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cIdleTasks > -2 AND -ScheduleTaskB_8 + -ScheduleTaskB_7 + -ScheduleTaskB_6 + -ScheduleTaskB_5 + -ScheduleTaskB_4 + -ScheduleTaskB_3 + -ScheduleTaskB_2 + -ScheduleTaskB_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 2936 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-S04J06T08-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-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 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-AwakeTasks_8 + -AwakeTasks_7 + -AwakeTasks_6 + -AwakeTasks_5 + -AwakeTasks_4 + -AwakeTasks_3 + -AwakeTasks_2 + -AwakeTasks_1 <= -3 AND (-RunB_8 + -RunB_7 + -RunB_6 + -RunB_5 + -RunB_4 + -RunB_3 + -RunB_2 + -RunB_1 <= -3 AND -ModifiedSrc_4 + -ModifiedSrc_3 + -ModifiedSrc_2 + -ModifiedSrc_1 > -3)) OR (-NotifyEventJobCompletedB_8 + -NotifyEventJobCompletedB_7 + -NotifyEventJobCompletedB_6 + -N... (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 2936 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-S04J06T08-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-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 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Insert_Source_B_7_1 + -Insert_Source_B_7_2 + -Insert_Source_B_7_3 + -Insert_Source_B_7_4 + -Insert_Source_B_6_4 + -Insert_Source_B_6_3 + -Insert_Source_B_6_2 + -Insert_Source_B_6_1 + -Insert_Source_B_8_1 + -Insert_Source_B_8_2 + -Insert_Source_B_8_3 + -Insert_Source_B_5_4 + -Insert_Source_B_5_3 + -Insert_Source_B_5_2 + -Insert_Source_B_5_1 + -Insert_Source_B_8_4 + -Insert_Source_B_4_4 + -Ins... (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 2936 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-S04J06T08-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Abort_Check_Sources_E_8 + -Abort_Check_Sources_E_7 + -Abort_Check_Sources_E_6 + -Abort_Check_Sources_E_5 + -Abort_Check_Sources_E_4 + -Abort_Check_Sources_E_3 + -Abort_Check_Sources_E_2 + -Abort_Check_Sources_E_1 <= -3 AND (-Abort_Check_Sources_E_8 + -Abort_Check_Sources_E_7 + -Abort_Check_Sources_E_6 + -Abort_Check_Sources_E_5 + -Abort_Check_Sources_E_4 + -Abort_Check_Sources_E_3 + -Abort_... (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 2936 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-S04J06T08-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-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 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (PollingAbort + -JobCnt <= 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 2936 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-S04J06T08-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-RunE_8 + -RunE_7 + -RunE_6 + -RunE_5 + -RunE_4 + -RunE_3 + -RunE_2 + -RunE_1 > -2 OR -RunB_8 + -RunB_7 + -RunB_6 + -RunB_5 + -RunB_4 + -RunB_3 + -RunB_2 + -RunB_1 > -3) AND -AwakeTasks_8 + -AwakeTasks_7 + -AwakeTasks_6 + -AwakeTasks_5 + -AwakeTasks_4 + -AwakeTasks_3 + -AwakeTasks_2 + -AwakeTasks_1 > -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 2936 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-S04J06T08-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 380 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 + -NotifyEventJobQueuedB_8_6 + -NotifyEventJobQueuedB_8_5 + -NotifyEventJobQueuedB_8_4 + -NotifyEventJobQueuedB_8_3 + -NotifyEventJobQueuedB_8_2 + -NotifyEventJobQueuedB_8_1 + -NotifyEventJobQue... (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 2936 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-S04J06T08-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-ReachabilityCardinality-9.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 10 will run for 380 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-MarkerWrite + cIsMonitoring <= 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 2936 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-S04J06T08-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 457 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-P_1159_8 + -P_1159_7 + -P_1159_6 + -P_1159_5 + -P_1159_4 + -P_1159_3 + -P_1159_2 + -P_1159_1 + NotifyEventJobCompletedB_8 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_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 2936 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-S04J06T08-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 571 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-NotifyEventJobQueuedE_8 + -NotifyEventJobQueuedE_7 + -NotifyEventJobQueuedE_6 + -NotifyEventJobQueuedE_5 + -NotifyEventJobQueuedE_4 + -NotifyEventJobQueuedE_3 + -NotifyEventJobQueuedE_2 + -NotifyEventJobQueuedE_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 2936 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-S04J06T08-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 761 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 AND -P_1725_6 + -P_1725_5 + -P_1725_4 + -P_1725_3 + -P_1725_2 + -P_1725_1 + -P_1725_0 <= -2) OR (CanInjectEvent + -P_1726 > 0 OR (-NotifyEventSourceAddedE_8 + -NotifyEventSourceAddedE_7 + -NotifyEventSourceAddedE_6 + -NotifyEventSourceAddedE_5 + -Not... (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 2936 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-S04J06T08-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-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 762 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-BlockedTasks + EnablePollingE_8 + EnablePollingE_7 + EnablePollingE_6 + EnablePollingE_5 + EnablePollingE_4 + EnablePollingE_3 + EnablePollingE_2 + EnablePollingE_1 <= 0 OR -Abort_Check_Sources_E_8 + -Abort_Check_Sources_E_7 + -Abort_Check_Sources_E_6 + -Abort_Check_Sources_E_5 + -Abort_Check_Sources_E_4 + -Abort_Check_Sources_E_3 + -Abort_Check_Sources_E_2 + -Abort_Check_Sources_E_1 <= -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 2936 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-S04J06T08-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 1524 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Idle_8 + -Idle_7 + -Idle_6 + -Idle_5 + -Idle_4 + -Idle_3 + -Idle_2 + -Idle_1 > -2 AND (P_2321_1 + P_2321_2 + P_2321_3 + P_2321_4 + P_2321_5 + P_2321_6 + P_2321_7 + P_2321_8 + -NotifyEventSourceAddedE_8 + -NotifyEventSourceAddedE_7 + -NotifyEventSourceAddedE_6 + -NotifyEventSourceAddedE_5 + -NotifyEventSourceAddedE_4 + -NotifyEventSourceAddedE_3 + -NotifyEventSourceAddedE_2 + -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 2936 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-S04J06T08-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola: summary: no no no unknown unknown no unknown no no unknown no no yes unknown no no

BK_STOP 1463731403555

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