About the Execution of LoLa for PolyORBLF-PT-S04J06T08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4276.210 | 2760512.00 | 3772395.00 | 482.50 | ??TFT??F?T?TT?TT | normal |
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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369089000756
=====================================================================
--------------------
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-ReachabilityFireability-0
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-1
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-10
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-11
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-12
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-13
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-14
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-15
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-2
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-3
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-4
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-5
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-6
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-7
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-8
FORMULA_NAME PolyORBLF-COL-S04J06T08-ReachabilityFireability-9
=== Now, execution of the tool begins
BK_START 1463730098416
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PolyORBLF-PT-S04J06T08
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-0 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-1 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-2 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-4 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-7 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-13 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-14 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S04J06T08-ReachabilityFireability-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-ReachabilityFireability.task
lola: read: AG ((!(((((((((FIREABLE(T_1145_7) OR FIREABLE(T_1145_5)) OR FIREABLE(T_1145_8)) OR FIREABLE(T_1145_6)) OR FIREABLE(T_1145_3)) OR FIREABLE(T_1145_4)) OR FIREABLE(T_1145_1)) OR FIREABLE(T_1145_2)) AND ((((((((FIREABLE(T_1444_7) OR FIREABLE(T_1444_6)) OR FIREABLE(T_1444_4)) OR FIREABLE(T_1444_5)) OR FIREABLE(T_1444_3)) OR FIREABLE(T_1444_1)) OR FIREABLE(T_1444_2)) OR FIREABLE(T_1444_8)) AND (((((((((... (shortened)
lola: formula length: 76777
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T_1145_7) AND (! FIREABLE(T_1145_5) AND (! FIREABLE(T_1145_8) AND (! FIREABLE(T_1145_6) AND (! FIREABLE(T_1145_3) AND (! FIREABLE(T_1145_4) AND (! FIREABLE(T_1145_1) AND ! FIREABLE(T_1145_2)))))))) OR ((! FIREABLE(T_1444_7) AND (! FIREABLE(T_1444_6) AND (! FIREABLE(T_1444_4) AND (! FIREABLE(T_1444_5) AND (! FIREABLE(T_1444_3) AND (! FIREABLE(T_1444_1) AND (! FIREABLE(T_1444_2) AND... (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 440376 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T_1123_4_1) AND (! FIREABLE(T_1123_1_3) AND (! FIREABLE(T_1123_1_4) AND (! FIREABLE(T_1123_6_2) AND (! FIREABLE(T_1123_8_4) AND (! FIREABLE(T_1123_2_2) AND (! FIREABLE(T_1123_5_1) AND (! FIREABLE(T_1123_8_3) AND (! FIREABLE(T_1123_3_3) AND (! FIREABLE(T_1123_2_1) AND (! FIREABLE(T_1123_5_2) AND (! FIREABLE(T_1123_8_2) AND (! FIREABLE(T_1123_6_4) AND (! FIREABLE(T_1123_3_4) AND (! ... (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 5120 literals
lola: write sara problem file to PolyORBLF-COL-S04J06T08-ReachabilityFireability.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(T_2294_1) AND (! FIREABLE(T_2294_5) AND (! FIREABLE(T_2294_4) AND (! FIREABLE(T_2294_3) AND (! FIREABLE(T_2294_2) AND (! FIREABLE(T_2294_8) AND (! FIREABLE(T_2294_7) AND (! FIREABLE(T_2294_6) AND (! FIREABLE(NOPEP_6) AND (! FIREABLE(NOPEP_5) AND (! FIREABLE(NOPEP_7) AND (! FIREABLE(NOPEP_8) AND (! FIREABLE(NOPEP_1) AND (! FIREABLE(NOPEP_2) AND (! FIREABLE(NOPEP_3) AND ! FIREABLE(N... (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 101864 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(GoIdle_2) OR (FIREABLE(GoIdle_5) OR (FIREABLE(GoIdle_4) OR (FIREABLE(GoIdle_7) OR (FIREABLE(GoIdle_6) OR (FIREABLE(GoIdle_8) OR (FIREABLE(GoIdle_1) OR FIREABLE(GoIdle_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 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 8 literals
lola: write sara problem file to PolyORBLF-COL-S04J06T08-ReachabilityFireability-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(DummyOR1_6) AND (! FIREABLE(DummyOR1_4) AND (! FIREABLE(DummyOR1_7) AND (! FIREABLE(DummyOR1_5) AND (! FIREABLE(DummyOR1_2) AND (! FIREABLE(DummyOR1_3) AND (! FIREABLE(DummyOR1_1) AND ! FIREABLE(DummyOR1_8)))))))) OR ((! FIREABLE(NoMonitoring_2) AND (! FIREABLE(NoMonitoring_1) AND (! FIREABLE(NoMonitoring_8) AND (! FIREABLE(NoMonitoring_6) AND (! FIREABLE(NoMonitoring_5) AND (! FI... (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 557752 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((((FIREABLE(T_2577_1_4) OR (FIREABLE(T_2577_2_4) OR (FIREABLE(T_2577_4_8) OR (FIREABLE(T_2577_1_2) OR (FIREABLE(T_2577_2_6) OR (FIREABLE(T_2577_3_1) OR (FIREABLE(T_2577_3_8) OR (FIREABLE(T_2577_2_8) OR (FIREABLE(T_2577_1_3) OR (FIREABLE(T_2577_4_4) OR (FIREABLE(T_2577_3_6) OR (FIREABLE(T_2577_1_8) OR (FIREABLE(T_2577_4_6) OR (FIREABLE(T_2577_1_6) OR (FIREABLE(T_2577_3_4) OR (FIREABLE(T_2577_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 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 564449040 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(EnterCSPW_3) AND (! FIREABLE(EnterCSPW_1) AND (! FIREABLE(EnterCSPW_8) AND (! FIREABLE(EnterCSPW_7) AND (! FIREABLE(EnterCSPW_6) AND (! FIREABLE(EnterCSPW_4) AND (! FIREABLE(EnterCSPW_5) AND (! FIREABLE(EnterCSPW_2) AND (FIREABLE(LeaveCSTCS_7) OR (FIREABLE(LeaveCSTCS_8) OR (FIREABLE(LeaveCSTCS_1) OR (FIREABLE(LeaveCSTCS_2) OR (FIREABLE(LeaveCSTCS_3) OR (FIREABLE(LeaveCSTCS_4) OR (F... (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 6622 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_1713_6_1) OR (FIREABLE(T_1713_4_1) OR (FIREABLE(T_1713_5_7) OR (FIREABLE(T_1713_4_2) OR (FIREABLE(T_1713_6_5) OR (FIREABLE(T_1713_3_3) OR (FIREABLE(T_1713_6_8) OR (FIREABLE(T_1713_5_1) OR (FIREABLE(T_1713_3_7) OR (FIREABLE(T_1713_5_8) OR (FIREABLE(T_1713_5_5) OR (FIREABLE(T_1713_6_3) OR (FIREABLE(T_1713_1_6) OR (FIREABLE(T_1713_1_2) OR (FIREABLE(T_1713_4_3) OR (FIREABLE(T_1713_5_4... (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 703379218788772395316613742592 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(NeedMonitoring_8) OR (FIREABLE(NeedMonitoring_2) OR (FIREABLE(NeedMonitoring_3) OR (FIREABLE(NeedMonitoring_4) OR (FIREABLE(NeedMonitoring_5) OR (FIREABLE(NeedMonitoring_7) OR (FIREABLE(NeedMonitoring_6) OR FIREABLE(NeedMonitoring_1)))))))) AND (! FIREABLE(NoMonitoring_2) AND (! FIREABLE(NoMonitoring_1) AND (! FIREABLE(NoMonitoring_8) AND (! FIREABLE(NoMonitoring_6) AND (! FIREABLE(... (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 8248 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(SetSigAbort_7) OR (FIREABLE(SetSigAbort_6) OR (FIREABLE(SetSigAbort_8) OR (FIREABLE(SetSigAbort_1) OR (FIREABLE(SetSigAbort_2) OR (FIREABLE(SetSigAbort_4) OR (FIREABLE(SetSigAbort_3) OR FIREABLE(SetSigAbort_5)))))))) AND (! FIREABLE(T_1125_8_1_3_4) AND (! FIREABLE(T_1125_2_1_4_3) AND (! FIREABLE(T_1125_1_1_4_3) AND (! FIREABLE(T_1125_6_1_1_4) AND (! FIREABLE(T_1125_8_1_4_1) AND (! F... (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 inf literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(NoMonitoring_2) OR (FIREABLE(NoMonitoring_1) OR (FIREABLE(NoMonitoring_8) OR (FIREABLE(NoMonitoring_6) OR (FIREABLE(NoMonitoring_5) OR (FIREABLE(NoMonitoring_3) OR (FIREABLE(NoMonitoring_7) OR FIREABLE(NoMonitoring_4)))))))))
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 16 literals
lola: write sara problem file to PolyORBLF-COL-S04J06T08-ReachabilityFireability-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((FIREABLE(WaitCompleted_2_7) OR (FIREABLE(WaitCompleted_3_4) OR (FIREABLE(WaitCompleted_1_8) OR (FIREABLE(WaitCompleted_3_5) OR (FIREABLE(WaitCompleted_4_4) OR (FIREABLE(WaitCompleted_3_7) OR (FIREABLE(WaitCompleted_2_5) OR (FIREABLE(WaitCompleted_1_3) OR (FIREABLE(WaitCompleted_4_2) OR (FIREABLE(WaitCompleted_1_5) OR (FIREABLE(WaitCompleted_2_3) OR (FIREABLE(WaitCompleted_3_1) OR (FIREABLE(... (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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(T_2577_1_4) OR (FIREABLE(T_2577_2_4) OR (FIREABLE(T_2577_4_8) OR (FIREABLE(T_2577_1_2) OR (FIREABLE(T_2577_2_6) OR (FIREABLE(T_2577_3_1) OR (FIREABLE(T_2577_3_8) OR (FIREABLE(T_2577_2_8) OR (FIREABLE(T_2577_1_3) OR (FIREABLE(T_2577_4_4) OR (FIREABLE(T_2577_3_6) OR (FIREABLE(T_2577_1_8) OR (FIREABLE(T_2577_4_6) OR (FIREABLE(T_2577_1_6) OR (FIREABLE(T_2577_3_4) OR (FIREABLE(T_2577_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 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 93280 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(EnterCSIS_2_2) OR (FIREABLE(EnterCSIS_1_1) OR (FIREABLE(EnterCSIS_1_8) OR (FIREABLE(EnterCSIS_3_4) OR (FIREABLE(EnterCSIS_4_5) OR (FIREABLE(EnterCSIS_1_3) OR (FIREABLE(EnterCSIS_3_6) OR (FIREABLE(EnterCSIS_4_3) OR (FIREABLE(EnterCSIS_1_5) OR (FIREABLE(EnterCSIS_3_2) OR (FIREABLE(EnterCSIS_2_6) OR (FIREABLE(EnterCSIS_4_8) OR (FIREABLE(EnterCSIS_4_1) OR (FIREABLE(EnterCSIS_1_7) OR (FI... (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 512 literals
lola: write sara problem file to PolyORBLF-COL-S04J06T08-ReachabilityFireability-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBLF-COL-S04J06T08-ReachabilityFireability-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 779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(LeaveIdle_8_8) OR (FIREABLE(LeaveIdle_5_5) OR (FIREABLE(LeaveIdle_6_6) OR (FIREABLE(LeaveIdle_7_7) OR (FIREABLE(LeaveIdle_4_4) OR (FIREABLE(LeaveIdle_1_1) OR (FIREABLE(LeaveIdle_2_2) OR FIREABLE(LeaveIdle_3_3)))))))) AND (! FIREABLE(DummyOR1_6) AND (! FIREABLE(DummyOR1_4) AND (! FIREABLE(DummyOR1_7) AND (! FIREABLE(DummyOR1_5) AND (! FIREABLE(DummyOR1_2) AND (! FIREABLE(DummyOR1_3) ... (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 155215888 literals
lola: DNF formula is too big, sara cannot be used
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 780 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(T_1145_7) OR (FIREABLE(T_1145_5) OR (FIREABLE(T_1145_8) OR (FIREABLE(T_1145_6) OR (FIREABLE(T_1145_3) OR (FIREABLE(T_1145_4) OR (FIREABLE(T_1145_1) OR (FIREABLE(T_1145_2) OR (FIREABLE(NotifyEventJobCompleted_5) OR (FIREABLE(NotifyEventJobCompleted_4) OR (FIREABLE(NotifyEventJobCompleted_7) OR (FIREABLE(NotifyEventJobCompleted_1) OR (FIREABLE(NotifyEventJobCompleted_6) OR (FIREABLE(No... (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 590295810358705520640 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: RESULT
lola: summary: unknown unknown unknown yes unknown yes yes unknown yes yes yes no yes unknown unknown no
lola: ========================================
BK_STOP 1463732858928
--------------------
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="ReachabilityFireability"
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 ReachabilityFireability"
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-146369089000756"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '
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 ;