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

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

=== Now, execution of the tool begins

BK_START 1463698621588

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ QuasiCertifProtocol-PT-06
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-06-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: 386/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 270 places, 116 transitions, 115 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 151 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: read: (EG (EF (1 <= n2_6 + n2_5 + n2_4 + n2_3 + n2_2 + n2_1 + n2_0)) OR E(!(1 <= n3_3 + n3_2 + n3_1 + n3_0 + n3_6 + n3_4 + n3_5) U 3 <= n8_2_0 + n8_1_0 + n8_0_0 + n8_6_1 + n8_0_2 + n8_4_1 + n8_5_1 + n8_3_2 + n8_4_2 + n8_1_2 + n8_2_2 + n8_5_0 + n8_6_0 + n8_3_0 + n8_4_0 + n8_2_1 + n8_3_1 + n8_0_1 + n8_1_1 + n8_4_4 + n8_3_4 + n8_6_4 + n8_5_4 + n8_0_4 + n8_6_3 + n8_2_4 + n8_1_4 + n8_3_3 + n8_2_3 + n8_5_3 + ... (shortened)
lola: formula length: 10082
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (EF (-n2_6 + -n2_5 + -n2_4 + -n2_3 + -n2_2 + -n2_1 + -n2_0 <= -1)) OR E(-n3_0 + -n3_1 + -n3_2 + -n3_3 + -n3_4 + -n3_5 + -n3_6 > -1 U -n8_0_1 + -n8_0_2 + -n8_0_3 + -n8_0_4 + -n8_0_5 + -n8_0_6 + -n8_1_1 + -n8_1_2 + -n8_1_3 + -n8_1_4 + -n8_1_5 + -n8_1_6 + -n8_2_1 + -n8_2_2 + -n8_2_3 + -n8_2_4 + -n8_2_5 + -n8_2_6 + -n8_3_1 + -n8_3_2 + -n8_3_3 + -n8_3_4 + -n8_3_5 + -n8_3_6 + -n8_4_1 + -n8_4_2 + -n8... (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: EG (EF (-n2_6 + -n2_5 + -n2_4 + -n2_3 + -n2_2 + -n2_1 + -n2_0 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(TRUE U -n2_6 + -n2_5 + -n2_4 + -n2_3 + -n2_2 + -n2_1 + -n2_0 <= -1))))
lola: processed formula length: 85
lola: 32772 rewrites
lola: formula mentions 7 of 270 places; total mentions: 7
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AG (-s5_6 + -s5_5 + -s5_4 + -s5_3 + -s5_2 + -s5_1 + -s5_0 > -2) OR (-SstopOK_6 + -SstopOK_5 + -SstopOK_4 + -SstopOK_3 + -SstopOK_2 + -SstopOK_1 + -SstopOK_0 <= -2 AND AX (-n1_0 + -n1_1 + -n1_2 + -n1_3 + -n1_4 + -n1_5 + -n1_6 <= -2))) AND -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + AstopOK + -n4_0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-s5_6 + -s5_5 + -s5_4 + -s5_3 + -s5_2 + -s5_1 + -s5_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 460 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -SstopOK_6 + -SstopOK_5 + -SstopOK_4 + -SstopOK_3 + -SstopOK_2 + -SstopOK_1 + -SstopOK_0 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AX (-n8_0_1 + -n8_0_2 + -n8_0_3 + -n8_0_4 + -n8_0_5 + -n8_0_6 + -n8_1_1 + -n8_1_2 + -n8_1_3 + -n8_1_4 + -n8_1_5 + -n8_1_6 + -n8_2_1 + -n8_2_2 + -n8_2_3 + -n8_2_4 + -n8_2_5 + -n8_2_6 + -n8_3_1 + -n8_3_2 + -n8_3_3 + -n8_3_4 + -n8_3_5 + -n8_3_6 + -n8_4_1 + -n8_4_2 + -n8_4_3 + -n8_4_4 + -n8_4_5 + -n8_4_6 + -n8_5_1 + -n8_5_2 + -n8_5_3 + -n8_5_4 + -n8_5_5 + -n8_5_6 + -n8_6_1 + -n8_6_2 + -n8_6_3 + -n... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(-n8_0_1 + -n8_0_2 + -n8_0_3 + -n8_0_4 + -n8_0_5 + -n8_0_6 + -n8_1_1 + -n8_1_2 + -n8_1_3 + -n8_1_4 + -n8_1_5 + -n8_1_6 + -n8_2_1 + -n8_2_2 + -n8_2_3 + -n8_2_4 + -n8_2_5 + -n8_2_6 + -n8_3_1 + -n8_3_2 + -n8_3_3 + -n8_3_4 + -n8_3_5 + -n8_3_6 + -n8_4_1 + -n8_4_2 + -n8_4_3 + -n8_4_4 + -n8_4_5 + -n8_4_6 + -n8_5_1 + -n8_5_2 + -n8_5_3 + -n8_5_4 + -n8_5_5 + -n8_5_6 + -n8_6_1 + -n8_6_2 + -n8_6_3 ... (shortened)
lola: processed formula length: 589
lola: 32772 rewrites
lola: formula mentions 56 of 270 places; total mentions: 56
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 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 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (A(-n8_0_1 + -n8_0_2 + -n8_0_3 + -n8_0_4 + -n8_0_5 + -n8_0_6 + -n8_1_1 + -n8_1_2 + -n8_1_3 + -n8_1_4 + -n8_1_5 + -n8_1_6 + -n8_2_1 + -n8_2_2 + -n8_2_3 + -n8_2_4 + -n8_2_5 + -n8_2_6 + -n8_3_1 + -n8_3_2 + -n8_3_3 + -n8_3_4 + -n8_3_5 + -n8_3_6 + -n8_4_1 + -n8_4_2 + -n8_4_3 + -n8_4_4 + -n8_4_5 + -n8_4_6 + -n8_5_1 + -n8_5_2 + -n8_5_3 + -n8_5_4 + -n8_5_5 + -n8_5_6 + -n8_6_1 + -n8_6_2 + -n8_6_3 + -n8_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A(-n8_0_1 + -n8_0_2 + -n8_0_3 + -n8_0_4 + -n8_0_5 + -n8_0_6 + -n8_1_1 + -n8_1_2 + -n8_1_3 + -n8_1_4 + -n8_1_5 + -n8_1_6 + -n8_2_1 + -n8_2_2 + -n8_2_3 + -n8_2_4 + -n8_2_5 + -n8_2_6 + -n8_3_1 + -n8_3_2 + -n8_3_3 + -n8_3_4 + -n8_3_5 + -n8_3_6 + -n8_4_1 + -n8_4_2 + -n8_4_3 + -n8_4_4 + -n8_4_5 + -n8_4_6 + -n8_5_1 + -n8_5_2 + -n8_5_3 + -n8_5_4 + -n8_5_5 + -n8_5_6 + -n8_6_1 + -n8_6_2 + -n8_6_3 +... (shortened)
lola: processed formula length: 1002
lola: 32772 rewrites
lola: formula mentions 98 of 270 places; total mentions: 98
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 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 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (EG ((-n9_6_6 + -n9_6_5 + -n9_6_4 + -n9_6_3 + -n9_6_2 + -n9_6_1 + -n9_6_0 + -n9_5_6 + -n9_5_5 + -n9_5_4 + -n9_5_3 + -n9_5_2 + -n9_5_1 + -n9_5_0 + -n9_1_0 + -n9_1_1 + -n9_4_6 + -n9_4_5 + -n9_4_4 + -n9_4_3 + -n9_4_2 + -n9_4_1 + -n9_4_0 + -n9_3_6 + -n9_3_5 + -n9_3_4 + -n9_3_3 + -n9_3_2 + -n9_3_1 + -n9_3_0 + -n9_1_2 + -n9_2_6 + -n9_2_5 + -n9_2_4 + -n9_2_3 + -n9_2_2 + -n9_2_1 + -n9_2_0 + -n9_1_6 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U !(A(TRUE U !((-n9_6_6 + -n9_6_5 + -n9_6_4 + -n9_6_3 + -n9_6_2 + -n9_6_1 + -n9_6_0 + -n9_5_6 + -n9_5_5 + -n9_5_4 + -n9_5_3 + -n9_5_2 + -n9_5_1 + -n9_5_0 + -n9_1_0 + -n9_1_1 + -n9_4_6 + -n9_4_5 + -n9_4_4 + -n9_4_3 + -n9_4_2 + -n9_4_1 + -n9_4_0 + -n9_3_6 + -n9_3_5 + -n9_3_4 + -n9_3_3 + -n9_3_2 + -n9_3_1 + -n9_3_0 + -n9_1_2 + -n9_2_6 + -n9_2_5 + -n9_2_4 + -n9_2_3 + -n9_2_2 + -n9_2_1 + -n9_2_0... (shortened)
lola: processed formula length: 627
lola: 32772 rewrites
lola: formula mentions 57 of 270 places; total mentions: 57
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 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 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AX ((-AstopAbort > -1 AND -n9_6_6 + -n9_6_5 + -n9_6_4 + -n9_6_3 + -n9_6_2 + -n9_6_1 + -n9_6_0 + -n9_5_6 + -n9_5_5 + -n9_5_4 + -n9_5_3 + -n9_5_2 + -n9_5_1 + -n9_5_0 + -n9_1_0 + -n9_1_1 + -n9_4_6 + -n9_4_5 + -n9_4_4 + -n9_4_3 + -n9_4_2 + -n9_4_1 + -n9_4_0 + -n9_3_6 + -n9_3_5 + -n9_3_4 + -n9_3_3 + -n9_3_2 + -n9_3_1 + -n9_3_0 + -n9_1_2 + -n9_2_6 + -n9_2_5 + -n9_2_4 + -n9_2_3 + -n9_2_2 + -n9_2_1 + -n9... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((-AstopAbort > -1 AND -n9_6_6 + -n9_6_5 + -n9_6_4 + -n9_6_3 + -n9_6_2 + -n9_6_1 + -n9_6_0 + -n9_5_6 + -n9_5_5 + -n9_5_4 + -n9_5_3 + -n9_5_2 + -n9_5_1 + -n9_5_0 + -n9_1_0 + -n9_1_1 + -n9_4_6 + -n9_4_5 + -n9_4_4 + -n9_4_3 + -n9_4_2 + -n9_4_1 + -n9_4_0 + -n9_3_6 + -n9_3_5 + -n9_3_4 + -n9_3_3 + -n9_3_2 + -n9_3_1 + -n9_3_0 + -n9_1_2 + -n9_2_6 + -n9_2_5 + -n9_2_4 + -n9_2_3 + -n9_2_2 + -n9_2_1 + -n9_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((-AstopAbort > -1 AND -n9_6_6 + -n9_6_5 + -n9_6_4 + -n9_6_3 + -n9_6_2 + -n9_6_1 + -n9_6_0 + -n9_5_6 + -n9_5_5 + -n9_5_4 + -n9_5_3 + -n9_5_2 + -n9_5_1 + -n9_5_0 + -n9_1_0 + -n9_1_1 + -n9_4_6 + -n9_4_5 + -n9_4_4 + -n9_4_3 + -n9_4_2 + -n9_4_1 + -n9_4_0 + -n9_3_6 + -n9_3_5 + -n9_3_4 + -n9_3_3 + -n9_3_2 + -n9_3_1 + -n9_3_0 + -n9_1_2 + -n9_2_6 + -n9_2_5 + -n9_2_4 + -n9_2_3 + -n9_2_2 + -n9_2_1 + -n9_2... (shortened)
lola: processed formula length: 567
lola: 32771 rewrites
lola: formula mentions 57 of 270 places; total mentions: 57
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (((-a4 <= -3 AND n2_6 + n2_5 + n2_4 + n2_3 + n2_2 + n2_1 + -CstopAbort + n2_0 <= 0) OR -n9_6_6 + -n9_6_5 + -n9_6_4 + -n9_6_3 + -n9_6_2 + -n9_6_1 + -n9_6_0 + -n9_5_6 + -n9_5_5 + -n9_5_4 + -n9_5_3 + -n9_5_2 + -n9_5_1 + -n9_5_0 + -n9_1_0 + -n9_1_1 + -n9_4_6 + -n9_4_5 + -n9_4_4 + -n9_4_3 + -n9_4_2 + -n9_4_1 + -n9_4_0 + -n9_3_6 + -n9_3_5 + -n9_3_4 + -n9_3_3 + -n9_3_2 + -n9_3_1 + -n9_3_0 + -n9_1_2 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(((-a4 <= -3 AND n2_6 + n2_5 + n2_4 + n2_3 + n2_2 + n2_1 + -CstopAbort + n2_0 <= 0) OR -n9_6_6 + -n9_6_5 + -n9_6_4 + -n9_6_3 + -n9_6_2 + -n9_6_1 + -n9_6_0 + -n9_5_6 + -n9_5_5 + -n9_5_4 + -n9_5_3 + -n9_5_2 + -n9_5_1 + -n9_5_0 + -n9_1_0 + -n9_1_1 + -n9_4_6 + -n9_4_5 + -n9_4_4 + -n9_4_3 + -n9_4_2 + -n9_4_1 + -n9_4_0 + -n9_3_6 + -n9_3_5 + -n9_3_4 + -n9_3_3 + -n9_3_2 + -n9_3_1 + -n9_3_0 + -... (shortened)
lola: processed formula length: 595
lola: 32771 rewrites
lola: formula mentions 58 of 270 places; total mentions: 58
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((AF (SstopAbort + -a4 > 0) AND (-s6_6 + -s6_5 + -s6_4 + -s6_3 + -s6_2 + -s6_1 + -s6_0 > -1 AND (-AstopOK > -2 AND AG (-Cstart_6 + -Cstart_5 + -Cstart_4 + -Cstart_3 + -Cstart_2 + -Cstart_1 + -Cstart_0 + malicious_reservoir <= 0)))) OR (EG ((s3_6 + -SstopOK_6 + -SstopOK_5 + -SstopOK_4 + -SstopOK_3 + -SstopOK_2 + -SstopOK_1 + -SstopOK_0 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 <= 0 OR -n6_6 + -n6_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (SstopAbort + -a4 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U SstopAbort + -a4 > 0)
lola: processed formula length: 30
lola: 32771 rewrites
lola: formula mentions 2 of 270 places; total mentions: 2
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 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 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((s3_6 + -SstopOK_6 + -SstopOK_5 + -SstopOK_4 + -SstopOK_3 + -SstopOK_2 + -SstopOK_1 + -SstopOK_0 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 <= 0 OR -n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((s3_6 + -SstopOK_6 + -SstopOK_5 + -SstopOK_4 + -SstopOK_3 + -SstopOK_2 + -SstopOK_1 + -SstopOK_0 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 <= 0 OR -n6_6 + -n6_5 + -n6_4 + -n6_3 + -n6_2 + -n6_1 + -n6_0 <= -2))))
lola: processed formula length: 223
lola: 32771 rewrites
lola: formula mentions 21 of 270 places; total mentions: 21
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 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 8 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-n7_5_6 + -n7_5_5 + -n7_5_4 + -n7_5_3 + -n7_5_2 + -n7_5_1 + -n7_4_6 + -n7_4_5 + -n7_4_4 + -n7_4_3 + -n7_4_2 + -n7_4_1 + -n7_3_6 + -n7_3_5 + -n7_3_4 + -n7_3_3 + -n7_3_2 + -n7_3_1 + -n7_2_6 + -n7_2_5 + -n7_2_4 + -n7_2_3 + -n7_2_2 + -n7_2_1 + -n7_1_6 + -n7_1_5 + -n7_1_4 + -n7_1_3 + -n7_1_2 + -n7_1_1 + -n7_0_6 + -n7_0_5 + -n7_0_4 + -n7_0_3 + -n7_0_2 + -n7_0_1 + -n7_0_0 + -n7_1_0 + -n7_2_0 + -n7_3_0 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((-n9_6_6 + -n9_6_5 + -n9_6_4 + -n9_6_3 + -n9_6_2 + -n9_6_1 + -n9_6_0 + -n9_5_6 + -n9_5_5 + -n9_5_4 + -n9_5_3 + -n9_5_2 + -n9_5_1 + -n9_5_0 + -n9_1_0 + -n9_1_1 + -n9_4_6 + -n9_4_5 + -n9_4_4 + -n9_4_3 + -n9_4_2 + -n9_4_1 + -n9_4_0 + -n9_3_6 + -n9_3_5 + -n9_3_4 + -n9_3_3 + -n9_3_2 + -n9_3_1 + -n9_3_0 + -n9_1_2 + -n9_2_6 + -n9_2_5 + -n9_2_4 + -n9_2_3 + -n9_2_2 + -n9_2_1 + -n9_2_0 + -n9_1_6 + -n9_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-n9_6_6 + -n9_6_5 + -n9_6_4 + -n9_6_3 + -n9_6_2 + -n9_6_1 + -n9_6_0 + -n9_5_6 + -n9_5_5 + -n9_5_4 + -n9_5_3 + -n9_5_2 + -n9_5_1 + -n9_5_0 + -n9_1_0 + -n9_1_1 + -n9_4_6 + -n9_4_5 + -n9_4_4 + -n9_4_3 + -n9_4_2 + -n9_4_1 + -n9_4_0 + -n9_3_6 + -n9_3_5 + -n9_3_4 + -n9_3_3 + -n9_3_2 + -n9_3_1 + -n9_3_0 + -n9_1_2 + -n9_2_6 + -n9_2_5 + -n9_2_4 + -n9_2_3 + -n9_2_2 + -n9_2_1 + -n9_2_0 + -n9_1_6 + -n9_1... (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 460 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 unreachable.
lola: ========================================
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (-n8_0_1 + -n8_0_2 + -n8_0_3 + -n8_0_4 + -n8_0_5 + -n8_0_6 + -n8_1_1 + -n8_1_2 + -n8_1_3 + -n8_1_4 + -n8_1_5 + -n8_1_6 + -n8_2_1 + -n8_2_2 + -n8_2_3 + -n8_2_4 + -n8_2_5 + -n8_2_6 + -n8_3_1 + -n8_3_2 + -n8_3_3 + -n8_3_4 + -n8_3_5 + -n8_3_6 + -n8_4_1 + -n8_4_2 + -n8_4_3 + -n8_4_4 + -n8_4_5 + -n8_4_6 + -n8_5_1 + -n8_5_2 + -n8_5_3 + -n8_5_4 + -n8_5_5 + -n8_5_6 + -n8_6_1 + -n8_6_2 + -n8_6_3 + -n8_6_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(-n8_0_1 + -n8_0_2 + -n8_0_3 + -n8_0_4 + -n8_0_5 + -n8_0_6 + -n8_1_1 + -n8_1_2 + -n8_1_3 + -n8_1_4 + -n8_1_5 + -n8_1_6 + -n8_2_1 + -n8_2_2 + -n8_2_3 + -n8_2_4 + -n8_2_5 + -n8_2_6 + -n8_3_1 + -n8_3_2 + -n8_3_3 + -n8_3_4 + -n8_3_5 + -n8_3_6 + -n8_4_1 + -n8_4_2 + -n8_4_3 + -n8_4_4 + -n8_4_5 + -n8_4_6 + -n8_5_1 + -n8_5_2 + -n8_5_3 + -n8_5_4 + -n8_5_5 + -n8_5_6 + -n8_6_1 + -n8_6_2 + -n8_6_3 + -n8_6_4... (shortened)
lola: processed formula length: 544
lola: 32771 rewrites
lola: formula mentions 56 of 270 places; total mentions: 56
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 9 will run for 499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: s3_6 + -a1 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((n2_6 + n2_5 + n2_4 + n2_3 + n2_2 + n2_1 + n2_0 + -s4_6 + -s4_5 + -s4_4 + -s4_3 + -s4_2 + -s4_1 + -s4_0 > 0 AND -malicious_reservoir > -3) OR -n3_0 + -n3_1 + -n3_2 + -n3_3 + -n3_4 + -n3_5 + -n3_6 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 3 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: lola: SUBRESULT========================================

lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EX (-n8_0_1 + -n8_0_2 + -n8_0_3 + -n8_0_4 + -n8_0_5 + -n8_0_6 + -n8_1_1 + -n8_1_2 + -n8_1_3 + -n8_1_4 + -n8_1_5 + -n8_1_6 + -n8_2_1 + -n8_2_2 + -n8_2_3 + -n8_2_4 + -n8_2_5 + -n8_2_6 + -n8_3_1 + -n8_3_2 + -n8_3_3 + -n8_3_4 + -n8_3_5 + -n8_3_6 + -n8_4_1 + -n8_4_2 + -n8_4_3 + -n8_4_4 + -n8_4_5 + -n8_4_6 + -n8_5_1 + -n8_5_2 + -n8_5_3 + -n8_5_4 + -n8_5_5 + -n8_5_6 + -n8_6_1 + -n8_6_2 + -n8_6_3 + -n... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(-n8_0_1 + -n8_0_2 + -n8_0_3 + -n8_0_4 + -n8_0_5 + -n8_0_6 + -n8_1_1 + -n8_1_2 + -n8_1_3 + -n8_1_4 + -n8_1_5 + -n8_1_6 + -n8_2_1 + -n8_2_2 + -n8_2_3 + -n8_2_4 + -n8_2_5 + -n8_2_6 + -n8_3_1 + -n8_3_2 + -n8_3_3 + -n8_3_4 + -n8_3_5 + -n8_3_6 + -n8_4_1 + -n8_4_2 + -n8_4_3 + -n8_4_4 + -n8_4_5 + -n8_4_6 + -n8_5_1 + -n8_5_2 + -n8_5_3 + -n8_5_4 + -n8_5_5 + -n8_5_6 + -n8_6_1 + -n8_6_2 + -n8_6_3 ... (shortened)
lola: processed formula length: 554
lola: 32772 rewrites
lola: formula mentions 56 of 270 places; total mentions: 56
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 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 499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EX ((-CstopAbort + a3 <= 0 OR -n9_6_6 + -n9_6_5 + -n9_6_4 + -n9_6_3 + -n9_6_2 + -n9_6_1 + -n9_6_0 + -n9_5_6 + -n9_5_5 + -n9_5_4 + -n9_5_3 + -n9_5_2 + -n9_5_1 + -n9_5_0 + -n9_1_0 + -n9_1_1 + -n9_4_6 + -n9_4_5 + -n9_4_4 + -n9_4_3 + -n9_4_2 + -n9_4_1 + -n9_4_0 + -n9_3_6 + -n9_3_5 + -n9_3_4 + -n9_3_3 + -n9_3_2 + -n9_3_1 + -n9_3_0 + -n9_1_2 + -n9_2_6 + -n9_2_5 + -n9_2_4 + -n9_2_3 + -n9_2_2 + -n9_2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(EX((-CstopAbort + a3 <= 0 OR -n9_6_6 + -n9_6_5 + -n9_6_4 + -n9_6_3 + -n9_6_2 + -n9_6_1 + -n9_6_0 + -n9_5_6 + -n9_5_5 + -n9_5_4 + -n9_5_3 + -n9_5_2 + -n9_5_1 + -n9_5_0 + -n9_1_0 + -n9_1_1 + -n9_4_6 + -n9_4_5 + -n9_4_4 + -n9_4_3 + -n9_4_2 + -n9_4_1 + -n9_4_0 + -n9_3_6 + -n9_3_5 + -n9_3_4 + -n9_3_3 + -n9_3_2 + -n9_3_1 + -n9_3_0 + -n9_1_2 + -n9_2_6 + -n9_2_5 + -n9_2_4 + -n9_2_3 + -n9_2_2 ... (shortened)
lola: processed formula length: 588
lola: 32772 rewrites
lola: formula mentions 58 of 270 places; total mentions: 58
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 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 10 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(AG (-a1 + n6_6 + n6_5 + n6_4 + n6_3 + n6_2 + n6_1 + n6_0 <= 0) U ((n9_6_6 + n9_6_5 + n9_6_4 + n9_6_3 + n9_6_2 + n9_6_1 + n9_6_0 + n9_5_6 + n9_5_5 + n9_5_4 + n9_5_3 + n9_5_2 + n9_5_1 + n9_5_0 + n9_1_0 + n9_1_1 + n9_4_6 + n9_4_5 + n9_4_4 + n9_4_3 + n9_4_2 + n9_4_1 + n9_4_0 + n9_3_6 + n9_3_5 + n9_3_4 + n9_3_3 + n9_3_2 + n9_3_1 + n9_3_0 + n9_1_2 + n9_2_6 + n9_2_5 + n9_2_4 + n9_2_3 + n9_2_2 + n9_2_1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(!(E(TRUE U !(-a1 + n6_6 + n6_5 + n6_4 + n6_3 + n6_2 + n6_1 + n6_0 <= 0))) U ((n9_6_6 + n9_6_5 + n9_6_4 + n9_6_3 + n9_6_2 + n9_6_1 + n9_6_0 + n9_5_6 + n9_5_5 + n9_5_4 + n9_5_3 + n9_5_2 + n9_5_1 + n9_5_0 + n9_1_0 + n9_1_1 + n9_4_6 + n9_4_5 + n9_4_4 + n9_4_3 + n9_4_2 + n9_4_1 + n9_4_0 + n9_3_6 + n9_3_5 + n9_3_4 + n9_3_3 + n9_3_2 + n9_3_1 + n9_3_0 + n9_1_2 + n9_2_6 + n9_2_5 + n9_2_4 + n9_2_3 + n9_2_... (shortened)
lola: processed formula length: 677
lola: 32772 rewrites
lola: formula mentions 73 of 270 places; total mentions: 74
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 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 691 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-s5_6 + -s5_5 + -s5_4 + -s5_3 + -s5_2 + -s5_1 + -s5_0 > -1)
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 460 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 864 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (A(-malicious_reservoir + a4 <= 0 U -s6_6 + -s6_5 + -s6_4 + -s6_3 + -s6_2 + -s6_1 + -s6_0 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(-malicious_reservoir + a4 <= 0 U -s6_6 + -s6_5 + -s6_4 + -s6_3 + -s6_2 + -s6_1 + -s6_0 <= -2))
lola: processed formula length: 99
lola: 32772 rewrites
lola: formula mentions 9 of 270 places; total mentions: 9
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 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 1152 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (EG ((n2_6 + n2_5 + n2_4 + n2_3 + n2_2 + n2_1 + n2_0 + -s4_6 + -s4_5 + -s4_4 + -s4_3 + -s4_2 + -s4_1 + -s4_0 <= 0 AND s3_6 + -s6_6 + -s6_5 + -s6_4 + -s6_3 + -s6_2 + -s6_1 + -s6_0 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(!(A(TRUE U !((n2_6 + n2_5 + n2_4 + n2_3 + n2_2 + n2_1 + n2_0 + -s4_6 + -s4_5 + -s4_4 + -s4_3 + -s4_2 + -s4_1 + -s4_0 <= 0 AND s3_6 + -s6_6 + -s6_5 + -s6_4 + -s6_3 + -s6_2 + -s6_1 + -s6_0 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 <= 0)))))
lola: processed formula length: 241
lola: 32772 rewrites
lola: formula mentions 28 of 270 places; total mentions: 28
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 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 1729 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-a4 <= -1 OR (-Sstart_0 + -Sstart_1 + -Sstart_2 + -Sstart_3 + -Sstart_4 + -Sstart_5 + -Sstart_6 <= -2 AND ((-s6_6 + -s6_5 + -s6_4 + -s6_3 + -s6_2 + -s6_1 + -s6_0 > -3 OR -n5_6 + -n5_5 + -n5_4 + -n5_3 + -n5_2 + -n5_1 + a2 + -n5_0 > 0) AND EF ((-a1 <= -2 AND n8_0_1 + n8_0_2 + n8_0_3 + n8_0_4 + n8_0_5 + n8_0_6 + n8_1_1 + n8_1_2 + n8_1_3 + n8_1_4 + n8_1_5 + n8_1_6 + n8_2_1 + n8_2_2 + n8_2_3 + n8_2_4 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1729 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -a4 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Sstart_0 + -Sstart_1 + -Sstart_2 + -Sstart_3 + -Sstart_4 + -Sstart_5 + -Sstart_6 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-a1 <= -2 AND n8_0_1 + n8_0_2 + n8_0_3 + n8_0_4 + n8_0_5 + n8_0_6 + n8_1_1 + n8_1_2 + n8_1_3 + n8_1_4 + n8_1_5 + n8_1_6 + n8_2_1 + n8_2_2 + n8_2_3 + n8_2_4 + n8_2_5 + n8_2_6 + n8_3_1 + n8_3_2 + n8_3_3 + n8_3_4 + n8_3_5 + n8_3_6 + n8_4_1 + n8_4_2 + n8_4_3 + n8_4_4 + n8_4_5 + n8_4_6 + n8_5_1 + n8_5_2 + n8_5_3 + n8_5_4 + n8_5_5 + n8_5_6 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_... (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 460 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 unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (E(n5_6 + n5_5 + n5_4 + n5_3 + n5_2 + n5_1 + -a5 + n5_0 <= 0 U -n8_0_1 + -n8_0_2 + -n8_0_3 + -n8_0_4 + -n8_0_5 + -n8_0_6 + -n8_1_1 + -n8_1_2 + -n8_1_3 + -n8_1_4 + -n8_1_5 + -n8_1_6 + -n8_2_1 + -n8_2_2 + -n8_2_3 + -n8_2_4 + -n8_2_5 + -n8_2_6 + -n8_3_1 + -n8_3_2 + -n8_3_3 + -n8_3_4 + -n8_3_5 + -n8_3_6 + -n8_4_1 + -n8_4_2 + -n8_4_3 + -n8_4_4 + -n8_4_5 + -n8_4_6 + -n8_5_1 + -n8_5_2 + -n8_5_3 + -n8_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(n5_6 + n5_5 + n5_4 + n5_3 + n5_2 + n5_1 + -a5 + n5_0 <= 0 U -n8_0_1 + -n8_0_2 + -n8_0_3 + -n8_0_4 + -n8_0_5 + -n8_0_6 + -n8_1_1 + -n8_1_2 + -n8_1_3 + -n8_1_4 + -n8_1_5 + -n8_1_6 + -n8_2_1 + -n8_2_2 + -n8_2_3 + -n8_2_4 + -n8_2_5 + -n8_2_6 + -n8_3_1 + -n8_3_2 + -n8_3_3 + -n8_3_4 + -n8_3_5 + -n8_3_6 + -n8_4_1 + -n8_4_2 + -n8_4_3 + -n8_4_4 + -n8_4_5 + -n8_4_6 + -n8_5_1 + -n8_5_2 + -n8_5_3 + -n8_5... (shortened)
lola: processed formula length: 560
lola: 32772 rewrites
lola: formula mentions 57 of 270 places; total mentions: 57
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 460 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: RESULT
lola: summary: yes no yes no yes yes yes no yes no no no no no no no
lola: ========================================

BK_STOP 1463698703844

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