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

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

=== Now, execution of the tool begins

BK_START 1463738832157

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PolyORBLF-PT-S06J06T08
FORMULA PolyORBLF-COL-S06J06T08-ReachabilityCardinality-0 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T08-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T08-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T08-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T08-ReachabilityCardinality-4 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T08-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T08-ReachabilityCardinality-6 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T08-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T08-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T08-ReachabilityCardinality-9 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T08-ReachabilityCardinality-10 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T08-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T08-ReachabilityCardinality-12 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T08-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T08-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T08-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: 15228/65536 symbol table entries, 9133 collisions
lola: preprocessing...
lola: finding significant places
lola: 894 places, 14334 transitions, 832 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4215 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J06T08-ReachabilityCardinality.task
lola: read: EF (2 <= ScheduleTaskE_Idle_6 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_8) : EF ((3 <= QueueJobB_5_2 + QueueJobB_2_0 + QueueJobB_4_1 + QueueJobB_7_3 + QueueJobB_8_4 + QueueJobB_6_3 + QueueJobB_3_0 + QueueJobB_1_6 + QueueJobB_1_5 + QueueJobB_2_4 + QueueJobB_3_3 + QueueJobB_8_5 + Queu... (shortened)
lola: formula length: 13372
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 (-ScheduleTaskE_Idle_8 + -ScheduleTaskE_Idle_7 + -ScheduleTaskE_Idle_6 + -ScheduleTaskE_Idle_5 + -ScheduleTaskE_Idle_4 + -ScheduleTaskE_Idle_3 + -ScheduleTaskE_Idle_2 + -ScheduleTaskE_Idle_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 3328 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-S06J06T08-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-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_8_6 + -QueueJobB_8_5 + -QueueJobB_8_4 + -QueueJobB_8_3 + -QueueJobB_8_2 + -QueueJobB_8_1 + -QueueJobB_8_0 + -QueueJobB_7_6 + -QueueJobB_7_5 + -QueueJobB_7_4 + -QueueJobB_7_3 + -QueueJobB_7_2 + -QueueJobB_7_1 + -QueueJobB_7_0 + -QueueJobB_6_6 + -QueueJobB_6_5 + -QueueJobB_6_4 + -QueueJobB_6_3 + -QueueJobB_6_2 + -QueueJobB_6_1 + -QueueJobB_6_0 + -QueueJobB_5_6 + -QueueJobB_5_5 + -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 3328 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-S06J06T08-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-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_2579_3_6 + -P_2579_3_5 + -P_2579_3_4 + -P_2579_3_3 + -P_2579_3_2 + -P_2579_3_1 + -P_2579_1_6 + -P_2579_1_5 + -P_2579_1_4 + -P_2579_1_3 + -P_2579_1_2 + -P_2579_1_1 + -P_2579_2_1 + -P_2579_2_2 + -P_2579_2_3 + -P_2579_2_4 + -P_2579_2_5 + -P_2579_2_6 + -P_2579_8_6 + -P_2579_8_5 + -P_2579_8_4 + -P_2579_8_3 + -P_2579_8_2 + -P_2579_8_1 + -P_2579_7_6 + -P_2579_7_5 + -P_2579_7_4 + -P_2579_7_3 + -P_... (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 3328 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-S06J06T08-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-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 ((-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 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 + -NotifyEventJobCompletedB_8 + -NotifyEventJobCompletedB_7 + -NotifyEventJobCompletedB_6 + -NotifyEventJobCompletedB_5 + -NotifyEventJobCompletedB_4 + -NotifyEventJobCompletedB_3 + -NotifyEventJobComplete... (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 3328 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-S06J06T08-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 276 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 OR -NotifyEventEndOfCheckSourcesB_8 + -NotifyEventEndOfCheckSourcesB_7 + -NotifyEventEndOfCheckSourcesB_6 + -NotifyEventEndOfCheckSourcesB_5 + -NotifyEventEndOfCheckSourcesB_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 3328 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-S06J06T08-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-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 276 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-NotifyEventJobCompletedE_8 + -NotifyEventJobCompletedE_7 + -NotifyEventJobCompletedE_6 + -NotifyEventJobCompletedE_5 + -NotifyEventJobCompletedE_4 + -NotifyEventJobCompletedE_3 + -NotifyEventJobCompletedE_2 + -NotifyEventJobCompletedE_1 <= -2 OR (P_1717 + -EnablePollingE_8 + -EnablePollingE_7 + -EnablePollingE_6 + -EnablePollingE_5 + -EnablePollingE_4 + -EnablePollingE_3 + -EnablePollingE_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 3328 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-S06J06T08-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 304 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cIdleTasks > -2 AND ((-Try_Check_Sources_B_8 + -Try_Check_Sources_B_7 + -Try_Check_Sources_B_6 + -Try_Check_Sources_B_5 + -Try_Check_Sources_B_4 + -Try_Check_Sources_B_3 + -Try_Check_Sources_B_2 + -Try_Check_Sources_B_1 <= -1 OR -P_2579_3_6 + -P_2579_3_5 + -P_2579_3_4 + -P_2579_3_3 + -P_2579_3_2 + -P_2579_3_1 + -P_2579_1_6 + -P_2579_1_5 + -P_2579_1_4 + -P_2579_1_3 + -P_2579_1_2 + -P_2579_1_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 3328 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-S06J06T08-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-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 304 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_8_6 + DisablePollingE_8_5 + DisablePollingE_8_4 + DisablePollingE_8_3 + DisablePollingE_8_2 + DisablePollingE_8_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 3328 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-S06J06T08-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-CanInjectEvent + P_1155_8 + P_1155_7 + P_1155_6 + P_1155_5 + P_1155_4 + P_1155_3 + P_1155_2 + P_1155_1 > 0 AND -cIsMonitoring > -1) 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 + -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 3328 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-S06J06T08-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-P_1097 <= -1 AND -P_1712_6 + -P_1712_5 + -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 3328 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-S06J06T08-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-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 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-cIsMonitoring > -3 AND -P_1093 > -2) OR ((-P_1095 <= -1 AND P_1712_6 + P_1712_5 + P_1712_4 + P_1712_3 + P_1712_2 + P_1712_1 + P_1712_0 + -NoSigAbort <= 0) OR -IsMonitoring + cIdleTasks > 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 3328 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-S06J06T08-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-ReachabilityCardinality-10.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 11 will run for 391 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 + -cIdleTasks <= 0 AND -NotifyEventJobCompletedE_8 + -NotifyEventJobCompletedE_7 + -NotifyEventJobCompletedE_6 + -NotifyEventJobCompletedE_5 + -NotifyEventJobCompletedE_4 + -NotifyEventJobCompletedE_3 + -NotifyEventJobCompletedE_2 + -NotifyEventJobCompletedE_1 + Try_Check_Sources_E_8 + Try_Check_Sources_E_7 + Try_Check_Sour... (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 3328 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-S06J06T08-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-SigAbort <= -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 3328 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-S06J06T08-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-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 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-AbourtToModifySrc_6 + Insert_Source_B_7_6 + Insert_Source_B_7_5 + Insert_Source_B_7_4 + Insert_Source_B_7_3 + Insert_Source_B_7_2 + Insert_Source_B_7_1 + Insert_Source_B_6_6 + Insert_Source_B_6_5 + 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_8_4 + Insert_Source_B_8_5 ... (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 3328 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-S06J06T08-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 733 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Try_Check_Sources_E_8 + -Try_Check_Sources_E_7 + -Try_Check_Sources_E_6 + -Try_Check_Sources_E_5 + -Try_Check_Sources_E_4 + -Try_Check_Sources_E_3 + -Try_Check_Sources_E_2 + -Try_Check_Sources_E_1 <= -3 OR -P_1617_8 + -P_1617_7 + -P_1617_6 + -P_1617_5 + -P_1617_4 + -P_1617_3 + -P_1617_2 + -P_1617_1 + MarkerRead <= 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 3328 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-S06J06T08-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 1467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((P_1717 + -cIsMonitoring <= 0 AND DataOnSrc_1 + DataOnSrc_2 + DataOnSrc_3 + DataOnSrc_4 + DataOnSrc_5 + DataOnSrc_6 + -Insert_Source_E_8 + -Insert_Source_E_7 + -Insert_Source_E_6 + -Insert_Source_E_5 + -Insert_Source_E_4 + -Insert_Source_E_3 + -Insert_Source_E_2 + -Insert_Source_E_1 <= 0) OR (-P_1099 <= -2 OR (ScheduleTaskE_Idle_8 + ScheduleTaskE_Idle_7 + ScheduleTaskE_Idle_6 + ScheduleTaskE_... (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 3328 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-S06J06T08-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T08-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: time limit reached - aborting
lola: preliminary result: unknown yes no yes unknown no unknown no yes unknown unknown no unknown no yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: caught signal User defined signal 1 - aborting LoLA

BK_STOP 1463742372485

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