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 QuasiCertifProtocol-PT-28, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098kn-smll-146369140300120
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463709990755

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ QuasiCertifProtocol-PT-28
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-0 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-1 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-5 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-6 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-9 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-10 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-11 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-14 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-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: 3444/65536 symbol table entries, 25 collisions
lola: preprocessing...
lola: finding significant places
lola: 2998 places, 446 transitions, 445 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 591 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: read: (A(!(2 <= a3) U !(AstopAbort <= n4_0 + n4_3 + n4_4 + n4_1 + n4_2 + n4_7 + n4_8 + n4_5 + n4_6 + n4_11 + n4_12 + n4_9 + n4_10 + n4_16 + n4_15 + n4_14 + n4_13 + n4_20 + n4_19 + n4_18 + n4_17 + n4_24 + n4_23 + n4_22 + n4_21 + n4_28 + n4_27 + n4_26 + n4_25)) AND EX (((n2_27 + n2_28 + n2_23 + n2_24 + n2_25 + n2_26 + n2_5 + n2_6 + n2_3 + n2_4 + n2_1 + n2_2 + n2_0 + n2_14 + n2_13 + n2_12 + n2_11 + n2_10 +... (shortened)
lola: formula length: 77372
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A(-a3 > -2 U -n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + AstopAbort + -n4_28 + -n4_27 + -n4_26 + -n4_25 + -n4_24 + -n4_23 + -n4_22 + -n4_21 + -n4_20 + -n4_19 + -n4_18 + -n4_17 + -n4_16 + -n4_15 + -n4_14 + -n4_13 + -n4_12 + -n4_11 + -n4_10 > 0) AND EX (((n2_9 + n2_8 + n2_7 + n2_6 + n2_5 + n2_4 + n2_3 + n2_2 + n2_1 + n2_0 + -SstopOK_7 + -SstopOK_6 + -SstopOK_1 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-a3 > -2 U -n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + AstopAbort + -n4_28 + -n4_27 + -n4_26 + -n4_25 + -n4_24 + -n4_23 + -n4_22 + -n4_21 + -n4_20 + -n4_19 + -n4_18 + -n4_17 + -n4_16 + -n4_15 + -n4_14 + -n4_13 + -n4_12 + -n4_11 + -n4_10 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-a3 > -2 U -n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + AstopAbort + -n4_28 + -n4_27 + -n4_26 + -n4_25 + -n4_24 + -n4_23 + -n4_22 + -n4_21 + -n4_20 + -n4_19 + -n4_18 + -n4_17 + -n4_16 + -n4_15 + -n4_14 + -n4_13 + -n4_12 + -n4_11 + -n4_10 > 0)
lola: processed formula length: 279
lola: 4224047 rewrites
lola: formula mentions 31 of 2998 places; total mentions: 31
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 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: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (AG (-a3 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(!(E(TRUE U !(-a3 > -2))))
lola: processed formula length: 28
lola: 4224048 rewrites
lola: formula mentions 1 of 2998 places; total mentions: 1
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 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: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EX (-Astart > -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(EX(-Astart > -1))))
lola: processed formula length: 32
lola: 4224048 rewrites
lola: formula mentions 1 of 2998 places; total mentions: 1
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 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: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 232 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (EG (-n6_9 + -n6_8 + -n6_7 + -n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 + -n6_10 + -n6_11 + -n6_12 + -n6_13 + -n6_14 + -n6_15 + -n6_16 + -n6_17 + -n6_18 + -n6_19 + -n6_20 + -n6_21 + -n6_22 + -n6_23 + -n6_24 + -n6_25 + -n6_26 + -n6_27 + -n6_28 > -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(!(A(TRUE U !(-n6_9 + -n6_8 + -n6_7 + -n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 + -n6_10 + -n6_11 + -n6_12 + -n6_13 + -n6_14 + -n6_15 + -n6_16 + -n6_17 + -n6_18 + -n6_19 + -n6_20 + -n6_21 + -n6_22 + -n6_23 + -n6_24 + -n6_25 + -n6_26 + -n6_27 + -n6_28 > -1))))
lola: processed formula length: 273
lola: 4224048 rewrites
lola: formula mentions 29 of 2998 places; total mentions: 29
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 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: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG (-s4_10 + -s4_11 + -s4_12 + -s4_13 + -s4_14 + -s4_15 + -s4_16 + -s4_17 + -s4_18 + -s4_19 + -s4_20 + -s4_21 + -s4_22 + -s4_23 + -s4_24 + -s4_25 + -s4_26 + -s4_27 + -s4_28 + -s4_9 + -s4_8 + -s4_7 + -s4_6 + -s4_5 + -s4_4 + -s4_3 + -s4_2 + -s4_1 + -s4_0 > -2) OR (-n9_2_28 + -n9_2_27 + -n9_2_26 + -n9_2_25 + -n9_2_24 + -n9_2_23 + -n9_2_22 + -n9_2_21 + -n9_2_20 + -n9_2_19 + -n9_2_18 + -n9_2_17 + -n9... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-s4_10 + -s4_11 + -s4_12 + -s4_13 + -s4_14 + -s4_15 + -s4_16 + -s4_17 + -s4_18 + -s4_19 + -s4_20 + -s4_21 + -s4_22 + -s4_23 + -s4_24 + -s4_25 + -s4_26 + -s4_27 + -s4_28 + -s4_9 + -s4_8 + -s4_7 + -s4_6 + -s4_5 + -s4_4 + -s4_3 + -s4_2 + -s4_1 + -s4_0 > -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 1780 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 5 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -n9_2_28 + -n9_2_27 + -n9_2_26 + -n9_2_25 + -n9_2_24 + -n9_2_23 + -n9_2_22 + -n9_2_21 + -n9_2_20 + -n9_2_19 + -n9_2_18 + -n9_2_17 + -n9_2_16 + -n9_2_15 + -n9_2_14 + -n9_2_13 + -n9_2_12 + -n9_2_11 + -n9_2_10 + -n9_26_28 + -n9_26_27 + -n9_26_26 + -n9_26_25 + -n9_26_24 + -n9_26_23 + -n9_26_22 + -n9_26_21 + -n9_26_20 + -n9_26_19 + -n9_26_18 + -n9_26_17 + -n9_26_16 + -n9_26_15 + -n9_26_14 + -n9_26_13 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -n8_10_9 + -n8_10_8 + -n8_10_7 + -n8_10_6 + -n8_10_5 + -n8_10_4 + -n8_10_3 + -n8_10_2 + -n8_10_1 + -n8_10_0 + -n8_23_9 + -n8_23_8 + -n8_23_7 + -n8_23_6 + -n8_23_5 + -n8_23_4 + -n8_23_3 + -n8_23_2 + -n8_23_1 + -n8_23_0 + -n8_0_28 + -n8_0_27 + -n8_0_26 + -n8_0_25 + -n8_0_24 + -n8_0_23 + -n8_0_22 + -n8_0_21 + -n8_0_20 + -n8_0_19 + -n8_0_18 + -n8_0_17 + -n8_0_16 + -n8_0_15 + -n8_0_14 + -n8_0_13 + -n8_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -s4_10 + -s4_11 + -s4_12 + -s4_13 + -s4_14 + -s4_15 + -s4_16 + -s4_17 + -s4_18 + -s4_19 + -s4_20 + -s4_21 + -s4_22 + -s4_23 + -s4_24 + -s4_25 + -s4_26 + -s4_27 + -s4_28 + -s4_9 + -s4_8 + -s4_7 + -s4_6 + -s4_5 + -s4_4 + -s4_3 + -s4_2 + -s4_1 + -s4_0 <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 378 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-CstopOK_28 + -CstopOK_27 + -CstopOK_26 + -CstopOK_25 + -CstopOK_24 + -CstopOK_23 + -CstopOK_22 + -CstopOK_21 + -CstopOK_20 + -CstopOK_19 + -CstopOK_18 + -CstopOK_17 + -CstopOK_16 + -CstopOK_15 + -CstopOK_14 + -CstopOK_13 + -CstopOK_12 + -CstopOK_11 + -CstopOK_10 + n2_9 + n2_8 + n2_7 + n2_6 + n2_5 + n2_4 + n2_3 + n2_2 + n2_1 + n2_0 + -CstopOK_9 + -CstopOK_8 + -CstopOK_7 + -CstopOK_6 + -CstopOK... (shortened)
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 1780 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 5 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (E(-SstopAbort <= -2 U -a4 + CstopAbort <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(E(-SstopAbort <= -2 U -a4 + CstopAbort <= 0))))
lola: processed formula length: 60
lola: 4224048 rewrites
lola: formula mentions 3 of 2998 places; total mentions: 3
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 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 6 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (EF (-a3 <= -3)) OR AF ((n5_9 + n5_8 + n5_7 + n5_6 + n5_5 + n5_4 + n5_3 + n5_2 + n5_1 + n5_0 + n5_28 + n5_27 + n5_26 + n5_25 + n5_24 + n5_23 + n5_22 + n5_21 + n5_20 + n5_19 + n5_18 + n5_17 + n5_16 + n5_15 + n5_14 + n5_13 + n5_12 + n5_11 + -n1_28 + -n1_27 + -n1_26 + -n1_25 + -n1_24 + -n1_23 + -n1_22 + -n1_21 + -n1_20 + -n1_19 + -n1_18 + -n1_17 + -n1_16 + -n1_15 + -n1_14 + -n1_13 + -n1_12 + -n1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EF (-a3 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U -a3 <= -3))
lola: processed formula length: 29
lola: 4224048 rewrites
lola: formula mentions 1 of 2998 places; total mentions: 1
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (-n8_10_9 + -n8_10_8 + -n8_10_7 + -n8_10_6 + -n8_10_5 + -n8_10_4 + -n8_10_3 + -n8_10_2 + -n8_10_1 + -n8_10_0 + -n8_23_9 + -n8_23_8 + -n8_23_7 + -n8_23_6 + -n8_23_5 + -n8_23_4 + -n8_23_3 + -n8_23_2 + -n8_23_1 + -n8_23_0 + -n8_0_28 + -n8_0_27 + -n8_0_26 + -n8_0_25 + -n8_0_24 + -n8_0_23 + -n8_0_22 + -n8_0_21 + -n8_0_20 + -n8_0_19 + -n8_0_18 + -n8_0_17 + -n8_0_16 + -n8_0_15 + -n8_0_14 + -n8_0_13 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-n8_10_9 + -n8_10_8 + -n8_10_7 + -n8_10_6 + -n8_10_5 + -n8_10_4 + -n8_10_3 + -n8_10_2 + -n8_10_1 + -n8_10_0 + -n8_23_9 + -n8_23_8 + -n8_23_7 + -n8_23_6 + -n8_23_5 + -n8_23_4 + -n8_23_3 + -n8_23_2 + -n8_23_1 + -n8_23_0 + -n8_0_28 + -n8_0_27 + -n8_0_26 + -n8_0_25 + -n8_0_24 + -n8_0_23 + -n8_0_22 + -n8_0_21 + -n8_0_20 + -n8_0_19 + -n8_0_18 + -n8_0_17 + -n8_0_16 + -n8_0_15 + -n8_0_14 + -n8_0_13 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -n8_10_9 + -n8_10_8 + -n8_10_7 + -n8_10_6 + -n8_10_5 + -n8_10_4 + -n8_10_3 + -n8_10_2 + -n8_10_1 + -n8_10_0 + -n8_23_9 + -n8_23_8 + -n8_23_7 + -n8_23_6 + -n8_23_5 + -n8_23_4 + -n8_23_3 + -n8_23_2 + -n8_23_1 + -n8_23_0 + -n8_0_28 + -n8_0_27 + -n8_0_26 + -n8_0_25 + -n8_0_24 + -n8_0_23 + -n8_0_22 + -n8_0_21 + -n8_0_20 + -n8_0_19 + -n8_0_18 + -n8_0_17 + -n8_0_16 + -n8_0_15 + -n8_0_14 + -n8_0_... (shortened)
lola: processed formula length: 9525
lola: 4224047 rewrites
lola: formula mentions 841 of 2998 places; total mentions: 841
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 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: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((EG (n9_2_28 + n9_2_27 + n9_2_26 + n9_2_25 + n9_2_24 + n9_2_23 + n9_2_22 + n9_2_21 + n9_2_20 + n9_2_19 + n9_2_18 + n9_2_17 + n9_2_16 + n9_2_15 + n9_2_14 + n9_2_13 + n9_2_12 + n9_2_11 + n9_2_10 + n9_26_28 + n9_26_27 + n9_26_26 + n9_26_25 + n9_26_24 + n9_26_23 + n9_26_22 + n9_26_21 + n9_26_20 + n9_26_19 + n9_26_18 + n9_26_17 + n9_26_16 + n9_26_15 + n9_26_14 + n9_26_13 + n9_26_12 + n9_26_11 + n9_26... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (n9_2_28 + n9_2_27 + n9_2_26 + n9_2_25 + n9_2_24 + n9_2_23 + n9_2_22 + n9_2_21 + n9_2_20 + n9_2_19 + n9_2_18 + n9_2_17 + n9_2_16 + n9_2_15 + n9_2_14 + n9_2_13 + n9_2_12 + n9_2_11 + n9_2_10 + n9_26_28 + n9_26_27 + n9_26_26 + n9_26_25 + n9_26_24 + n9_26_23 + n9_26_22 + n9_26_21 + n9_26_20 + n9_26_19 + n9_26_18 + n9_26_17 + n9_26_16 + n9_26_15 + n9_26_14 + n9_26_13 + n9_26_12 + n9_26_11 + n9_26_10... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(n9_2_28 + n9_2_27 + n9_2_26 + n9_2_25 + n9_2_24 + n9_2_23 + n9_2_22 + n9_2_21 + n9_2_20 + n9_2_19 + n9_2_18 + n9_2_17 + n9_2_16 + n9_2_15 + n9_2_14 + n9_2_13 + n9_2_12 + n9_2_11 + n9_2_10 + n9_26_28 + n9_26_27 + n9_26_26 + n9_26_25 + n9_26_24 + n9_26_23 + n9_26_22 + n9_26_21 + n9_26_20 + n9_26_19 + n9_26_18 + n9_26_17 + n9_26_16 + n9_26_15 + n9_26_14 + n9_26_13 + n9_26_12 + n9_26_11 +... (shortened)
lola: processed formula length: 8940
lola: 4224047 rewrites
lola: formula mentions 870 of 2998 places; total mentions: 870
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 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: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-a2 <= -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 1780 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 10 will run for 412 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-n6_9 + -n6_8 + -n6_7 + -n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 + -n6_10 + -n6_11 + -n6_12 + -n6_13 + -n6_14 + -n6_15 + -n6_16 + -n6_17 + -n6_18 + -n6_19 + -n6_20 + -n6_21 + -n6_22 + -n6_23 + -n6_24 + -n6_25 + -n6_26 + -n6_27 + -n6_28 <= -3 OR (-SstopAbort <= -3 OR -SstopAbort <= -1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 495 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-a4 + a2 > 0 AND -Cstart_9 + -Cstart_8 + -Cstart_7 + -Cstart_6 + -Cstart_5 + -Cstart_4 + -Cstart_3 + -Cstart_2 + -Cstart_1 + -Cstart_0 + -Cstart_28 + -Cstart_27 + -Cstart_26 + -Cstart_25 + -Cstart_24 + -Cstart_23 + -Cstart_22 + -Cstart_21 + -Cstart_20 + -Cstart_19 + -Cstart_18 + -Cstart_17 + -Cstart_16 + -Cstart_15 + -Cstart_14 + -Cstart_13 + -Cstart_12 + -Cstart_11 + -Cstart_10 <= -1))
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 1780 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EX ((-n6_9 + -n6_8 + -n6_7 + -n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 + -n6_10 + -n6_11 + -n6_12 + -n6_13 + -n6_14 + -n6_15 + -n6_16 + -n6_17 + -n6_18 + -n6_19 + -n6_20 + -n6_21 + -n6_22 + -n6_23 + -n6_24 + -n6_25 + -n6_26 + -n6_27 + -n6_28 <= -2 OR -c1_9 + -c1_10 + -c1_11 + -c1_12 + -c1_13 + -c1_14 + -c1_15 + -c1_16 + -c1_17 + -c1_18 + -c1_19 + -c1_20 + -c1_21 + -c1_22 + -c1_23 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((-n6_9 + -n6_8 + -n6_7 + -n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 + -n6_10 + -n6_11 + -n6_12 + -n6_13 + -n6_14 + -n6_15 + -n6_16 + -n6_17 + -n6_18 + -n6_19 + -n6_20 + -n6_21 + -n6_22 + -n6_23 + -n6_24 + -n6_25 + -n6_26 + -n6_27 + -n6_28 <= -2 OR -c1_9 + -c1_10 + -c1_11 + -c1_12 + -c1_13 + -c1_14 + -c1_15 + -c1_16 + -c1_17 + -c1_18 + -c1_19 + -c1_20 + -c1_21 + -c1_22 + -c1_... (shortened)
lola: processed formula length: 528
lola: 4224048 rewrites
lola: formula mentions 58 of 2998 places; total mentions: 58
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 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: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-a5 + a2 > 0))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -a5 + a2 > 0))))
lola: processed formula length: 38
lola: 4224048 rewrites
lola: formula mentions 2 of 2998 places; total mentions: 2
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 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 11 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(AG (-SstopAbort + a5 <= 0) U -Astart <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(!(E(TRUE U !(-SstopAbort + a5 <= 0))) U -Astart <= -2)
lola: processed formula length: 56
lola: 4224048 rewrites
lola: formula mentions 3 of 2998 places; total mentions: 3
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 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 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-AstopOK <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -AstopOK <= -3)
lola: processed formula length: 24
lola: 4224047 rewrites
lola: formula mentions 1 of 2998 places; total mentions: 1
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 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: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 472 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-n2_9 + -n2_8 + -n2_7 + -n2_6 + -n2_5 + -n2_4 + -n2_3 + -n2_2 + -n2_1 + -n2_0 + -n2_10 + -n2_11 + -n2_12 + -n2_13 + -n2_14 + -n2_15 + -n2_16 + -n2_17 + -n2_18 + -n2_19 + -n2_20 + -n2_21 + -n2_22 + -n2_23 + -n2_24 + -n2_25 + -n2_26 + -n2_27 + -n2_28 <= -2 AND ((-n1_28 + -n1_27 + -n1_26 + -n1_25 + -n1_24 + -n1_23 + -n1_22 + -n1_21 + -n1_20 + -n1_19 + -n1_18 + -n1_17 + -n1_16 + -n1_15 + -n1_14 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (-n2_9 + -n2_8 + -n2_7 + -n2_6 + -n2_5 + -n2_4 + -n2_3 + -n2_2 + -n2_1 + -n2_0 + -n2_10 + -n2_11 + -n2_12 + -n2_13 + -n2_14 + -n2_15 + -n2_16 + -n2_17 + -n2_18 + -n2_19 + -n2_20 + -n2_21 + -n2_22 + -n2_23 + -n2_24 + -n2_25 + -n2_26 + -n2_27 + -n2_28 <= -2 AND ((-n1_28 + -n1_27 + -n1_26 + -n1_25 + -n1_24 + -n1_23 + -n1_22 + -n1_21 + -n1_20 + -n1_19 + -n1_18 + -n1_17 + -n1_16 + -n1_15 + -n1... (shortened)
lola: processed formula length: 933
lola: 4224048 rewrites
lola: formula mentions 88 of 2998 places; total mentions: 88
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(((-AstopAbort <= -1 AND s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + -a2 + s6_10 + s6_11 + s6_12 + s6_13 + s6_14 + s6_15 + s6_16 + s6_17 + s6_18 + s6_19 + s6_20 + s6_21 + s6_22 + s6_23 + s6_24 + s6_25 + s6_26 + s6_27 + s6_28 <= 0) OR n8_10_9 + n8_10_8 + n8_10_7 + n8_10_6 + n8_10_5 + n8_10_4 + n8_10_3 + n8_10_2 + n8_10_1 + n8_10_0 + n8_23_9 + n8_23_8 + n8_23_7 + n8_23_6 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((-AstopAbort <= -1 AND s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + -a2 + s6_10 + s6_11 + s6_12 + s6_13 + s6_14 + s6_15 + s6_16 + s6_17 + s6_18 + s6_19 + s6_20 + s6_21 + s6_22 + s6_23 + s6_24 + s6_25 + s6_26 + s6_27 + s6_28 <= 0) OR n8_10_9 + n8_10_8 + n8_10_7 + n8_10_6 + n8_10_5 + n8_10_4 + n8_10_3 + n8_10_2 + n8_10_1 + n8_10_0 + n8_23_9 + n8_23_8 + n8_23_7 + n8_23_6 +... (shortened)
lola: processed formula length: 9454
lola: 4224048 rewrites
lola: formula mentions 901 of 2998 places; total mentions: 930
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 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 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-s2_10 + -s2_11 + -s2_12 + -s2_13 + -s2_14 + -s2_15 + -s2_16 + -s2_17 + -s2_18 + -s2_19 + -s2_20 + -s2_21 + -s2_22 + -s2_23 + -s2_24 + -s2_25 + -s2_26 + -s2_27 + -s2_28 + -s2_0 + -s2_1 + -s2_2 + -s2_3 + -s2_4 + -s2_5 + -s2_6 + -s2_7 + -s2_8 + -s2_9 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -s2_10 + -s2_11 + -s2_12 + -s2_13 + -s2_14 + -s2_15 + -s2_16 + -s2_17 + -s2_18 + -s2_19 + -s2_20 + -s2_21 + -s2_22 + -s2_23 + -s2_24 + -s2_25 + -s2_26 + -s2_27 + -s2_28 + -s2_0 + -s2_1 + -s2_2 + -s2_3 + -s2_4 + -s2_5 + -s2_6 + -s2_7 + -s2_8 + -s2_9 <= -1)
lola: processed formula length: 264
lola: 4224047 rewrites
lola: formula mentions 29 of 2998 places; total mentions: 29
lola: closed formula file QuasiCertifProtocol-COL-28-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 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: Child process aborted or communication problem between parent and child process
lola: RESULT
lola: summary: unknown unknown no yes no unknown unknown no yes unknown unknown unknown no yes unknown unknown

BK_STOP 1463713019988

--------------------
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="QuasiCertifProtocol-PT-28"
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/QuasiCertifProtocol-PT-28.tgz
mv QuasiCertifProtocol-PT-28 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 QuasiCertifProtocol-PT-28, 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 r098kn-smll-146369140300120"
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 ;