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

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

=== Now, execution of the tool begins

BK_START 1463698764509

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ QuasiCertifProtocol-PT-10
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-0 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-1 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-4 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-10-CTLCardinality-15 TRUE 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: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 550 places, 176 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 231 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: read: ((((!(1 <= a1) AND (SstopOK_10 + SstopOK_8 + SstopOK_9 + SstopOK_6 + SstopOK_7 + SstopOK_4 + SstopOK_5 + SstopOK_1 + SstopOK_0 + SstopOK_3 + SstopOK_2 <= a2 OR 3 <= n7_0_0 + n7_1_0 + n7_2_0 + n7_7_1 + n7_6_1 + n7_5_1 + n7_4_1 + n7_3_1 + n7_2_1 + n7_1_1 + n7_0_1 + n7_10_0 + n7_9_0 + n7_8_0 + n7_7_0 + n7_6_0 + n7_5_0 + n7_4_0 + n7_3_0 + n7_0_3 + n7_1_3 + n7_9_2 + n7_10_2 + n7_7_2 + n7_8_2 + n7_5_2 +... (shortened)
lola: formula length: 14340
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((-a1 > -1 AND ((SstopOK_6 + SstopOK_7 + SstopOK_9 + SstopOK_8 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_2 + SstopOK_1 + SstopOK_0 + SstopOK_10 + -a2 <= 0 OR -n7_5_9 + -n7_5_8 + -n7_5_7 + -n7_5_6 + -n7_5_5 + -n7_5_4 + -n7_5_3 + -n7_5_2 + -n7_5_1 + -n7_5_0 + -n7_9_10 + -n7_7_1 + -n7_7_2 + -n7_7_3 + -n7_7_4 + -n7_7_5 + -n7_7_6 + -n7_7_7 + -n7_7_8 + -n7_7_9 + -n7_4_9 + -n7_4_8 + -n7_4_7 + -n7_4_6... (shortened)
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: -a1 > -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (SstopOK_6 + SstopOK_7 + SstopOK_9 + SstopOK_8 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_2 + SstopOK_1 + SstopOK_0 + SstopOK_10 + -a2 <= 0 OR -n7_5_9 + -n7_5_8 + -n7_5_7 + -n7_5_6 + -n7_5_5 + -n7_5_4 + -n7_5_3 + -n7_5_2 + -n7_5_1 + -n7_5_0 + -n7_9_10 + -n7_7_1 + -n7_7_2 + -n7_7_3 + -n7_7_4 + -n7_7_5 + -n7_7_6 + -n7_7_7 + -n7_7_8 + -n7_7_9 + -n7_4_9 + -n7_4_8 + -n7_4_7 + -n7_4_6 + -n7_4_5 + -n7... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (malicious_reservoir + -AstopAbort <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U malicious_reservoir + -AstopAbort <= 0)
lola: processed formula length: 48
lola: 100966 rewrites
lola: formula mentions 2 of 550 places; total mentions: 2
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (-Astart + CstopAbort > 0))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U -Astart + CstopAbort > 0))))
lola: processed formula length: 50
lola: 100967 rewrites
lola: formula mentions 2 of 550 places; total mentions: 2
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 2 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((AX (-n2_9 + -n2_8 + -n2_7 + -n2_6 + -n2_5 + -n2_4 + -n2_3 + -n2_2 + -n2_1 + -n2_0 + -n2_10 + s6_10 + s6_9 + s6_8 + s6_7 + s6_6 + s6_5 + s6_4 + s6_3 + s6_2 + s6_1 + s6_0 <= 0) OR EG (Cstart_9 + Cstart_8 + Cstart_7 + Cstart_6 + Cstart_5 + Cstart_4 + Cstart_3 + Cstart_2 + Cstart_1 + Cstart_0 + Cstart_10 + -a1 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((AX(-n2_9 + -n2_8 + -n2_7 + -n2_6 + -n2_5 + -n2_4 + -n2_3 + -n2_2 + -n2_1 + -n2_0 + -n2_10 + s6_10 + s6_9 + s6_8 + s6_7 + s6_6 + s6_5 + s6_4 + s6_3 + s6_2 + s6_1 + s6_0 <= 0) OR !(A(TRUE U !(Cstart_9 + Cstart_8 + Cstart_7 + Cstart_6 + Cstart_5 + Cstart_4 + Cstart_3 + Cstart_2 + Cstart_1 + Cstart_0 + Cstart_10 + -a1 <= 0)))))))
lola: processed formula length: 341
lola: 100968 rewrites
lola: formula mentions 34 of 550 places; total mentions: 34
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 3 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(((-SstopOK_6 + -SstopOK_7 + -SstopOK_9 + -SstopOK_8 + -SstopOK_5 + -SstopOK_4 + -SstopOK_3 + -SstopOK_2 + -SstopOK_1 + -SstopOK_0 + -SstopOK_10 <= -3 AND -s5_10 + -s5_9 + -s5_8 + -s5_7 + -s5_6 + -s5_5 + -s5_4 + -s5_3 + -s5_2 + -s5_1 + -s5_0 <= -1) OR (SstopOK_6 + SstopOK_7 + SstopOK_9 + SstopOK_8 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_2 + SstopOK_1 + SstopOK_0 + -AstopOK + SstopOK_10 <= 0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((-SstopOK_6 + -SstopOK_7 + -SstopOK_9 + -SstopOK_8 + -SstopOK_5 + -SstopOK_4 + -SstopOK_3 + -SstopOK_2 + -SstopOK_1 + -SstopOK_0 + -SstopOK_10 <= -3 AND -s5_10 + -s5_9 + -s5_8 + -s5_7 + -s5_6 + -s5_5 + -s5_4 + -s5_3 + -s5_2 + -s5_1 + -s5_0 <= -1) OR (SstopOK_6 + SstopOK_7 + SstopOK_9 + SstopOK_8 + SstopOK_5 + SstopOK_4 + SstopOK_3 + SstopOK_2 + SstopOK_1 + SstopOK_0 + -AstopOK + SstopOK_10 <= 0... (shortened)
lola: processed formula length: 1964
lola: 100966 rewrites
lola: formula mentions 190 of 550 places; total mentions: 201
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 4 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((CstopAbort + -AstopAbort > 0 AND (-s6_10 + -s6_9 + -s6_8 + -s6_7 + -s6_6 + -s6_5 + -s6_4 + -s6_3 + -s6_2 + -s6_1 + -s6_0 > -1 AND (-n3_10 + -n3_0 + -n3_1 + -n3_2 + -n3_3 + -n3_4 + -n3_5 + -n3_6 + -n3_7 + -n3_8 + -n3_9 > -2 AND CstopOK_10 + -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_0_1 + -n8_0_2 + -n8_0_3 + -n8_0_4 + -n8_0... (shortened)
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 700 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: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AG ((-n7_5_9 + -n7_5_8 + -n7_5_7 + -n7_5_6 + -n7_5_5 + -n7_5_4 + -n7_5_3 + -n7_5_2 + -n7_5_1 + -n7_5_0 + -n7_9_10 + -n7_7_1 + -n7_7_2 + -n7_7_3 + -n7_7_4 + -n7_7_5 + -n7_7_6 + -n7_7_7 + -n7_7_8 + -n7_7_9 + -n7_4_9 + -n7_4_8 + -n7_4_7 + -n7_4_6 + -n7_4_5 + -n7_4_4 + -n7_4_3 + -n7_4_2 + -n7_4_1 + -n7_4_0 + -n7_8_1 + -n7_8_2 + -n7_8_3 + -n7_8_4 + -n7_8_5 + -n7_8_6 + -n7_8_7 + -n7_8_8 + -n7_8_9 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(E(TRUE U !((-n7_5_9 + -n7_5_8 + -n7_5_7 + -n7_5_6 + -n7_5_5 + -n7_5_4 + -n7_5_3 + -n7_5_2 + -n7_5_1 + -n7_5_0 + -n7_9_10 + -n7_7_1 + -n7_7_2 + -n7_7_3 + -n7_7_4 + -n7_7_5 + -n7_7_6 + -n7_7_7 + -n7_7_8 + -n7_7_9 + -n7_4_9 + -n7_4_8 + -n7_4_7 + -n7_4_6 + -n7_4_5 + -n7_4_4 + -n7_4_3 + -n7_4_2 + -n7_4_1 + -n7_4_0 + -n7_8_1 + -n7_8_2 + -n7_8_3 + -n7_8_4 + -n7_8_5 + -n7_8_6 + -n7_8_7 + -n7_8_... (shortened)
lola: processed formula length: 1522
lola: 100967 rewrites
lola: formula mentions 133 of 550 places; total mentions: 144
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 6 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-SstopAbort <= -2 AND n7_5_9 + n7_5_8 + n7_5_7 + n7_5_6 + n7_5_5 + n7_5_4 + n7_5_3 + n7_5_2 + n7_5_1 + n7_5_0 + n7_9_10 + n7_7_1 + n7_7_2 + n7_7_3 + n7_7_4 + n7_7_5 + n7_7_6 + n7_7_7 + n7_7_8 + n7_7_9 + n7_4_9 + n7_4_8 + n7_4_7 + n7_4_6 + n7_4_5 + n7_4_4 + n7_4_3 + n7_4_2 + n7_4_1 + n7_4_0 + n7_8_1 + n7_8_2 + n7_8_3 + n7_8_4 + n7_8_5 + n7_8_6 + n7_8_7 + n7_8_8 + n7_8_9 + n7_3_9 + n7_3_8 + n7_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-SstopAbort <= -2 AND n7_5_9 + n7_5_8 + n7_5_7 + n7_5_6 + n7_5_5 + n7_5_4 + n7_5_3 + n7_5_2 + n7_5_1 + n7_5_0 + n7_9_10 + n7_7_1 + n7_7_2 + n7_7_3 + n7_7_4 + n7_7_5 + n7_7_6 + n7_7_7 + n7_7_8 + n7_7_9 + n7_4_9 + n7_4_8 + n7_4_7 + n7_4_6 + n7_4_5 + n7_4_4 + n7_4_3 + n7_4_2 + n7_4_1 + n7_4_0 + n7_8_1 + n7_8_2 + n7_8_3 + n7_8_4 + n7_8_5 + n7_8_6 + n7_8_7 + n7_8_8 + n7_8_9 + n7_3_9 + n7_3_8 ... (shortened)
lola: processed formula length: 1235
lola: 100966 rewrites
lola: formula mentions 133 of 550 places; total mentions: 133
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 7 will run for 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((EF (-s2_10 + -s2_0 + -s2_1 + a5 + -s2_2 + -s2_3 + -s2_4 + -s2_5 + -s2_6 + -s2_7 + -s2_8 + -s2_9 <= 0) OR AG (-s6_10 + -s6_9 + -s6_8 + -s6_7 + -s6_6 + -s6_5 + -s6_4 + -s6_3 + -s6_2 + -s6_1 + -s6_0 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((E(TRUE U -s2_10 + -s2_0 + -s2_1 + a5 + -s2_2 + -s2_3 + -s2_4 + -s2_5 + -s2_6 + -s2_7 + -s2_8 + -s2_9 <= 0) OR !(E(TRUE U !(-s6_10 + -s6_9 + -s6_8 + -s6_7 + -s6_6 + -s6_5 + -s6_4 + -s6_3 + -s6_2 + -s6_1 + -s6_0 <= -2)))))))
lola: processed formula length: 236
lola: 100968 rewrites
lola: formula mentions 23 of 550 places; total mentions: 23
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-n3_10 + -n3_0 + -n3_1 + -n3_2 + -n3_3 + -n3_4 + -n3_5 + -n3_6 + -n3_7 + -n3_8 + -n3_9 > -2 OR -a4 > -2) U EG (-n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + -n4_10 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-n3_10 + -n3_0 + -n3_1 + -n3_2 + -n3_3 + -n3_4 + -n3_5 + -n3_6 + -n3_7 + -n3_8 + -n3_9 > -2 OR -a4 > -2) U !(A(TRUE U !(-n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + -n4_10 <= -2))))
lola: processed formula length: 219
lola: 100967 rewrites
lola: formula mentions 23 of 550 places; total mentions: 23
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 9 will run for 400 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG (-n9_2_10 + -n9_9_9 + -n9_9_8 + -n9_9_7 + -n9_9_6 + -n9_9_5 + -n9_9_4 + -n9_9_3 + -n9_9_2 + -n9_9_1 + -n9_9_0 + -n9_8_9 + -n9_8_8 + -n9_8_7 + -n9_8_6 + -n9_8_5 + -n9_8_4 + -n9_8_3 + -n9_8_2 + -n9_8_1 + -n9_8_0 + -n9_8_10 + -n9_7_9 + -n9_7_8 + -n9_7_7 + -n9_7_6 + -n9_7_5 + -n9_7_4 + -n9_7_3 + -n9_7_2 + -n9_7_1 + -n9_7_0 + -n9_3_10 + -n9_6_9 + -n9_6_8 + -n9_6_7 + -n9_6_6 + -n9_6_5 + -n9_6_4 + -n... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 400 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-n9_2_10 + -n9_9_9 + -n9_9_8 + -n9_9_7 + -n9_9_6 + -n9_9_5 + -n9_9_4 + -n9_9_3 + -n9_9_2 + -n9_9_1 + -n9_9_0 + -n9_8_9 + -n9_8_8 + -n9_8_7 + -n9_8_6 + -n9_8_5 + -n9_8_4 + -n9_8_3 + -n9_8_2 + -n9_8_1 + -n9_8_0 + -n9_8_10 + -n9_7_9 + -n9_7_8 + -n9_7_7 + -n9_7_6 + -n9_7_5 + -n9_7_4 + -n9_7_3 + -n9_7_2 + -n9_7_1 + -n9_7_0 + -n9_3_10 + -n9_6_9 + -n9_6_8 + -n9_6_7 + -n9_6_6 + -n9_6_5 + -n9_6_4 + -n9... (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 700 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (CstopOK_10 + CstopOK_9 + CstopOK_8 + CstopOK_7 + CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0 + -a3 <= 0 AND EF ((a2 + -Sstart_0 + -Sstart_1 + -Sstart_2 + -Sstart_3 + -Sstart_4 + -Sstart_5 + -Sstart_6 + -Sstart_7 + -Sstart_8 + -Sstart_9 + -Sstart_10 <= 0 AND -s6_10 + -s6_9 + -s6_8 + -s6_7 + -s6_6 + -s6_5 + -s6_4 + -s6_3 + -s6_2 + -s6_1 + -s6_0 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 467 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: CstopOK_10 + CstopOK_9 + CstopOK_8 + CstopOK_7 + CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0 + -a3 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((a2 + -Sstart_0 + -Sstart_1 + -Sstart_2 + -Sstart_3 + -Sstart_4 + -Sstart_5 + -Sstart_6 + -Sstart_7 + -Sstart_8 + -Sstart_9 + -Sstart_10 <= 0 AND -s6_10 + -s6_9 + -s6_8 + -s6_7 + -s6_6 + -s6_5 + -s6_4 + -s6_3 + -s6_2 + -s6_1 + -s6_0 <= -2))
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 700 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 11 will run for 561 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((EG (s3_9 + -AstopOK + s3_10 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 <= 0) OR -s3_9 + -s3_10 + AstopAbort + -s3_0 + -s3_1 + -s3_2 + -s3_3 + -s3_4 + -s3_5 + -s3_6 + -s3_7 + -s3_8 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((!(A(TRUE U !(s3_9 + -AstopOK + s3_10 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 <= 0))) OR -s3_9 + -s3_10 + AstopAbort + -s3_0 + -s3_1 + -s3_2 + -s3_3 + -s3_4 + -s3_5 + -s3_6 + -s3_7 + -s3_8 > 0))))
lola: processed formula length: 232
lola: 100967 rewrites
lola: formula mentions 13 of 550 places; total mentions: 24
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 12 will run for 701 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-n9_2_10 + -n9_9_9 + -n9_9_8 + -n9_9_7 + -n9_9_6 + -n9_9_5 + -n9_9_4 + -n9_9_3 + -n9_9_2 + -n9_9_1 + -n9_9_0 + -n9_8_9 + -n9_8_8 + -n9_8_7 + -n9_8_6 + -n9_8_5 + -n9_8_4 + -n9_8_3 + -n9_8_2 + -n9_8_1 + -n9_8_0 + -n9_8_10 + -n9_7_9 + -n9_7_8 + -n9_7_7 + -n9_7_6 + -n9_7_5 + -n9_7_4 + -n9_7_3 + -n9_7_2 + -n9_7_1 + -n9_7_0 + -n9_3_10 + -n9_6_9 + -n9_6_8 + -n9_6_7 + -n9_6_6 + -n9_6_5 + -n9_6_4 + -n... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-n9_2_10 + -n9_9_9 + -n9_9_8 + -n9_9_7 + -n9_9_6 + -n9_9_5 + -n9_9_4 + -n9_9_3 + -n9_9_2 + -n9_9_1 + -n9_9_0 + -n9_8_9 + -n9_8_8 + -n9_8_7 + -n9_8_6 + -n9_8_5 + -n9_8_4 + -n9_8_3 + -n9_8_2 + -n9_8_1 + -n9_8_0 + -n9_8_10 + -n9_7_9 + -n9_7_8 + -n9_7_7 + -n9_7_6 + -n9_7_5 + -n9_7_4 + -n9_7_3 + -n9_7_2 + -n9_7_1 + -n9_7_0 + -n9_3_10 + -n9_6_9 + -n9_6_8 + -n9_6_7 + -n9_6_6 + -n9_6_5 + -n9_6_4... (shortened)
lola: processed formula length: 1571
lola: 100966 rewrites
lola: formula mentions 157 of 550 places; total mentions: 157
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 935 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-Sstart_0 + -Sstart_1 + -Sstart_2 + -Sstart_3 + -Sstart_4 + -Sstart_5 + -Sstart_6 + -Sstart_7 + -Sstart_8 + -Sstart_9 + -Sstart_10 <= -1 U ((-a2 <= -1 AND s4_10 + -Sstart_0 + -Sstart_1 + -Sstart_2 + -Sstart_3 + -Sstart_4 + -Sstart_5 + -Sstart_6 + -Sstart_7 + -Sstart_8 + -Sstart_9 + -Sstart_10 + s4_9 + s4_8 + s4_7 + s4_6 + s4_5 + s4_4 + s4_3 + s4_2 + s4_1 + s4_0 <= 0) OR -CstopAbort <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-Sstart_0 + -Sstart_1 + -Sstart_2 + -Sstart_3 + -Sstart_4 + -Sstart_5 + -Sstart_6 + -Sstart_7 + -Sstart_8 + -Sstart_9 + -Sstart_10 <= -1 U ((-a2 <= -1 AND s4_10 + -Sstart_0 + -Sstart_1 + -Sstart_2 + -Sstart_3 + -Sstart_4 + -Sstart_5 + -Sstart_6 + -Sstart_7 + -Sstart_8 + -Sstart_9 + -Sstart_10 + s4_9 + s4_8 + s4_7 + s4_6 + s4_5 + s4_4 + s4_3 + s4_2 + s4_1 + s4_0 <= 0) OR -CstopAbort <= -2))
lola: processed formula length: 394
lola: 100966 rewrites
lola: formula mentions 24 of 550 places; total mentions: 35
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 14 will run for 1402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (s3_9 + -a2 + s3_10 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 <= 0 AND AF ((-SstopOK_6 + -SstopOK_7 + -SstopOK_9 + -SstopOK_8 + -SstopOK_5 + -SstopOK_4 + -SstopOK_3 + -SstopOK_2 + -SstopOK_1 + -SstopOK_0 + -SstopOK_10 <= -2 AND (-n6_10 + -n6_9 + -n6_8 + -n6_7 + -n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 <= -2 AND (-n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1402 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: s3_9 + -a2 + s3_10 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 2805 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-SstopOK_6 + -SstopOK_7 + -SstopOK_9 + -SstopOK_8 + -SstopOK_5 + -SstopOK_4 + -SstopOK_3 + -SstopOK_2 + -SstopOK_1 + -SstopOK_0 + -SstopOK_10 <= -2 AND (-n6_10 + -n6_9 + -n6_8 + -n6_7 + -n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 <= -2 AND (-n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + n6_10 + n6_9 + n6_8 + n6_7 + n6_6 + n6_5 + n6_4 + n6_3 + n6_2 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-SstopOK_6 + -SstopOK_7 + -SstopOK_9 + -SstopOK_8 + -SstopOK_5 + -SstopOK_4 + -SstopOK_3 + -SstopOK_2 + -SstopOK_1 + -SstopOK_0 + -SstopOK_10 <= -2 AND (-n6_10 + -n6_9 + -n6_8 + -n6_7 + -n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 <= -2 AND (-n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + n6_10 + n6_9 + n6_8 + n6_7 + n6_6 + n6_5 + n6_4 + n6_3 + n6... (shortened)
lola: processed formula length: 586
lola: 100966 rewrites
lola: formula mentions 33 of 550 places; total mentions: 55
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 15 will run for 2805 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((AX (-SstopAbort + AstopAbort <= 0) AND (-AstopOK > -3 AND (-c1_9 + -c1_10 + -c1_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 <= -2 OR c1_9 + c1_10 + -AstopOK + c1_0 + c1_1 + c1_2 + c1_3 + c1_4 + c1_5 + c1_6 + c1_7 + c1_8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((AX(-SstopAbort + AstopAbort <= 0) AND (-AstopOK > -3 AND (-c1_9 + -c1_10 + -c1_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 <= -2 OR c1_9 + c1_10 + -AstopOK + c1_0 + c1_1 + c1_2 + c1_3 + c1_4 + c1_5 + c1_6 + c1_7 + c1_8 <= 0))))))
lola: processed formula length: 265
lola: 100967 rewrites
lola: formula mentions 14 of 550 places; total mentions: 26
lola: closed formula file QuasiCertifProtocol-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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: RESULT
lola: summary: unknown unknown yes no unknown no no yes yes no yes yes no no no yes
lola: ========================================

BK_STOP 1463699500007

--------------------
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-10"
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-10.tgz
mv QuasiCertifProtocol-PT-10 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-10, 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-146369140300093"
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 ;