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

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

=== Now, execution of the tool begins

BK_START 1463722736310

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PolyORBLF-PT-S02J06T10
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityCardinality-11 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityCardinality-12 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityCardinality-13 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T10-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T10-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: 2656/65536 symbol table entries, 18 collisions
lola: preprocessing...
lola: finding significant places
lola: 844 places, 1812 transitions, 786 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2543 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J06T10-ReachabilityCardinality.task
lola: read: AG ((3 <= cPollingAbort OR NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_10 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_9 + NotifyEventJobCompletedB_1 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_8 <= DisablePollingB_8_2 + DisablePollingB_2_2 + DisablePollingB_9_2 + DisablePollingB... (shortened)
lola: formula length: 11759
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 ((-cPollingAbort <= -3 OR -DisablePollingB_10_2 + -DisablePollingB_10_1 + -DisablePollingB_2_2 + -DisablePollingB_2_1 + -DisablePollingB_1_2 + -DisablePollingB_1_1 + -DisablePollingB_3_1 + -DisablePollingB_3_2 + -DisablePollingB_4_1 + -DisablePollingB_4_2 + NotifyEventJobCompletedB_9 + NotifyEventJobCompletedB_8 + NotifyEventJobCompletedB_7 + NotifyEventJobCompletedB_6 + NotifyEventJobCompleted... (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 3144 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-S02J06T10-ReachabilityCardinality.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Try_Check_Sources_E_10 + -Try_Check_Sources_E_9 + -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 + cIsMonitoring <= 0 AND -DisablePollingB_10_2 + -DisablePollingB_10_1 + -DisablePollingB_2_2 + -DisablePollingB_2_1 + -DisablePollingB_1_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 3144 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 18 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T10-ReachabilityCardinality.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-QueueJobB_9_6 + -QueueJobB_9_5 + -QueueJobB_9_4 + -QueueJobB_9_3 + -QueueJobB_9_2 + -QueueJobB_9_1 + -QueueJobB_9_0 + -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_10_6 + -QueueJobB_10_5 + -Q... (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 3144 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-S02J06T10-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-ReachabilityCardinality-2.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 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Abort_Check_Sources_E_9 + -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 + -Abort_Check_Sources_E_10 <= -2 AND -BlockedTasks <= -3) OR (-ScheduleTaskE_Idle_10 + -ScheduleTaskE_Idle_9 + -ScheduleTaskE_Idle_8 + -ScheduleTaskE_Id... (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 3144 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 16 literals
lola: write sara problem file to PolyORBLF-COL-S02J06T10-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 294 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 3144 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-S02J06T10-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-ReachabilityCardinality-4.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 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-FetchJobE_9_6 + -FetchJobE_9_0 + -FetchJobE_9_1 + -FetchJobE_9_2 + -FetchJobE_9_3 + -FetchJobE_9_4 + -FetchJobE_9_5 + -FetchJobE_8_6 + -FetchJobE_8_5 + -FetchJobE_8_4 + -FetchJobE_8_3 + -FetchJobE_8_2 + -FetchJobE_8_1 + -FetchJobE_8_0 + -FetchJobE_7_6 + -FetchJobE_7_5 + -FetchJobE_7_4 + -FetchJobE_7_3 + -FetchJobE_7_2 + -FetchJobE_7_1 + -FetchJobE_7_0 + -FetchJobE_6_6 + -FetchJobE_6_5 + -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 3144 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-S02J06T10-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-JobCnt > -1 AND SigAbort + -AbourtToModifySrc_2 + -AbourtToModifySrc_1 > 0) OR NotifyEventJobQueuedE_10 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_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 3144 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-S02J06T10-ReachabilityCardinality-6.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-IsMonitoring + PollingAbort <= 0 OR (-nyo_9 + -nyo_8 + -nyo_7 + -nyo_6 + -nyo_5 + -nyo_4 + -nyo_3 + -nyo_2 + -nyo_1 + -nyo_10 <= -2 OR (-NotifyEventJobCompletedE_9 + -NotifyEventJobCompletedE_8 + -NotifyEventJobCompletedE_7 + -NotifyEventJobCompletedE_6 + -NotifyEventJobCompletedE_5 + -NotifyEventJobCompletedE_4 + -NotifyEventJobCompletedE_3 + -NotifyEventJobCompletedE_2 + -NotifyEventJobCo... (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 3144 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-S02J06T10-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-CanInjectEvent > -2 AND -CanInjectEvent + JobCnt > 0) OR (-SigAbort > -1 AND -P_1113_9 + -P_1113_1 + -P_1113_2 + -P_1113_3 + -P_1113_4 + -P_1113_5 + -P_1113_6 + -P_1113_7 + -P_1113_8 + -P_1113_10 > -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 3144 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-S02J06T10-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((IdleTasks_10 + IdleTasks_1 + IdleTasks_2 + IdleTasks_3 + IdleTasks_4 + IdleTasks_5 + IdleTasks_6 + IdleTasks_7 + IdleTasks_8 + IdleTasks_9 + -Check_Sources_B_9 + -Check_Sources_B_8 + -Check_Sources_B_7 + -Check_Sources_B_6 + -Check_Sources_B_5 + -Check_Sources_B_4 + -Check_Sources_B_3 + -Check_Sources_B_2 + -Check_Sources_B_1 + -Check_Sources_B_10 > 0 OR P_1095 + -P_1724_6 + -P_1724_5 + -P_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 3144 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-S02J06T10-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (Insert_Source_E_9 + 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 + -JobCnt + Insert_Source_E_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 3144 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-S02J06T10-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-Check_Sources_E_10 + -Check_Sources_E_9 + -Check_Sources_E_8 + -Check_Sources_E_7 + -Check_Sources_E_6 + -Check_Sources_E_5 + -Check_Sources_E_4 + -Check_Sources_E_3 + -Check_Sources_E_2 + -Check_Sources_E_1 > -3 AND -P_1726 > -3) OR (ScheduleTaskE_Check_10 + -P_2321_1 + -P_2321_2 + -P_2321_3 + -P_2321_4 + -P_2321_5 + -P_2321_6 + -P_2321_7 + -P_2321_8 + -P_2321_9 + -P_2321_10 + ScheduleTask... (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 3144 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-S02J06T10-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-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 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P_1113_9 + -P_1113_1 + -P_1113_2 + -P_1113_3 + -P_1113_4 + -P_1113_5 + -P_1113_6 + -P_1113_7 + -P_1113_8 + -P_1113_10 > -3 OR (-TryAllocateOneTaskB_10 + PlaceSources_2 + PlaceSources_1 + -TryAllocateOneTaskB_9 + -TryAllocateOneTaskB_8 + -TryAllocateOneTaskB_7 + -TryAllocateOneTaskB_6 + -TryAllocateOneTaskB_5 + -TryAllocateOneTaskB_4 + -TryAllocateOneTaskB_3 + -TryAllocateOneTaskB_2 + -TryAll... (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 3144 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-S02J06T10-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-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 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-PlaceSources_2 + -PlaceSources_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 3144 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-S02J06T10-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-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 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-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_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 + -Sched... (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 3144 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-S02J06T10-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 1408 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-ModifiedSrc_2 + -ModifiedSrc_1 + Perform_Work_E_10 + Perform_Work_E_9 + Perform_Work_E_8 + Perform_Work_E_7 + Perform_Work_E_6 + Perform_Work_E_5 + Perform_Work_E_4 + Perform_Work_E_3 + Perform_Work_E_2 + Perform_Work_E_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 3144 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-S02J06T10-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S02J06T10-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola: summary: no no no no no yes no no no no no unknown unknown unknown yes no

BK_STOP 1463724868384

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