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

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

=== Now, execution of the tool begins

BK_START 1463738007823

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PolyORBLF-PT-S06J06T06
FORMULA PolyORBLF-COL-S06J06T06-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-ReachabilityCardinality-2 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T06-ReachabilityCardinality-3 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T06-ReachabilityCardinality-4 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T06-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-ReachabilityCardinality-6 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T06-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S06J06T06-ReachabilityCardinality-9 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T06-ReachabilityCardinality-10 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T06-ReachabilityCardinality-11 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T06-ReachabilityCardinality-12 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T06-ReachabilityCardinality-13 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T06-ReachabilityCardinality-14 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S06J06T06-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: 11440/65536 symbol table entries, 6628 collisions
lola: preprocessing...
lola: finding significant places
lola: 700 places, 10740 transitions, 642 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3155 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J06T06-ReachabilityCardinality.task
lola: read: AG (!(((P_1717 <= cBlockedTasks AND 1 <= NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_1) AND (ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_3_1 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_3_4 + ScheduleTask... (shortened)
lola: formula length: 17242
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 ((-cBlockedTasks + P_1717 > 0 OR (-NotifyEventSourceAddedE_6 + -NotifyEventSourceAddedE_5 + -NotifyEventSourceAddedE_4 + -NotifyEventSourceAddedE_3 + -NotifyEventSourceAddedE_2 + -NotifyEventSourceAddedE_1 > -1 OR (ScheduleTaskE_Work_6_6 + ScheduleTaskE_Work_6_5 + ScheduleTaskE_Work_6_4 + ScheduleTaskE_Work_6_3 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_6_1 + ScheduleTaskE_Work_6_0 + -P_1097... (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 2568 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-S06J06T06-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T06-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-RunE_6 + -RunE_5 + -RunE_4 + -RunE_3 + -RunE_2 + -RunE_1 <= -1 AND (-P_1158_6 + -P_1158_5 + -P_1158_4 + -P_1158_3 + -P_1158_2 + -P_1158_1 <= -1 AND (-P_1159_6 + -P_1159_5 + -P_1159_4 + -P_1159_3 + -P_1159_2 + -P_1159_1 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_1 <= 0 AND (-cJobCnt ... (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 2568 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-S06J06T06-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T06-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-P_1160_6 + -P_1160_2 + -P_1160_1 + -P_1160_3 + -P_1160_4 + -P_1160_5 <= -1 OR (-MarkerRead <= -1 OR (-ModifiedSrc_6 + -ModifiedSrc_5 + -ModifiedSrc_4 + -ModifiedSrc_3 + -ModifiedSrc_2 + -ModifiedSrc_1 <= -3 AND -SigAbort <= -3))) AND (-EnablePollingB_6 + -EnablePollingB_5 + -EnablePollingB_4 + -EnablePollingB_3 + -EnablePollingB_2 + -EnablePollingB_1 <= -3 AND (-P_1119_6_6 + -P_1119_6_5 + -... (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 2568 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 13 literals
lola: write sara problem file to PolyORBLF-COL-S06J06T06-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T06-ReachabilityCardinality-2.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 3 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-P_1160_6 + -P_1160_2 + -P_1160_1 + -P_1160_3 + -P_1160_4 + -P_1160_5 <= -3 OR (-SigAbort <= -2 OR P_2321_1 + P_2321_2 + P_2321_3 + P_2321_4 + P_2321_5 + P_2321_6 + -JobCnt > 0)) AND (-FetchJobE_6_6 + -FetchJobE_6_5 + -FetchJobE_6_4 + -FetchJobE_6_3 + -FetchJobE_6_2 + -FetchJobE_6_1 + -FetchJobE_6_0 + -FetchJobE_5_6 + -FetchJobE_5_5 + -FetchJobE_5_4 + -FetchJobE_5_3 + -FetchJobE_5_2 + -Fetch... (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 2568 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 9 literals
lola: write sara problem file to PolyORBLF-COL-S06J06T06-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T06-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 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((P_1159_6 + P_1159_5 + P_1159_4 + P_1159_3 + P_1159_2 + P_1159_1 + -JobCnt > 0 AND ((-P_1725_6 + -P_1725_5 + -P_1725_4 + -P_1725_3 + -P_1725_2 + -P_1725_1 + -P_1725_0 <= -2 AND -P_1727 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_1 <= 0) OR -ModifiedSrc_6 + -ModifiedSr... (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 2568 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-S06J06T06-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T06-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 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((NotifyEventJobCompletedB_6 + NotifyEventJobCompletedB_5 + NotifyEventJobCompletedB_4 + NotifyEventJobCompletedB_3 + NotifyEventJobCompletedB_2 + NotifyEventJobCompletedB_1 + -cIsMonitoring <= 0 AND -NotifyEventJobCompletedE_6 + -NotifyEventJobCompletedE_5 + -NotifyEventJobCompletedE_4 + -NotifyEventJobCompletedE_3 + -NotifyEventJobCompletedE_2 + -NotifyEventJobCompletedE_1 <= -2) OR ((-cBloc... (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 2568 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-S06J06T06-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T06-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-TryAllocateOneTaskB_6 + -TryAllocateOneTaskB_5 + -TryAllocateOneTaskB_4 + -TryAllocateOneTaskB_3 + -TryAllocateOneTaskB_2 + -TryAllocateOneTaskB_1 <= -2 OR -AvailableJobId_0 + -AvailableJobId_1 + -AvailableJobId_2 + -AvailableJobId_3 + -AvailableJobId_4 + -AvailableJobId_5 + -AvailableJobId_6 <= -1))
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 2568 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-S06J06T06-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T06-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 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-AwakeTasks_6 + -AwakeTasks_5 + -AwakeTasks_4 + -AwakeTasks_3 + -AwakeTasks_2 + -AwakeTasks_1 > -1 AND (-P_1726 + Idle_6 + Idle_5 + Idle_4 + Idle_3 + Idle_2 + Idle_1 > 0 AND (-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 + -QueueJobB_5_4 + -QueueJobB_5_3 + -QueueJobB_5_2 + -QueueJobB_5_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 2568 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-S06J06T06-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T06-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P_1716 > -2 AND (P_1717 + -JobCnt > 0 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 + -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_6_6 + -P_2579_6_5 + -P_2579_6_4 + -P_2579_6_3 + -P_2579_6_2 + -P_2579_6_1 + -P_2579_5_6 + -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 2568 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-S06J06T06-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T06-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 (((-BlockedTasks + P_1725_6 + P_1725_5 + P_1725_4 + P_1725_3 + P_1725_2 + P_1725_1 + P_1725_0 > 0 OR -cJobCnt > -3) AND (-JobCnt + P_1155_6 + P_1155_5 + P_1155_4 + P_1155_3 + P_1155_2 + P_1155_1 > 0 AND (-NotifyEventEndOfCheckSourcesB_6 + -NotifyEventEndOfCheckSourcesB_5 + -NotifyEventEndOfCheckSourcesB_4 + -NotifyEventEndOfCheckSourcesB_3 + -NotifyEventEndOfCheckSourcesB_2 + -NotifyEventEndOfC... (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 2568 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-S06J06T06-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T06-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 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-NotifyEventJobQueuedB_1_6 + -NotifyEventJobQueuedB_1_5 + -NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB_1_2 + -NotifyEventJobQueuedB_1_1 + -NotifyEventJobQueuedB_1_0 + -NotifyEventJobQueuedB_6_6 + -NotifyEventJobQueuedB_6_5 + -NotifyEventJobQueuedB_6_4 + -NotifyEventJobQueuedB_6_3 + -NotifyEventJobQueuedB_6_2 + -NotifyEventJobQueuedB_6_1 + -NotifyEventJobQue... (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 2568 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-S06J06T06-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T06-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 358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((nyo_6 + nyo_5 + nyo_4 + nyo_3 + nyo_2 + nyo_1 + -NoSigAbort > 0 OR (-AbourtToModifySrc_6 + -AbourtToModifySrc_5 + -AbourtToModifySrc_4 + -AbourtToModifySrc_3 + -AbourtToModifySrc_2 + -AbourtToModifySrc_1 <= -3 OR -AbourtToModifySrc_6 + -AbourtToModifySrc_5 + -AbourtToModifySrc_4 + -AbourtToModifySrc_3 + -AbourtToModifySrc_2 + -AbourtToModifySrc_1 <= -2)) AND -cJobCnt <= -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 2568 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-S06J06T06-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T06-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 358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-P_1160_6 + -P_1160_2 + -P_1160_1 + -P_1160_3 + -P_1160_4 + -P_1160_5 > -2 OR (-P_1726 > -1 OR (-CreatedJobs_6_6 + -CreatedJobs_6_5 + -CreatedJobs_6_4 + -CreatedJobs_6_3 + -CreatedJobs_6_2 + -CreatedJobs_6_1 + -CreatedJobs_5_6 + -CreatedJobs_5_5 + -CreatedJobs_5_4 + -CreatedJobs_5_3 + -CreatedJobs_5_2 + -CreatedJobs_5_1 + -CreatedJobs_4_6 + -CreatedJobs_4_5 + -CreatedJobs_4_4 + -CreatedJobs_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 2568 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-S06J06T06-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T06-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 358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-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_6_6 + -P_2579_6_5 + -P_2579_6_4 + -P_2579_6_3 + -P_2579_6_2 + -P_2579_6_1 + -P_2579_5_6 + -P_2579_5_5 + -P_2579_5_4 + -P_2579_5_3 + -P_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2568 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-S06J06T06-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T06-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 358 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 + -P_1099 + DisablePollingE_6_6 + DisablePollingE_6_5 + DisablePollingE_6_4 + DisablePollingE_6_3 + DisablePollingE_6_2 + DisablePoll... (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 2568 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-S06J06T06-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T06-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 358 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-NotifyEventJobCompletedE_6 + -NotifyEventJobCompletedE_5 + -NotifyEventJobCompletedE_4 + -NotifyEventJobCompletedE_3 + -NotifyEventJobCompletedE_2 + -NotifyEventJobCompletedE_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 2568 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-S06J06T06-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J06T06-ReachabilityCardinality-15.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: RESULT
lola: summary: no yes unknown unknown unknown no unknown no no unknown unknown unknown unknown unknown unknown unknown
lola: time limit reached - aborting

BK_STOP 1463741548029

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