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

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

=== Now, execution of the tool begins

BK_START 1463706071642

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ QuasiCertifProtocol-PT-22
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-0 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-4 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-6 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-7 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-8 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-10 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-11 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA QuasiCertifProtocol-COL-22-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: 2322/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1966 places, 356 transitions, 355 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 471 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: read: (EF ((a3 <= n9_2_0 + n9_1_0 + n9_0_0 + n9_13_0 + n9_14_0 + n9_11_0 + n9_12_0 + n9_17_0 + n9_18_0 + n9_15_0 + n9_16_0 + n9_5_0 + n9_6_0 + n9_3_0 + n9_4_0 + n9_9_0 + n9_10_0 + n9_7_0 + n9_8_0 + n9_9_1 + n9_8_1 + n9_11_1 + n9_10_1 + n9_5_1 + n9_4_1 + n9_7_1 + n9_6_1 + n9_1_1 + n9_0_1 + n9_3_1 + n9_2_1 + n9_20_0 + n9_19_0 + n9_22_0 + n9_21_0 + n9_1_2 + n9_2_2 + n9_3_2 + n9_4_2 + n9_20_1 + n9_21_1 + n9... (shortened)
lola: formula length: 41236
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((-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_14_22 + -n9_14_21 + -n9_14_20 + -n9_14_19 + -n9_14_18 + -n9_14_17 + -n9_14_16 + -n9_14_15 + -n9_14_14 + -n9_14_13 + -n9_14_12 + -n9_14_11 + -n9_14_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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-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_14_22 + -n9_14_21 + -n9_14_20 + -n9_14_19 + -n9_14_18 + -n9_14_17 + -n9_14_16 + -n9_14_15 + -n9_14_14 + -n9_14_13 + -n9_14_12 + -n9_14_11 + -n9_14_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_... (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 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -a4 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-Cstart_9 + -Cstart_8 + -Cstart_7 + -Cstart_6 + -Cstart_5 + -Cstart_4 + -Cstart_3 + -Cstart_2 + -Cstart_1 + -Cstart_0 + -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 <= -3 U -s2_10 + -s2_11 + -s2_12 + -s2_13 + -s2_14 + -s2_15 + -s2_16 + -s2_17 + -s2_18 + -s2_19 + -s2_20 + -s2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-Cstart_9 + -Cstart_8 + -Cstart_7 + -Cstart_6 + -Cstart_5 + -Cstart_4 + -Cstart_3 + -Cstart_2 + -Cstart_1 + -Cstart_0 + -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 <= -3 U -s2_10 + -s2_11 + -s2_12 + -s2_13 + -s2_14 + -s2_15 + -s2_16 + -s2_17 + -s2_18 + -s2_19 + -s2_20 + -s2_... (shortened)
lola: processed formula length: 498
lola: 1290833 rewrites
lola: formula mentions 46 of 1966 places; total mentions: 46
lola: closed formula file QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((-CstopAbort + Sstart_22 + Sstart_21 + Sstart_20 + Sstart_19 + Sstart_18 + Sstart_17 + Sstart_16 + Sstart_15 + Sstart_14 + Sstart_13 + Sstart_12 + Sstart_11 + Sstart_10 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + Sstart_7 + Sstart_8 + Sstart_9 > 0 OR (-n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + a4 + -n4_22 + -n4_21 + -n4_20... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((-CstopAbort + Sstart_22 + Sstart_21 + Sstart_20 + Sstart_19 + Sstart_18 + Sstart_17 + Sstart_16 + Sstart_15 + Sstart_14 + Sstart_13 + Sstart_12 + Sstart_11 + Sstart_10 + Sstart_0 + Sstart_1 + Sstart_2 + Sstart_3 + Sstart_4 + Sstart_5 + Sstart_6 + Sstart_7 + Sstart_8 + Sstart_9 > 0 OR (-n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + a4 + -n4_22 + -n4_21... (shortened)
lola: processed formula length: 543
lola: 1290833 rewrites
lola: formula mentions 49 of 1966 places; total mentions: 50
lola: closed formula file QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-SstopOK_20 + -SstopOK_7 + -SstopOK_6 + -SstopOK_1 + -SstopOK_0 + -SstopOK_2 + -SstopOK_3 + -SstopOK_4 + -SstopOK_5 + -SstopOK_22 + -SstopOK_21 + -SstopOK_8 + -SstopOK_19 + -SstopOK_18 + -SstopOK_17 + -SstopOK_16 + -SstopOK_15 + -SstopOK_14 + -SstopOK_13 + -SstopOK_12 + -SstopOK_11 + -SstopOK_10 + -SstopOK_9 > -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-SstopOK_20 + -SstopOK_7 + -SstopOK_6 + -SstopOK_1 + -SstopOK_0 + -SstopOK_2 + -SstopOK_3 + -SstopOK_4 + -SstopOK_5 + -SstopOK_22 + -SstopOK_21 + -SstopOK_8 + -SstopOK_19 + -SstopOK_18 + -SstopOK_17 + -SstopOK_16 + -SstopOK_15 + -SstopOK_14 + -SstopOK_13 + -SstopOK_12 + -SstopOK_11 + -SstopOK_10 + -SstopOK_9 > -1)))
lola: processed formula length: 330
lola: 1290833 rewrites
lola: formula mentions 23 of 1966 places; total mentions: 23
lola: closed formula file QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (-c1_9 + SstopOK_20 + SstopOK_7 + SstopOK_6 + SstopOK_1 + SstopOK_0 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_22 + SstopOK_21 + SstopOK_8 + SstopOK_19 + SstopOK_18 + SstopOK_17 + SstopOK_16 + SstopOK_15 + SstopOK_14 + SstopOK_13 + SstopOK_12 + SstopOK_11 + SstopOK_10 + SstopOK_9 + -c1_10 + -c1_11 + -c1_12 + -c1_13 + -c1_14 + -c1_15 + -c1_16 + -c1_17 + -c1_18 + -c1_19 + -c1_20 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-c1_9 + SstopOK_20 + SstopOK_7 + SstopOK_6 + SstopOK_1 + SstopOK_0 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_22 + SstopOK_21 + SstopOK_8 + SstopOK_19 + SstopOK_18 + SstopOK_17 + SstopOK_16 + SstopOK_15 + SstopOK_14 + SstopOK_13 + SstopOK_12 + SstopOK_11 + SstopOK_10 + SstopOK_9 + -c1_10 + -c1_11 + -c1_12 + -c1_13 + -c1_14 + -c1_15 + -c1_16 + -c1_17 + -c1_18 + -c1_19 + -c1_20 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -c1_9 + SstopOK_20 + SstopOK_7 + SstopOK_6 + SstopOK_1 + SstopOK_0 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_22 + SstopOK_21 + SstopOK_8 + SstopOK_19 + SstopOK_18 + SstopOK_17 + SstopOK_16 + SstopOK_15 + SstopOK_14 + SstopOK_13 + SstopOK_12 + SstopOK_11 + SstopOK_10 + SstopOK_9 + -c1_10 + -c1_11 + -c1_12 + -c1_13 + -c1_14 + -c1_15 + -c1_16 + -c1_17 + -c1_18 + -c1_19 + -c1_... (shortened)
lola: processed formula length: 498
lola: 1290833 rewrites
lola: formula mentions 46 of 1966 places; total mentions: 46
lola: closed formula file QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-malicious_reservoir <= -2 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 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(-malicious_reservoir <= -2 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 <= -3)
lola: processed formula length: 232
lola: 1290833 rewrites
lola: formula mentions 24 of 1966 places; total mentions: 24
lola: closed formula file QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EX (AG (s3_9 + -n1_22 + -n1_21 + -n1_20 + -n1_19 + -n1_18 + -n1_17 + -n1_16 + -n1_15 + -n1_14 + -n1_13 + -n1_12 + -n1_11 + -n1_10 + s3_22 + s3_21 + s3_20 + s3_19 + s3_18 + s3_17 + s3_16 + s3_15 + s3_14 + s3_13 + s3_12 + s3_11 + s3_10 + -n1_0 + -n1_1 + -n1_2 + -n1_3 + -n1_4 + -n1_5 + -n1_6 + -n1_7 + -n1_8 + -n1_9 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 <= 0)) AND -malicious_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (AG (s3_9 + -n1_22 + -n1_21 + -n1_20 + -n1_19 + -n1_18 + -n1_17 + -n1_16 + -n1_15 + -n1_14 + -n1_13 + -n1_12 + -n1_11 + -n1_10 + s3_22 + s3_21 + s3_20 + s3_19 + s3_18 + s3_17 + s3_16 + s3_15 + s3_14 + s3_13 + s3_12 + s3_11 + s3_10 + -n1_0 + -n1_1 + -n1_2 + -n1_3 + -n1_4 + -n1_5 + -n1_6 + -n1_7 + -n1_8 + -n1_9 + 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: EX(!(E(TRUE U !(s3_9 + -n1_22 + -n1_21 + -n1_20 + -n1_19 + -n1_18 + -n1_17 + -n1_16 + -n1_15 + -n1_14 + -n1_13 + -n1_12 + -n1_11 + -n1_10 + s3_22 + s3_21 + s3_20 + s3_19 + s3_18 + s3_17 + s3_16 + s3_15 + s3_14 + s3_13 + s3_12 + s3_11 + s3_10 + -n1_0 + -n1_1 + -n1_2 + -n1_3 + -n1_4 + -n1_5 + -n1_6 + -n1_7 + -n1_8 + -n1_9 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 <= 0))))
lola: processed formula length: 393
lola: 1290834 rewrites
lola: formula mentions 46 of 1966 places; total mentions: 46
lola: closed formula file QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 275 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-n4_9 + -n4_8 + -n4_7 + -n4_6 + -n4_5 + -n4_4 + -n4_3 + -n4_2 + -n4_1 + -n4_0 + Cstart_9 + Cstart_8 + Cstart_7 + Cstart_6 + Cstart_5 + Cstart_4 + Cstart_3 + Cstart_2 + Cstart_1 + Cstart_0 + 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 + -n4_22 + -n4_21 + -n4_20 + -n4_19 + -n4_18 + -n4... (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 1420 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (EG (n2_9 + n2_8 + n2_7 + n2_6 + n2_5 + n2_4 + n2_3 + n2_2 + n2_1 + n2_0 + -malicious_reservoir + 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 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(A(TRUE U !(n2_9 + n2_8 + n2_7 + n2_6 + n2_5 + n2_4 + n2_3 + n2_2 + n2_1 + n2_0 + -malicious_reservoir + 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 <= 0))))
lola: processed formula length: 219
lola: 1290834 rewrites
lola: formula mentions 24 of 1966 places; total mentions: 24
lola: closed formula file QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 7 will run for 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EX (-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_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(EX(-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_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 > -3))))
lola: processed formula length: 219
lola: 1290834 rewrites
lola: formula mentions 23 of 1966 places; total mentions: 23
lola: closed formula file QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 8 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EG (-SstopAbort > -2) AND EX (-n1_22 + -n1_21 + -n1_20 + -n1_19 + -n1_18 + -n1_17 + -n1_16 + -n1_15 + -n1_14 + -n1_13 + -n1_12 + -n1_11 + -n1_10 + -n1_0 + -n1_1 + -n1_2 + -n1_3 + -n1_4 + -n1_5 + -n1_6 + -n1_7 + -n1_8 + -n1_9 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (-SstopAbort > -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(-SstopAbort > -2)))
lola: processed formula length: 32
lola: 1290833 rewrites
lola: formula mentions 1 of 1966 places; total mentions: 1
lola: closed formula file QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: subprocess 9 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (-n1_22 + -n1_21 + -n1_20 + -n1_19 + -n1_18 + -n1_17 + -n1_16 + -n1_15 + -n1_14 + -n1_13 + -n1_12 + -n1_11 + -n1_10 + -n1_0 + -n1_1 + -n1_2 + -n1_3 + -n1_4 + -n1_5 + -n1_6 + -n1_7 + -n1_8 + -n1_9 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(-n1_22 + -n1_21 + -n1_20 + -n1_19 + -n1_18 + -n1_17 + -n1_16 + -n1_15 + -n1_14 + -n1_13 + -n1_12 + -n1_11 + -n1_10 + -n1_0 + -n1_1 + -n1_2 + -n1_3 + -n1_4 + -n1_5 + -n1_6 + -n1_7 + -n1_8 + -n1_9 <= -3)
lola: processed formula length: 204
lola: 1290833 rewrites
lola: formula mentions 23 of 1966 places; total mentions: 23
lola: closed formula file QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 9 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((s3_9 + -Astart + s3_22 + s3_21 + s3_20 + s3_19 + s3_18 + s3_17 + s3_16 + s3_15 + s3_14 + s3_13 + s3_12 + s3_11 + s3_10 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 <= 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_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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((s3_9 + -Astart + s3_22 + s3_21 + s3_20 + s3_19 + s3_18 + s3_17 + s3_16 + s3_15 + s3_14 + s3_13 + s3_12 + s3_11 + s3_10 + s3_0 + s3_1 + s3_2 + s3_3 + s3_4 + s3_5 + s3_6 + s3_7 + s3_8 <= 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_0_22 + -n8_0_21 + -n8_0_20 + -n8_0_19 + -n8_0_18 + -n8_0_17 + -n8_0_16 + -n8_0_15... (shortened)
lola: processed formula length: 6607
lola: 1290834 rewrites
lola: formula mentions 601 of 1966 places; total mentions: 601
lola: closed formula file QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 10 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF (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_3_11 + n7_3_12 + n7_3_13 + n7_3_14 + n7_3_15 + n7_3_16 + n7_3_17 + n7_3_18 + n7_3_19 + n7_16_9 + n7_16_8 + n7_16_7 + n7_16_6 + n7_16_5 + n7_16_4 + n7_16_3 + n7_16_2 + n7_16_1 + n7_16_0 + n7_9_22 + n7_9_21 + n7_9_20 + n7_9_19 + n7_9_18 + n7_9_17 + n7_9_16 + n7_9_15 + n7_9_14 + n7_9_13 + n7_9_12 + n7... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(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_3_11 + n7_3_12 + n7_3_13 + n7_3_14 + n7_3_15 + n7_3_16 + n7_3_17 + n7_3_18 + n7_3_19 + n7_16_9 + n7_16_8 + n7_16_7 + n7_16_6 + n7_16_5 + n7_16_4 + n7_16_3 + n7_16_2 + n7_16_1 + n7_16_0 + n7_9_22 + n7_9_21 + n7_9_20 + n7_9_19 + n7_9_18 + n7_9_17 + n7_9_16 + n7_9_15 + n7_9_14 + n7_9_13 ... (shortened)
lola: processed formula length: 5698
lola: 1290834 rewrites
lola: formula mentions 552 of 1966 places; total mentions: 552
lola: closed formula file QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX (E(-n1_22 + -n1_21 + -n1_20 + -n1_19 + -n1_18 + -n1_17 + -n1_16 + -n1_15 + -n1_14 + -n1_13 + -n1_12 + -n1_11 + CstopAbort + -n1_10 + -n1_0 + -n1_1 + -n1_2 + -n1_3 + -n1_4 + -n1_5 + -n1_6 + -n1_7 + -n1_8 + -n1_9 <= 0 U -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_14_22 + -n9_14_21 + -n9_14_20 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(-n1_22 + -n1_21 + -n1_20 + -n1_19 + -n1_18 + -n1_17 + -n1_16 + -n1_15 + -n1_14 + -n1_13 + -n1_12 + -n1_11 + CstopAbort + -n1_10 + -n1_0 + -n1_1 + -n1_2 + -n1_3 + -n1_4 + -n1_5 + -n1_6 + -n1_7 + -n1_8 + -n1_9 <= 0 U -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_14_22 + -n9_14_21 + -n9_14_20 + -... (shortened)
lola: processed formula length: 6113
lola: 1290834 rewrites
lola: formula mentions 553 of 1966 places; total mentions: 553
lola: closed formula file QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 12 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EX ((-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_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 > -3 AND -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 + Sstart_22 + Sstart_21 + Sstart_20 + Sstart_19 + Sstart_18 + Sstar... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EX ((-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_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 > -3 AND -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 + Sstart_22 + Sstart_21 + Sstart_20 + Sstart_19 + Sstart_18 + Sstart... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((-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_0 + -c1_1 + -c1_2 + -c1_3 + -c1_4 + -c1_5 + -c1_6 + -c1_7 + -c1_8 > -3 AND -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 + Sstart_22 + Sstart_21 + Sstart_20 + Sstart_19 + Sstart_18 + Sstart_... (shortened)
lola: processed formula length: 674
lola: 1290833 rewrites
lola: formula mentions 46 of 1966 places; total mentions: 69
lola: closed formula file QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((Cstart_9 + Cstart_8 + Cstart_7 + Cstart_6 + Cstart_5 + Cstart_4 + Cstart_3 + Cstart_2 + Cstart_1 + Cstart_0 + -n1_22 + -n1_21 + -n1_20 + -n1_19 + -n1_18 + -n1_17 + -n1_16 + -n1_15 + -n1_14 + -n1_13 + -n1_12 + -n1_11 + 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 + -n1_10 + -n1_0 + -n1_... (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 1420 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 13 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-n3_22 + -n3_21 + -n3_20 + -n3_19 + -n3_18 + -n3_17 + -n3_16 + -n3_15 + -n3_14 + -n3_13 + -n3_12 + -n3_11 + -n3_10 + AstopOK + -n3_0 + -n3_1 + -n3_2 + -n3_3 + -n3_4 + -n3_5 + -n3_6 + -n3_7 + -n3_8 + -n3_9 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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 14 will run for 729 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((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 + -s3_9 + CstopOK_9 + CstopOK_8 + CstopOK_7 + CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0 + -s3_22 + -s3_21 + -s3_20 + -s3_19 + -s3_18 + -s3_17 + -s3_16 + -s3_15 + -s3_14 + -s3_13 + -s3_12 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 729 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((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 + -s3_9 + CstopOK_9 + CstopOK_8 + CstopOK_7 + CstopOK_6 + CstopOK_5 + CstopOK_4 + CstopOK_3 + CstopOK_2 + CstopOK_1 + CstopOK_0 + -s3_22 + -s3_21 + -s3_20 + -s3_19 + -s3_18 + -s3_17 + -s3_16 + -s3_15 + -s3_14 + -s3_13 + -s3_12 +... (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 1420 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 invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 1458 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (EF (-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_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_0_12 + -n8_0_11 + -n8_0_10 + -n8_21_22 + -n8_21_21 + -n8_21_20 + -n8_21_19 + -n8_21_18 + -n8_21_17 + -n8_21_16 + -n8_21_15 + -n8_21_14 + -n8_21_13 + -n8_21_12 + -n8_21_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(E(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_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_0_12 + -n8_0_11 + -n8_0_10 + -n8_21_22 + -n8_21_21 + -n8_21_20 + -n8_21_19 + -n8_21_18 + -n8_21_17 + -n8_21_16 + -n8_21_15 + -n8_21_14 + -n8_21_13 + -n8_2... (shortened)
lola: processed formula length: 5916
lola: 1290834 rewrites
lola: formula mentions 529 of 1966 places; total mentions: 529
lola: closed formula file QuasiCertifProtocol-COL-22-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1420 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: RESULT
lola: summary: unknown yes yes yes unknown yes unknown unknown unknown yes unknown unknown no no yes yes
lola: ========================================

BK_STOP 1463708153995

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