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 PolyORBNT-PT-S05J30, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369089200927
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463741697326

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityFireability @ PolyORBNT-PT-S05J30
FORMULA PolyORBNT-COL-S05J30-ReachabilityFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J30-ReachabilityFireability-1 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J30-ReachabilityFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J30-ReachabilityFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J30-ReachabilityFireability-4 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J30-ReachabilityFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J30-ReachabilityFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J30-ReachabilityFireability-7 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J30-ReachabilityFireability-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J30-ReachabilityFireability-9 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J30-ReachabilityFireability-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J30-ReachabilityFireability-11 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J30-ReachabilityFireability-12 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J30-ReachabilityFireability-13 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J30-ReachabilityFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J30-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: 1889/65536 symbol table entries, 156 collisions
lola: preprocessing...
lola: finding significant places
lola: 489 places, 1400 transitions, 407 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 918 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J30-ReachabilityFireability.task
lola: read: AG (!(((FIREABLE(trans_457_1) AND !(FIREABLE(NoJob_1))) OR ((((((((((((((((((((((((((((((((FIREABLE(fi2_4_1) OR FIREABLE(fi2_30_1)) OR FIREABLE(fi2_15_1)) OR FIREABLE(fi2_22_1)) OR FIREABLE(fi2_5_1)) OR FIREABLE(fi2_14_1)) OR FIREABLE(fi2_29_1)) OR FIREABLE(fi2_9_1)) OR FIREABLE(fi2_16_1)) OR FIREABLE(fi2_23_1)) OR FIREABLE(fi2_2_1)) OR FIREABLE(fi2_28_1)) OR FIREABLE(fi2_17_1)) OR FIREABLE(fi2_27... (shortened)
lola: formula length: 35334
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 (((! FIREABLE(trans_457_1) OR FIREABLE(NoJob_1)) AND ((! FIREABLE(fi2_4_1) AND (! FIREABLE(fi2_30_1) AND (! FIREABLE(fi2_15_1) AND (! FIREABLE(fi2_22_1) AND (! FIREABLE(fi2_5_1) AND (! FIREABLE(fi2_14_1) AND (! FIREABLE(fi2_29_1) AND (! FIREABLE(fi2_9_1) AND (! FIREABLE(fi2_16_1) AND (! FIREABLE(fi2_23_1) AND (! FIREABLE(fi2_2_1) AND (! FIREABLE(fi2_28_1) AND (! FIREABLE(fi2_17_1) AND (! FIREAB... (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 1628 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 5896 literals
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: EF (((FIREABLE(trans_689_23_1) OR (FIREABLE(trans_689_30_1) OR (FIREABLE(trans_689_5_1) OR (FIREABLE(trans_689_12_1) OR (FIREABLE(trans_689_2_1) OR (FIREABLE(trans_689_4_1) OR (FIREABLE(trans_689_22_1) OR (FIREABLE(trans_689_13_1) OR (FIREABLE(trans_689_3_1) OR (FIREABLE(trans_689_14_1) OR (FIREABLE(trans_689_0_1) OR (FIREABLE(trans_689_7_1) OR (FIREABLE(trans_689_21_1) OR (FIREABLE(trans_689_28_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 1628 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 266287973282 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 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(trans_533_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 1628 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 PolyORBNT-COL-S05J30-ReachabilityFireability-2.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((! FIREABLE(LeaveCSTCS_1) AND (FIREABLE(fo1_28_1) OR (FIREABLE(fo1_25_1) OR (FIREABLE(fo1_18_1) OR (FIREABLE(fo1_27_1) OR (FIREABLE(fo1_17_1) OR (FIREABLE(fo1_8_1) OR (FIREABLE(fo1_19_1) OR (FIREABLE(fo1_26_1) OR (FIREABLE(fo1_12_1) OR (FIREABLE(fo1_5_1) OR (FIREABLE(fo1_6_1) OR (FIREABLE(fo1_20_1) OR (FIREABLE(fo1_14_1) OR (FIREABLE(fo1_21_1) OR (FIREABLE(fo1_4_1) OR (FIREABLE(fo1_11_1) 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 1628 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 127 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(NoJob_1) AND FIREABLE(DummyOR2_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 1628 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 PolyORBNT-COL-S05J30-ReachabilityFireability-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J30-ReachabilityFireability-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 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(fo3_14_1) OR (FIREABLE(fo3_23_1) OR (FIREABLE(fo3_5_1) OR (FIREABLE(fo3_24_1) OR (FIREABLE(fo3_25_1) OR (FIREABLE(fo3_18_1) OR (FIREABLE(fo3_11_1) OR (FIREABLE(fo3_4_1) OR (FIREABLE(fo3_17_1) OR (FIREABLE(fo3_12_1) OR (FIREABLE(fo3_26_1) OR (FIREABLE(fo3_3_1) OR (FIREABLE(fo3_20_1) OR (FIREABLE(fo3_0_1) OR (FIREABLE(fo3_27_1) OR (FIREABLE(fo3_9_1) OR (FIREABLE(fo3_19_1) OR (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 1628 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 93 literals
lola: write sara problem file to PolyORBNT-COL-S05J30-ReachabilityFireability-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J30-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(JobExist_1) OR ! FIREABLE(trans_534_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 1628 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 PolyORBNT-COL-S05J30-ReachabilityFireability-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 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(fi3_3_1) AND (! FIREABLE(fi3_11_1) AND (! FIREABLE(fi3_28_1) AND (! FIREABLE(fi3_10_1) AND (! FIREABLE(fi3_17_1) AND (! FIREABLE(fi3_29_1) AND (! FIREABLE(fi3_22_1) AND (! FIREABLE(fi3_18_1) AND (! FIREABLE(fi3_4_1) AND (! FIREABLE(fi3_30_1) AND (! FIREABLE(fi3_21_1) AND (! FIREABLE(fi3_5_1) AND (! FIREABLE(fi3_9_1) AND (! FIREABLE(fi3_15_1) AND (! FIREABLE(fi3_16_1) AND (! FIREAB... (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 1628 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 287203899598797264732842260426185803326778149239979818797711520049754140346305935835136 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 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((FIREABLE(trans_461_1) OR (FIREABLE(NoJob_1) AND (FIREABLE(trans_459_1) AND ((FIREABLE(fo1_28_1) OR (FIREABLE(fo1_25_1) OR (FIREABLE(fo1_18_1) OR (FIREABLE(fo1_27_1) OR (FIREABLE(fo1_17_1) OR (FIREABLE(fo1_8_1) OR (FIREABLE(fo1_19_1) OR (FIREABLE(fo1_26_1) OR (FIREABLE(fo1_12_1) OR (FIREABLE(fo1_5_1) OR (FIREABLE(fo1_6_1) OR (FIREABLE(fo1_20_1) OR (FIREABLE(fo1_14_1) OR (FIREABLE(fo1_21_1) OR ... (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 1628 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 281 literals
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((! FIREABLE(NotifyEventEndOfCheckSources_1) OR (! FIREABLE(EnterCSTCS_1) OR (! FIREABLE(trans_510_1) OR ((FIREABLE(Run_25_1_1) OR (FIREABLE(Run_24_5_1) OR (FIREABLE(Run_30_3_1) OR (FIREABLE(Run_15_1_1) OR (FIREABLE(Run_14_4_1) OR (FIREABLE(Run_15_2_1) OR (FIREABLE(Run_5_2_1) OR (FIREABLE(Run_4_4_1) OR (FIREABLE(Run_27_4_1) OR (FIREABLE(Run_8_1_1) OR (FIREABLE(Run_25_2_1) OR (FIREABLE(Run_4_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 1628 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 182687704666362844493051000437864953509740281856 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 10 will run for 384 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(trans_461_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 1628 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 PolyORBNT-COL-S05J30-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((! FIREABLE(NotifyEventEndOfCheckSources_1) OR (FIREABLE(trans_487_1_3_3) OR (FIREABLE(trans_487_1_3_4) OR (FIREABLE(trans_487_1_4_1) OR (FIREABLE(trans_487_1_1_5) OR (FIREABLE(trans_487_1_5_2) OR (FIREABLE(trans_487_1_2_2) OR (FIREABLE(trans_487_1_5_4) OR (FIREABLE(trans_487_1_5_3) OR (FIREABLE(trans_487_1_2_3) OR (FIREABLE(trans_487_1_5_1) OR (FIREABLE(trans_487_1_3_5) OR (FIREABLE(trans_48... (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 1628 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 36391766 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 12 will run for 461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((FIREABLE(fo1_28_1) OR (FIREABLE(fo1_25_1) OR (FIREABLE(fo1_18_1) OR (FIREABLE(fo1_27_1) OR (FIREABLE(fo1_17_1) OR (FIREABLE(fo1_8_1) OR (FIREABLE(fo1_19_1) OR (FIREABLE(fo1_26_1) OR (FIREABLE(fo1_12_1) OR (FIREABLE(fo1_5_1) OR (FIREABLE(fo1_6_1) OR (FIREABLE(fo1_20_1) OR (FIREABLE(fo1_14_1) OR (FIREABLE(fo1_21_1) OR (FIREABLE(fo1_4_1) OR (FIREABLE(fo1_11_1) OR (FIREABLE(fo1_22_1) OR (FIREABL... (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 1628 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 2362665 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 13 will run for 461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((! FIREABLE(trans_510_1) OR ! FIREABLE(MustCheck_1)) AND ((! FIREABLE(GoPerformWork_10_1_PerformWork) AND (! FIREABLE(GoPerformWork_19_1_PerformWork) AND (! FIREABLE(GoPerformWork_28_1_PerformWork) AND (! FIREABLE(GoPerformWork_21_1_PerformWork) AND (! FIREABLE(GoPerformWork_0_1_PerformWork) AND (! FIREABLE(GoPerformWork_11_1_PerformWork) AND (! FIREABLE(GoPerformWork_17_1_PerformWork) 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 1628 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 695115 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 14 will run for 461 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(fi3_3_1) OR (FIREABLE(fi3_11_1) OR (FIREABLE(fi3_28_1) OR (FIREABLE(fi3_10_1) OR (FIREABLE(fi3_17_1) OR (FIREABLE(fi3_29_1) OR (FIREABLE(fi3_22_1) OR (FIREABLE(fi3_18_1) OR (FIREABLE(fi3_4_1) OR (FIREABLE(fi3_30_1) OR (FIREABLE(fi3_21_1) OR (FIREABLE(fi3_5_1) OR (FIREABLE(fi3_9_1) OR (FIREABLE(fi3_15_1) OR (FIREABLE(fi3_16_1) OR (FIREABLE(fi3_8_1) OR (FIREABLE(fi3_24_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 1628 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 3088366981419639 literals
lola: DNF formula is too big, sara cannot be used
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 922 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((FIREABLE(trans_510_1) OR (FIREABLE(trans_486_1_2) OR (FIREABLE(trans_486_1_5) OR (FIREABLE(trans_486_1_4) OR (FIREABLE(trans_486_1_3) OR (FIREABLE(trans_486_1_1) OR (FIREABLE(trans_534_1) OR ! FIREABLE(DummyOR1_1)))))))) AND (((! FIREABLE(fo1_28_1) AND (! FIREABLE(fo1_25_1) AND (! FIREABLE(fo1_18_1) AND (! FIREABLE(fo1_27_1) AND (! FIREABLE(fo1_17_1) AND (! FIREABLE(fo1_8_1) AND (! 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 1628 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 1364 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: RESULT
lola: summary: no unknown no yes unknown yes no unknown yes unknown yes unknown unknown unknown no no
lola: ========================================

BK_STOP 1463744315711

--------------------
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="PolyORBNT-PT-S05J30"
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/PolyORBNT-PT-S05J30.tgz
mv PolyORBNT-PT-S05J30 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 PolyORBNT-PT-S05J30, 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-146369089200927"
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 '' ReachabilityFireability.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 ;