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 Diffusion2D-PT-D30N150, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026kn-smll-146348010700237
=====================================================================

--------------------
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 Diffusion2D-PT-D30N150-CTLCardinality-0
FORMULA_NAME Diffusion2D-PT-D30N150-CTLCardinality-1
FORMULA_NAME Diffusion2D-PT-D30N150-CTLCardinality-10
FORMULA_NAME Diffusion2D-PT-D30N150-CTLCardinality-11
FORMULA_NAME Diffusion2D-PT-D30N150-CTLCardinality-12
FORMULA_NAME Diffusion2D-PT-D30N150-CTLCardinality-13
FORMULA_NAME Diffusion2D-PT-D30N150-CTLCardinality-14
FORMULA_NAME Diffusion2D-PT-D30N150-CTLCardinality-15
FORMULA_NAME Diffusion2D-PT-D30N150-CTLCardinality-2
FORMULA_NAME Diffusion2D-PT-D30N150-CTLCardinality-3
FORMULA_NAME Diffusion2D-PT-D30N150-CTLCardinality-4
FORMULA_NAME Diffusion2D-PT-D30N150-CTLCardinality-5
FORMULA_NAME Diffusion2D-PT-D30N150-CTLCardinality-6
FORMULA_NAME Diffusion2D-PT-D30N150-CTLCardinality-7
FORMULA_NAME Diffusion2D-PT-D30N150-CTLCardinality-8
FORMULA_NAME Diffusion2D-PT-D30N150-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1463602235735

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ Diffusion2D-PT-D30N150
FORMULA Diffusion2D-PT-D30N150-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-CTLCardinality-1 CANNOT_COMPUTE
FORMULA Diffusion2D-PT-D30N150-CTLCardinality-2 CANNOT_COMPUTE
FORMULA Diffusion2D-PT-D30N150-CTLCardinality-3 CANNOT_COMPUTE
FORMULA Diffusion2D-PT-D30N150-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-CTLCardinality-6 CANNOT_COMPUTE
FORMULA Diffusion2D-PT-D30N150-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-CTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-CTLCardinality-11 CANNOT_COMPUTE
FORMULA Diffusion2D-PT-D30N150-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-CTLCardinality-13 CANNOT_COMPUTE
FORMULA Diffusion2D-PT-D30N150-CTLCardinality-14 CANNOT_COMPUTE
FORMULA Diffusion2D-PT-D30N150-CTLCardinality-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: 7744/65536 symbol table entries, 1051 collisions
lola: preprocessing...
lola: finding significant places
lola: 900 places, 6844 transitions, 899 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 900 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D30N150-CTLCardinality.task
lola: read: !((AG (!(3 <= cAMP__21_10_)) OR AG ((2 <= cAMP__2_17_ OR cAMP__2_23_ <= cAMP__28_1_)))) : (AG (EG (cAMP__10_21_ <= cAMP__1_9_)) OR AF ((3 <= cAMP__5_16_ AND cAMP__1_3_ <= cAMP__18_5_))) : ((EG (cAMP__15_28_ <= cAMP__22_8_) AND AG (!(3 <= cAMP__4_4_))) OR !(!((!(cAMP__8_23_ <= cAMP__16_16_) OR !(cAMP__19_15_ <= cAMP__11_3_))))) : E(((1 <= cAMP__5_27_ OR cAMP__21_10_ <= cAMP__7_8_) OR !(2 <= cAMP__7... (shortened)
lola: formula length: 1614
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (-cAMP__21_10_ <= -3) AND EF ((-cAMP__2_17_ > -2 AND cAMP__2_23_ + -cAMP__28_1_ > 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cAMP__21_10_ <= -3)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cAMP__2_17_ > -2 AND cAMP__2_23_ + -cAMP__28_1_ > 0))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 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: yes
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (EG (-cAMP__1_9_ + cAMP__10_21_ <= 0)) OR AF ((-cAMP__5_16_ <= -3 AND -cAMP__18_5_ + cAMP__1_3_ <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EG (-cAMP__1_9_ + cAMP__10_21_ <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(!(A(TRUE U !(-cAMP__1_9_ + cAMP__10_21_ <= 0))))))
lola: processed formula length: 63
lola: 263 rewrites
lola: formula mentions 2 of 900 places; total mentions: 2
lola: closed formula file Diffusion2D-PT-D30N150-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((EG (-cAMP__22_8_ + cAMP__15_28_ <= 0) AND AG (-cAMP__4_4_ > -3)) OR (cAMP__8_23_ + -cAMP__16_16_ > 0 OR cAMP__19_15_ + -cAMP__11_3_ > 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-cAMP__22_8_ + cAMP__15_28_ <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-cAMP__22_8_ + cAMP__15_28_ <= 0)))
lola: processed formula length: 48
lola: 262 rewrites
lola: formula mentions 2 of 900 places; total mentions: 2
lola: closed formula file Diffusion2D-PT-D30N150-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-cAMP__5_27_ <= -1 OR (cAMP__21_10_ + -cAMP__7_8_ <= 0 OR -cAMP__7_11_ > -2)) U AG (cAMP__5_1_ + -cAMP__20_7_ <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-cAMP__5_27_ <= -1 OR (cAMP__21_10_ + -cAMP__7_8_ <= 0 OR -cAMP__7_11_ > -2)) U !(E(TRUE U !(cAMP__5_1_ + -cAMP__20_7_ <= 0))))
lola: processed formula length: 130
lola: 263 rewrites
lola: formula mentions 6 of 900 places; total mentions: 6
lola: closed formula file Diffusion2D-PT-D30N150-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cAMP__23_5_ <= -2 OR cAMP__30_18_ + -cAMP__25_24_ > 0))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (cAMP__21_25_ + -cAMP__26_18_ <= 0) AND AF (cAMP__24_2_ + -cAMP__26_12_ <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (cAMP__21_25_ + -cAMP__26_18_ <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EG ((-cAMP__7_20_ <= -1 AND -cAMP__22_21_ <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(A(TRUE U !((-cAMP__7_20_ <= -1 AND -cAMP__22_21_ <= -3)))))
lola: processed formula length: 70
lola: 263 rewrites
lola: formula mentions 2 of 900 places; total mentions: 2
lola: closed formula file Diffusion2D-PT-D30N150-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((AG (-cAMP__18_2_ + cAMP__16_24_ <= 0) OR EF (-cAMP__10_28_ <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (!(E(TRUE U !(-cAMP__18_2_ + cAMP__16_24_ <= 0))) OR E(TRUE U -cAMP__10_28_ <= -1)))
lola: processed formula length: 93
lola: 264 rewrites
lola: formula mentions 3 of 900 places; total mentions: 3
lola: closed formula file Diffusion2D-PT-D30N150-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((-cAMP__15_5_ > -1 AND (-cAMP__20_12_ + cAMP__2_16_ > 0 AND cAMP__29_6_ + -cAMP__28_8_ <= 0)) OR AG (-cAMP__20_18_ > -3)) AND AX (cAMP__20_11_ + -cAMP__18_22_ <= 0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 316 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-cAMP__15_5_ > -1 AND (-cAMP__20_12_ + cAMP__2_16_ > 0 AND cAMP__29_6_ + -cAMP__28_8_ <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file Diffusion2D-PT-D30N150-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-cAMP__20_18_ > -3)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 361 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((cAMP__26_25_ + -cAMP__5_19_ <= 0 AND ((-cAMP__28_28_ + cAMP__15_6_ <= 0 OR -cAMP__14_6_ + cAMP__25_13_ <= 0) AND -cAMP__23_9_ <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 421 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(cAMP__1_21_ + -cAMP__10_16_ <= 0 U AG (-cAMP__24_9_ + cAMP__15_5_ <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(cAMP__1_21_ + -cAMP__10_16_ <= 0 U !(E(TRUE U !(-cAMP__24_9_ + cAMP__15_5_ <= 0))))
lola: processed formula length: 85
lola: 263 rewrites
lola: formula mentions 4 of 900 places; total mentions: 4
lola: closed formula file Diffusion2D-PT-D30N150-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((EF (-cAMP__23_26_ <= -3) AND (-cAMP__12_24_ + cAMP__8_9_ > 0 OR -cAMP__10_9_ > -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (E(TRUE U -cAMP__23_26_ <= -3) AND (-cAMP__12_24_ + cAMP__8_9_ > 0 OR -cAMP__10_9_ > -3)))
lola: processed formula length: 99
lola: 263 rewrites
lola: formula mentions 4 of 900 places; total mentions: 4
lola: closed formula file Diffusion2D-PT-D30N150-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-cAMP__13_10_ > -3 AND (-cAMP__21_6_ > -1 AND -cAMP__8_18_ > -2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 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 13 will run for 650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((cAMP__17_18_ + -cAMP__8_8_ <= 0 AND -cAMP__15_19_ + cAMP__10_10_ <= 0)) AND (AG ((cAMP__30_28_ + -cAMP__21_6_ <= 0 AND cAMP__21_29_ + -cAMP__12_1_ <= 0)) AND (-cAMP__3_25_ + cAMP__28_7_ <= 0 AND ((-cAMP__19_14_ > -2 OR (-cAMP__8_16_ + cAMP__8_3_ <= 0 OR -cAMP__3_23_ <= -3)) AND cAMP__20_14_ + -cAMP__28_3_ <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((cAMP__17_18_ + -cAMP__8_8_ <= 0 AND -cAMP__15_19_ + cAMP__10_10_ <= 0))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 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: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 975 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((cAMP__30_28_ + -cAMP__21_6_ <= 0 AND cAMP__21_29_ + -cAMP__12_1_ <= 0))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 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: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (E(-cAMP__25_17_ + cAMP__25_16_ <= 0 U -cAMP__19_20_ + cAMP__22_17_ <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(E(-cAMP__25_17_ + cAMP__25_16_ <= 0 U -cAMP__19_20_ + cAMP__22_17_ <= 0))))
lola: processed formula length: 88
lola: 263 rewrites
lola: formula mentions 4 of 900 places; total mentions: 4
lola: closed formula file Diffusion2D-PT-D30N150-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 650 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-cAMP__14_14_ > -2)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3596 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: RESULT
lola: summary: yes unknown unknown unknown yes no unknown yes no yes no unknown no unknown unknown no
lola: ========================================

BK_STOP 1463605125214

--------------------
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="Diffusion2D-PT-D30N150"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/Diffusion2D-PT-D30N150.tgz
mv Diffusion2D-PT-D30N150 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 Diffusion2D-PT-D30N150, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026kn-smll-146348010700237"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;