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-3254
Executing tool lola
Input is S_QuasiCertifProtocol-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-149479231800257
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496383709574


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_QuasiCertifProtocol-PT-10: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_QuasiCertifProtocol-PT-10: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_QuasiCertifProtocol-PT-10 @ 3540 seconds
----- Start make result stdout -----
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-LTLCardinality.task
lola: A (G (((2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10) U (2 <= n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_5_0 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n8_6_8 + n8_6_9 + n8_3_10 + n8_7_1 + n8_7_2 + n8_7_3 + n8_7_4 + n8_7_5 + n8_7_6 + n8_7_7 + n8_7_8 + n8_7_9 + n8_4_9 + n8_4_8 + n8_4_7 + n8_8_0 + n8_8_1 + n8_8_2 + n8_8_3 + n8_8_4 + n8_8_5 + n8_8_6 + n8_8_7 + n8_8_8 + n8_8_9 + n8_4_6 + n8_4_5 + n8_9_0 + n8_9_1 + n8_9_2 + n8_9_3 + n8_9_4 + n8_9_5 + n8_9_6 + n8_9_7 + n8_9_8 + n8_9_9 + n8_4_4 + n8_2_10 + n8_4_3 + n8_4_2 + n8_4_1 + n8_7_10 + n8_4_0 + n8_3_9 + n8_3_8 + n8_3_7 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_1_10 + n8_2_9 + n8_2_8 + n8_2_7 + n8_2_6 + n8_2_5 + n8_6_10 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_9 + n8_1_8 + n8_1_7 + n8_1_6 + n8_1_5 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_0_10 + n8_0_9 + n8_0_8 + n8_0_7 + n8_0_6 + n8_0_5 + n8_0_4 + n8_0_3 + n8_0_2 + n8_0_1 + n8_10_0 + n8_10_1 + n8_10_2 + n8_10_3 + n8_10_4 + n8_10_5 + n8_10_6 + n8_10_7 + n8_10_8 + n8_10_9)))) : A (G (X (G (X ((3 <= malicious_reservoir)))))) : A (G (G (((3 <= a2) U (n9_7_10 + n9_1_10 + n9_6_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_0_10 + n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_0_7 + n9_0_8 + n9_0_9 + n9_5_10 + n9_1_0 + n9_1_1 + n9_1_2 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_1_7 + n9_1_8 + n9_1_9 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9_2_5 + n9_2_6 + n9_2_7 + n9_2_8 + n9_2_9 + n9_3_0 + n9_3_1 + n9_3_2 + n9_3_3 + n9_3_4 + n9_3_5 + n9_3_6 + n9_3_7 + n9_3_8 + n9_3_9 + n9_4_10 + n9_4_0 + n9_4_1 + n9_4_2 + n9_4_3 + n9_4_4 + n9_4_5 + n9_4_6 + n9_4_7 + n9_4_8 + n9_4_9 + n9_9_10 + n9_10_10 + n9_5_0 + n9_5_1 + n9_5_2 + n9_5_3 + n9_5_4 + n9_5_5 + n9_5_6 + n9_5_7 + n9_5_8 + n9_5_9 + n9_6_0 + n9_6_1 + n9_6_2 + n9_6_3 + n9_6_4 + n9_6_5 + n9_6_6 + n9_6_7 + n9_6_8 + n9_6_9 + n9_3_10 + n9_7_0 + n9_7_1 + n9_7_2 + n9_7_3 + n9_7_4 + n9_7_5 + n9_7_6 + n9_7_7 + n9_7_8 + n9_7_9 + n9_8_10 + n9_8_0 + n9_8_1 + n9_8_2 + n9_8_3 + n9_8_4 + n9_8_5 + n9_8_6 + n9_8_7 + n9_8_8 + n9_8_9 + n9_9_0 + n9_9_1 + n9_9_2 + n9_9_3 + n9_9_4 + n9_9_5 + n9_9_6 + n9_9_7 + n9_9_8 + n9_9_9 + n9_2_10 <= n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10))))) : A (X (G (((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= a2) U (2 <= AstopAbort))))) : A (X (X (G (G ((1 <= malicious_reservoir)))))) : A (X ((Astart <= Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0))) : A ((((SstopAbort <= a3) U (SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10)) U F (X ((3 <= n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_5_0 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n8_6_8 + n8_6_9 + n8_3_10 + n8_7_1 + n8_7_2 + n8_7_3 + n8_7_4 + n8_7_5 + n8_7_6 + n8_7_7 + n8_7_8 + n8_7_9 + n8_4_9 + n8_4_8 + n8_4_7 + n8_8_0 + n8_8_1 + n8_8_2 + n8_8_3 + n8_8_4 + n8_8_5 + n8_8_6 + n8_8_7 + n8_8_8 + n8_8_9 + n8_4_6 + n8_4_5 + n8_9_0 + n8_9_1 + n8_9_2 + n8_9_3 + n8_9_4 + n8_9_5 + n8_9_6 + n8_9_7 + n8_9_8 + n8_9_9 + n8_4_4 + n8_2_10 + n8_4_3 + n8_4_2 + n8_4_1 + n8_7_10 + n8_4_0 + n8_3_9 + n8_3_8 + n8_3_7 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_1_10 + n8_2_9 + n8_2_8 + n8_2_7 + n8_2_6 + n8_2_5 + n8_6_10 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_9 + n8_1_8 + n8_1_7 + n8_1_6 + n8_1_5 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_0_10 + n8_0_9 + n8_0_8 + n8_0_7 + n8_0_6 + n8_0_5 + n8_0_4 + n8_0_3 + n8_0_2 + n8_0_1 + n8_10_0 + n8_10_1 + n8_10_2 + n8_10_3 + n8_10_4 + n8_10_5 + n8_10_6 + n8_10_7 + n8_10_8 + n8_10_9))))) : A (X (X (F ((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= n5_10 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9))))) : A (G ((F ((SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= Astart)) U F ((n7_3_10 + n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_6_7 + n7_6_8 + n7_6_9 + n7_7_0 + n7_8_10 + n7_8_0 + n7_4_10 + n7_2_10 + n7_9_0 + n7_5_10 + n7_10_0 + n7_0_10 + n7_1_10 + n7_7_10 + n7_6_10 + n7_10_1 + n7_10_2 + n7_10_3 + n7_10_4 + n7_10_5 + n7_10_6 + n7_10_7 + n7_10_8 + n7_10_9 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_0_7 + n7_0_8 + n7_0_9 + n7_1_0 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_1_7 + n7_1_8 + n7_1_9 + n7_9_9 + n7_9_8 + n7_9_7 + n7_2_0 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_2_7 + n7_2_8 + n7_2_9 + n7_9_6 + n7_9_5 + n7_9_4 + n7_9_3 + n7_9_2 + n7_9_1 + n7_10_10 + n7_3_0 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_3_7 + n7_3_8 + n7_3_9 + n7_8_9 + n7_8_8 + n7_8_7 + n7_8_6 + n7_8_5 + n7_8_4 + n7_8_3 + n7_8_2 + n7_8_1 + n7_4_0 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_4_7 + n7_4_8 + n7_4_9 + n7_7_9 + n7_7_8 + n7_7_7 + n7_7_6 + n7_7_5 + n7_7_4 + n7_7_3 + n7_7_2 + n7_7_1 + n7_9_10 + n7_5_0 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6 + n7_5_7 + n7_5_8 + n7_5_9 <= Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0))))) : A ((2 <= n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10)) : A (F (X (F (F ((2 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10)))))) : A ((((1 <= CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10) U (CstopAbort <= n7_3_10 + n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_6_7 + n7_6_8 + n7_6_9 + n7_7_0 + n7_8_10 + n7_8_0 + n7_4_10 + n7_2_10 + n7_9_0 + n7_5_10 + n7_10_0 + n7_0_10 + n7_1_10 + n7_7_10 + n7_6_10 + n7_10_1 + n7_10_2 + n7_10_3 + n7_10_4 + n7_10_5 + n7_10_6 + n7_10_7 + n7_10_8 + n7_10_9 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_0_7 + n7_0_8 + n7_0_9 + n7_1_0 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_1_7 + n7_1_8 + n7_1_9 + n7_9_9 + n7_9_8 + n7_9_7 + n7_2_0 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_2_7 + n7_2_8 + n7_2_9 + n7_9_6 + n7_9_5 + n7_9_4 + n7_9_3 + n7_9_2 + n7_9_1 + n7_10_10 + n7_3_0 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_3_7 + n7_3_8 + n7_3_9 + n7_8_9 + n7_8_8 + n7_8_7 + n7_8_6 + n7_8_5 + n7_8_4 + n7_8_3 + n7_8_2 + n7_8_1 + n7_4_0 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_4_7 + n7_4_8 + n7_4_9 + n7_7_9 + n7_7_8 + n7_7_7 + n7_7_6 + n7_7_5 + n7_7_4 + n7_7_3 + n7_7_2 + n7_7_1 + n7_9_10 + n7_5_0 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6 + n7_5_7 + n7_5_8 + n7_5_9)) U X (X ((Astart <= s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10))))) : A (X ((F ((malicious_reservoir <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10)) U (3 <= Cstart_10 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + Cstart_7 + Cstart_8 + Cstart_9)))) : A (X (((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 <= s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10) U G ((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= a1))))) : A (X ((X ((3 <= n5_10 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9)) U F ((c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_10 + c1_9 <= n9_7_10 + n9_1_10 + n9_6_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_0_10 + n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_0_7 + n9_0_8 + n9_0_9 + n9_5_10 + n9_1_0 + n9_1_1 + n9_1_2 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_1_7 + n9_1_8 + n9_1_9 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9_2_5 + n9_2_6 + n9_2_7 + n9_2_8 + n9_2_9 + n9_3_0 + n9_3_1 + n9_3_2 + n9_3_3 + n9_3_4 + n9_3_5 + n9_3_6 + n9_3_7 + n9_3_8 + n9_3_9 + n9_4_10 + n9_4_0 + n9_4_1 + n9_4_2 + n9_4_3 + n9_4_4 + n9_4_5 + n9_4_6 + n9_4_7 + n9_4_8 + n9_4_9 + n9_9_10 + n9_10_10 + n9_5_0 + n9_5_1 + n9_5_2 + n9_5_3 + n9_5_4 + n9_5_5 + n9_5_6 + n9_5_7 + n9_5_8 + n9_5_9 + n9_6_0 + n9_6_1 + n9_6_2 + n9_6_3 + n9_6_4 + n9_6_5 + n9_6_6 + n9_6_7 + n9_6_8 + n9_6_9 + n9_3_10 + n9_7_0 + n9_7_1 + n9_7_2 + n9_7_3 + n9_7_4 + n9_7_5 + n9_7_6 + n9_7_7 + n9_7_8 + n9_7_9 + n9_8_10 + n9_8_0 + n9_8_1 + n9_8_2 + n9_8_3 + n9_8_4 + n9_8_5 + n9_8_6 + n9_8_7 + n9_8_8 + n9_8_9 + n9_9_0 + n9_9_1 + n9_9_2 + n9_9_3 + n9_9_4 + n9_9_5 + n9_9_6 + n9_9_7 + n9_9_8 + n9_9_9 + n9_2_10))))) : A (X (X (X (X ((a3 <= n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10) U (2 <= n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_5_0 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n8_6_8 + n8_6_9 + n8_3_10 + n8_7_1 + n8_7_2 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10) U (2 <= n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_5_0 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n8_6_8 + n8_6_9 + n8_3_10 + n8_7_1 + n8_7_2 + n8_7_3 + n8_7_4 + n8_7_5 + n8_7_6 + n8_7_7 + n8_7_8 + n8_7_9 + n8_4_9 + n8_4_8 + n8_4_7 + n8_8_0 + n8_8_1 + n8_8_2 + n8_8_3 + n8_8_4 + n8_8_5 + n8_8_6 + n8_8_7 + n8_8_8 + n8_8_9 + n8_4_6 + n8_4_5 + n8_9_0 + n8_9_1 + n8_9_2 + n8_9_3 + n8_9_4 + n8_9_5 + n8_9_6 + n8_9_7 + n8_9_8 + n8_9_9 + n8_4_4 + n8_2_10 + n8_4_3 + n8_4_2 + n8_4_1 + n8_7_10 + n8_4_0 + n8_3_9 + n8_3_8 + n8_3_7 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_1_10 + n8_2_9 + n8_2_8 + n8_2_7 + n8_2_6 + n8_2_5 + n8_6_10 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_9 + n8_1_8 + n8_1_7 + n8_1_6 + n8_1_5 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_0_10 + n8_0_9 + n8_0_8 + n8_0_7 + n8_0_6 + n8_0_5 + n8_0_4 + n8_0_3 + n8_0_2 + n8_0_1 + n8_10_0 + n8_10_1 + n8_10_2 + n8_10_3 + n8_10_4 + n8_10_5 + n8_10_6 + n8_10_7 + n8_10_8 + n8_10_9))))
lola: processed formula: A (G (((2 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10) U (2 <= n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_5_0 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n8_6_8 + n8_6_9 + n8_3_10 + n8_7_1 + n8_7_2 ... (shortened)
lola: processed formula length: 1210
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (X ((3 <= malicious_reservoir))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (G (X ((3 <= malicious_reservoir))))))
lola: processed formula: A (G (X (G (X ((3 <= malicious_reservoir))))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (((3 <= a2) U (n9_7_10 + n9_1_10 + n9_6_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_0_10 + n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_0_7 + n9_0_8 + n9_0_9 + n9_5_10 + n9_1_0 + n9_1_1 + n9_1_2 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_1_7 + n9_1_8 + n9_1_9 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (((3 <= a2) U (n9_7_10 + n9_1_10 + n9_6_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_0_10 + n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_0_7 + n9_0_8 + n9_0_9 + n9_5_10 + n9_1_0 + n9_1_1 + n9_1_2 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_1_7 + n9_1_8 + n9_1_9 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9_2_5 + n9_2_6 + n9_2_7 + n9_2_8 + n9_2_9 + n9_3_0 + n9_3_1 + n9_3_2 + n9_3_3 + n9_3_4 + n9_3_5 + n9_3_6 + n9_3_7 + n9_3_8 + n9_3_9 + n9_4_10 + n9_4_0 + n9_4_1 + n9_4_2 + n9_4_3 + n9_4_4 + n9_4_5 + n9_4_6 + n9_4_7 + n9_4_8 + n9_4_9 + n9_9_10 + n9_10_10 + n9_5_0 + n9_5_1 + n9_5_2 + n9_5_3 + n9_5_4 + n9_5_5 + n9_5_6 + n9_5_7 + n9_5_8 + n9_5_9 + n9_6_0 + n9_6_1 + n9_6_2 + n9_6_3 + n9_6_4 + n9_6_5 + n9_6_6 + n9_6_7 + n9_6_8 + n9_6_9 + n9_3_10 + n9_7_0 + n9_7_1 + n9_7_2 + n9_7_3 + n9_7_4 + n9_7_5 + n9_7_6 + n9_7_7 + n9_7_8 + n9_7_9 + n9_8_10 + n9_8_0 + n9_8_1 + n9_8_2 + n9_8_3 + n9_8_4 + n9_8_5 + n9_8_6 + n9_8_7 + n9_8_8 + n9_8_9 + n9_9_0 + n9_9_1 + n9_9_2 + n9_9_3 + n9_9_4 + n9_9_5 + n9_9_6 + n9_9_7 + n9_9_8 + n9_9_9 + n9_2_10 <= n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10)))))
lola: processed formula: A (G (G (((3 <= a2) U (n9_7_10 + n9_1_10 + n9_6_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_0_10 + n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_0_7 + n9_0_8 + n9_0_9 + n9_5_10 + n9_1_0 + n9_1_1 + n9_1_2 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_1_7 + n9_1_8 + n9_1_9 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9... (shortened)
lola: processed formula length: 1215
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 495369 markings, 2111882 edges, 99074 markings/sec, 0 secs
lola: 888014 markings, 4246417 edges, 78529 markings/sec, 5 secs
lola: 1374861 markings, 6522719 edges, 97369 markings/sec, 10 secs
lola: 1805277 markings, 8826361 edges, 86083 markings/sec, 15 secs
lola: 2214014 markings, 11245676 edges, 81747 markings/sec, 20 secs
lola: 2570902 markings, 13519159 edges, 71378 markings/sec, 25 secs
lola: 2867639 markings, 15688263 edges, 59347 markings/sec, 30 secs
lola: 3236579 markings, 17608551 edges, 73788 markings/sec, 35 secs
lola: 3650355 markings, 19730950 edges, 82755 markings/sec, 40 secs
lola: 4046765 markings, 22046383 edges, 79282 markings/sec, 45 secs
lola: 4395928 markings, 24274029 edges, 69833 markings/sec, 50 secs
lola: 4674061 markings, 26378739 edges, 55627 markings/sec, 55 secs
lola: 5052317 markings, 28511918 edges, 75651 markings/sec, 60 secs
lola: 5420755 markings, 30786803 edges, 73688 markings/sec, 65 secs
lola: 5698787 markings, 32915084 edges, 55606 markings/sec, 70 secs
lola: 6066041 markings, 35135859 edges, 73451 markings/sec, 75 secs
lola: 6361386 markings, 37216998 edges, 59069 markings/sec, 80 secs
lola: 6686738 markings, 39397231 edges, 65070 markings/sec, 85 secs
lola: 6927318 markings, 41163297 edges, 48116 markings/sec, 90 secs
lola: 7209605 markings, 43061386 edges, 56457 markings/sec, 95 secs
lola: 7461192 markings, 44905275 edges, 50317 markings/sec, 100 secs
lola: 7734265 markings, 46871907 edges, 54615 markings/sec, 105 secs
lola: 7985087 markings, 48693181 edges, 50164 markings/sec, 110 secs
lola: 8236630 markings, 50685229 edges, 50309 markings/sec, 115 secs
lola: 8580016 markings, 52583307 edges, 68677 markings/sec, 120 secs
lola: 8953983 markings, 54622976 edges, 74793 markings/sec, 125 secs
lola: 9398298 markings, 56639688 edges, 88863 markings/sec, 130 secs
lola: 9817889 markings, 58645031 edges, 83918 markings/sec, 135 secs
lola: 10214019 markings, 60718769 edges, 79226 markings/sec, 140 secs
lola: 10589288 markings, 62752837 edges, 75054 markings/sec, 145 secs
lola: 10960100 markings, 64785531 edges, 74162 markings/sec, 150 secs
lola: 11308497 markings, 66796724 edges, 69679 markings/sec, 155 secs
lola: 11627680 markings, 68736911 edges, 63837 markings/sec, 160 secs
lola: 11956082 markings, 70759245 edges, 65680 markings/sec, 165 secs
lola: 12252690 markings, 72584232 edges, 59322 markings/sec, 170 secs
lola: 12491099 markings, 74512913 edges, 47682 markings/sec, 175 secs
lola: 12736797 markings, 76515344 edges, 49140 markings/sec, 180 secs
lola: 13006896 markings, 78542128 edges, 54020 markings/sec, 185 secs
lola: 13254230 markings, 80525746 edges, 49467 markings/sec, 190 secs
lola: 13607061 markings, 82583909 edges, 70566 markings/sec, 195 secs
lola: 13995361 markings, 84656704 edges, 77660 markings/sec, 200 secs
lola: 14398375 markings, 86675196 edges, 80603 markings/sec, 205 secs
lola: 14788691 markings, 88705503 edges, 78063 markings/sec, 210 secs
lola: 15170221 markings, 90737838 edges, 76306 markings/sec, 215 secs
lola: 15535209 markings, 92760421 edges, 72998 markings/sec, 220 secs
lola: 15882866 markings, 94774803 edges, 69531 markings/sec, 225 secs
lola: 16230787 markings, 96773271 edges, 69584 markings/sec, 230 secs
lola: 16543710 markings, 98681715 edges, 62585 markings/sec, 235 secs
lola: 16809719 markings, 100555849 edges, 53202 markings/sec, 240 secs
lola: 17053916 markings, 102541232 edges, 48839 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= a2) U (2 <= AstopAbort)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= a2) U (2 <= AstopAbort)))))
lola: processed formula: A (X (G (((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= a2) U (2 <= AstopAbort)))))
lola: processed formula length: 117
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (G (G ((1 <= malicious_reservoir))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G (G ((1 <= malicious_reservoir))))))
lola: processed formula: A (X (X (G (G ((1 <= malicious_reservoir))))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((Astart <= Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((Astart <= Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0)))
lola: processed formula: A (X ((Astart <= Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0)))
lola: processed formula length: 139
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((SstopAbort <= a3) U (SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10)) U F (X ((3 <= n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((SstopAbort <= a3) U (SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10)) U F (X ((3 <= n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5 + n8_5_4 + n8_5_3 + n8_5_2 + n8_5_1 + n8_5_0 + n8_6_1 + n8_6_2 + n8_6_3 + n8_6_4 + n8_6_5 + n8_6_6 + n8_6_7 + n8_6_8 + n8_6_9 + n8_3_10 + n8_7_1 + n8_7_2 + n8_7_3 + n8_7_4 + n8_7_5 + n8_7_6 + n8_7_7 + n8_7_8 + n8_7_9 + n8_4_9 + n8_4_8 + n8_4_7 + n8_8_0 + n8_8_1 + n8_8_2 + n8_8_3 + n8_8_4 + n8_8_5 + n8_8_6 + n8_8_7 + n8_8_8 + n8_8_9 + n8_4_6 + n8_4_5 + n8_9_0 + n8_9_1 + n8_9_2 + n8_9_3 + n8_9_4 + n8_9_5 + n8_9_6 + n8_9_7 + n8_9_8 + n8_9_9 + n8_4_4 + n8_2_10 + n8_4_3 + n8_4_2 + n8_4_1 + n8_7_10 + n8_4_0 + n8_3_9 + n8_3_8 + n8_3_7 + n8_3_6 + n8_3_5 + n8_3_4 + n8_3_3 + n8_3_2 + n8_3_1 + n8_1_10 + n8_2_9 + n8_2_8 + n8_2_7 + n8_2_6 + n8_2_5 + n8_6_10 + n8_2_4 + n8_2_3 + n8_2_2 + n8_2_1 + n8_1_9 + n8_1_8 + n8_1_7 + n8_1_6 + n8_1_5 + n8_1_4 + n8_1_3 + n8_1_2 + n8_1_1 + n8_0_10 + n8_0_9 + n8_0_8 + n8_0_7 + n8_0_6 + n8_0_5 + n8_0_4 + n8_0_3 + n8_0_2 + n8_0_1 + n8_10_0 + n8_10_1 + n8_10_2 + n8_10_3 + n8_10_4 + n8_10_5 + n8_10_6 + n8_10_7 + n8_10_8 + n8_10_9)))))
lola: processed formula: A ((((SstopAbort <= a3) U (SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10)) U F (X ((3 <= n8_5_10 + n8_0_0 + n8_1_0 + n8_2_0 + n8_10_10 + n8_3_0 + n8_4_10 + n8_8_10 + n8_7_0 + n8_9_10 + n8_6_0 + n8_5_9 + n8_5_8 + n8_5_7 + n8_5_6 + n8_5_5... (shortened)
lola: processed formula length: 1366
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= n5_10 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= n5_10 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9)))))
lola: processed formula: A (X (X (F ((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= n5_10 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9)))))
lola: processed formula length: 172
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 8 will run for 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= Astart)) U F ((n7_3_10 + n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_6_7 + n7_6_8 + n7_6_9 + n7_7_0 + n7_8_10 + n7_8_0 + n7_4_10 + n7_2_10 + n7_9_0 + n7_5_10 + n7_10_0 + n7_0_10 + n7_1_10 + n7_7_10 + n7_6_10 + n7_10_1 + n7_10_2 + n7_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= Astart)) U F ((n7_3_10 + n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_6_7 + n7_6_8 + n7_6_9 + n7_7_0 + n7_8_10 + n7_8_0 + n7_4_10 + n7_2_10 + n7_9_0 + n7_5_10 + n7_10_0 + n7_0_10 + n7_1_10 + n7_7_10 + n7_6_10 + n7_10_1 + n7_10_2 + n7_10_3 + n7_10_4 + n7_10_5 + n7_10_6 + n7_10_7 + n7_10_8 + n7_10_9 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_0_7 + n7_0_8 + n7_0_9 + n7_1_0 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_1_7 + n7_1_8 + n7_1_9 + n7_9_9 + n7_9_8 + n7_9_7 + n7_2_0 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_2_7 + n7_2_8 + n7_2_9 + n7_9_6 + n7_9_5 + n7_9_4 + n7_9_3 + n7_9_2 + n7_9_1 + n7_10_10 + n7_3_0 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_3_7 + n7_3_8 + n7_3_9 + n7_8_9 + n7_8_8 + n7_8_7 + n7_8_6 + n7_8_5 + n7_8_4 + n7_8_3 + n7_8_2 + n7_8_1 + n7_4_0 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_4_7 + n7_4_8 + n7_4_9 + n7_7_9 + n7_7_8 + n7_7_7 + n7_7_6 + n7_7_5 + n7_7_4 + n7_7_3 + n7_7_2 + n7_7_1 + n7_9_10 + n7_5_0 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6 + n7_5_7 + n7_5_8 + n7_5_9 <= Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0)))))
lola: processed formula: A (G ((F ((SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= Astart)) U F ((n7_3_10 + n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_6_7 + n7_6_8 + n7_6_9 + n7_7_0 + n7_8_10 + n7_8_0 + n7_4_10 + n7_2_10 + n7_9_0 + n7_5_10 + n7_10_0 + n7_0_10 + n7_1_10 + n7_7_10 + n7_6_10 + n7_10_1 + n7_10_2 + n7_... (shortened)
lola: processed formula length: 1396
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 427262 markings, 2294062 edges, 85452 markings/sec, 0 secs
lola: 892143 markings, 5125372 edges, 92976 markings/sec, 5 secs
lola: 1244710 markings, 7805156 edges, 70513 markings/sec, 10 secs
lola: 1624315 markings, 10005377 edges, 75921 markings/sec, 15 secs
lola: 1999981 markings, 12160761 edges, 75133 markings/sec, 20 secs
lola: 2354126 markings, 14494298 edges, 70829 markings/sec, 25 secs
lola: 2678634 markings, 16768252 edges, 64902 markings/sec, 30 secs
lola: 3176809 markings, 18889535 edges, 99635 markings/sec, 35 secs
lola: 3498123 markings, 20818172 edges, 64263 markings/sec, 40 secs
lola: 3824089 markings, 22914416 edges, 65193 markings/sec, 45 secs
lola: 4211439 markings, 25191675 edges, 77470 markings/sec, 50 secs
lola: 4557985 markings, 27485676 edges, 69309 markings/sec, 55 secs
lola: 4877185 markings, 29805663 edges, 63840 markings/sec, 60 secs
lola: 5143184 markings, 32002187 edges, 53200 markings/sec, 65 secs
lola: 5487824 markings, 34241797 edges, 68928 markings/sec, 70 secs
lola: 5774599 markings, 36281676 edges, 57355 markings/sec, 75 secs
lola: 6240027 markings, 38329995 edges, 93086 markings/sec, 80 secs
lola: 6636034 markings, 40285508 edges, 79201 markings/sec, 85 secs
lola: 7031366 markings, 42246762 edges, 79066 markings/sec, 90 secs
lola: 7391510 markings, 44127410 edges, 72029 markings/sec, 95 secs
lola: 7731871 markings, 45997757 edges, 68072 markings/sec, 100 secs
lola: 8042419 markings, 47822709 edges, 62110 markings/sec, 105 secs
lola: 8313251 markings, 49579399 edges, 54166 markings/sec, 110 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 453 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10)
lola: processed formula length: 82
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 528 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (F ((2 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F ((2 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10)))))
lola: processed formula: A (F (X (F ((2 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10)))))
lola: processed formula length: 98
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1138353 markings, 3019095 edges, 227671 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 11 will run for 632 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10) U (CstopAbort <= n7_3_10 + n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_6_7 + n7_6_8 + n7_6_9 + n7_7_0 + n7_8_10 + n7_8_0 + n7_4_10 + n7_2_10 + n7_9_0 + n7_5_10 + n7_10_0 + n7_0_10 + n7_1_10 + n7_7_10 + n7_6_10 + n7_10_1 + n7_10_2 + n7_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10) U (CstopAbort <= n7_3_10 + n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_6_7 + n7_6_8 + n7_6_9 + n7_7_0 + n7_8_10 + n7_8_0 + n7_4_10 + n7_2_10 + n7_9_0 + n7_5_10 + n7_10_0 + n7_0_10 + n7_1_10 + n7_7_10 + n7_6_10 + n7_10_1 + n7_10_2 + n7_10_3 + n7_10_4 + n7_10_5 + n7_10_6 + n7_10_7 + n7_10_8 + n7_10_9 + n7_0_0 + n7_0_1 + n7_0_2 + n7_0_3 + n7_0_4 + n7_0_5 + n7_0_6 + n7_0_7 + n7_0_8 + n7_0_9 + n7_1_0 + n7_1_1 + n7_1_2 + n7_1_3 + n7_1_4 + n7_1_5 + n7_1_6 + n7_1_7 + n7_1_8 + n7_1_9 + n7_9_9 + n7_9_8 + n7_9_7 + n7_2_0 + n7_2_1 + n7_2_2 + n7_2_3 + n7_2_4 + n7_2_5 + n7_2_6 + n7_2_7 + n7_2_8 + n7_2_9 + n7_9_6 + n7_9_5 + n7_9_4 + n7_9_3 + n7_9_2 + n7_9_1 + n7_10_10 + n7_3_0 + n7_3_1 + n7_3_2 + n7_3_3 + n7_3_4 + n7_3_5 + n7_3_6 + n7_3_7 + n7_3_8 + n7_3_9 + n7_8_9 + n7_8_8 + n7_8_7 + n7_8_6 + n7_8_5 + n7_8_4 + n7_8_3 + n7_8_2 + n7_8_1 + n7_4_0 + n7_4_1 + n7_4_2 + n7_4_3 + n7_4_4 + n7_4_5 + n7_4_6 + n7_4_7 + n7_4_8 + n7_4_9 + n7_7_9 + n7_7_8 + n7_7_7 + n7_7_6 + n7_7_5 + n7_7_4 + n7_7_3 + n7_7_2 + n7_7_1 + n7_9_10 + n7_5_0 + n7_5_1 + n7_5_2 + n7_5_3 + n7_5_4 + n7_5_5 + n7_5_6 + n7_5_7 + n7_5_8 + n7_5_9)) U X (X ((Astart <= s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10)))))
lola: processed formula: A ((((1 <= CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10) U (CstopAbort <= n7_3_10 + n7_6_0 + n7_6_1 + n7_6_2 + n7_6_3 + n7_6_4 + n7_6_5 + n7_6_6 + n7_6_7 + n7_6_8 + n7_6_9 + n7_7_0 + n7_8_10 + n7_8_0 + n7_4_10 + n7_2_10 + n7_9_0 + n7_5_10 + n7_10_0 + n7_0_10 + n7_1_10 + n7_7_10 + n7_6_10 + n7_10_1 + n7_10_2 + n7_... (shortened)
lola: processed formula length: 1370
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 12 will run for 790 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((malicious_reservoir <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10)) U (3 <= Cstart_10 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + Cstart_7 + Cstart_8 + Cstart_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((malicious_reservoir <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10)) U (3 <= Cstart_10 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + Cstart_7 + Cstart_8 + Cstart_9))))
lola: processed formula: A (X ((F ((malicious_reservoir <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10)) U (3 <= Cstart_10 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + Cstart_7 + Cstart_8 + Cstart_9))))
lola: processed formula length: 243
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 13 will run for 1054 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 <= s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10) U G ((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= a1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 <= s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10) U G ((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= a1)))))
lola: processed formula: A (X (((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 <= s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10) U G ((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= a1)))))
lola: processed formula length: 256
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 533778 markings, 3552711 edges, 106756 markings/sec, 0 secs
lola: 973920 markings, 6812228 edges, 88028 markings/sec, 5 secs
lola: 1297648 markings, 9700770 edges, 64746 markings/sec, 10 secs
lola: 1730695 markings, 12579056 edges, 86609 markings/sec, 15 secs
lola: 2098804 markings, 15278155 edges, 73622 markings/sec, 20 secs
lola: 2427658 markings, 17854920 edges, 65771 markings/sec, 25 secs
lola: 2838639 markings, 20954481 edges, 82196 markings/sec, 30 secs
lola: 3357966 markings, 24573852 edges, 103865 markings/sec, 35 secs
lola: 3776088 markings, 27933867 edges, 83624 markings/sec, 40 secs
lola: 4146180 markings, 30990488 edges, 74018 markings/sec, 45 secs
lola: 4532480 markings, 34026720 edges, 77260 markings/sec, 50 secs
lola: 4881308 markings, 36933065 edges, 69766 markings/sec, 55 secs
lola: 5211735 markings, 39772046 edges, 66085 markings/sec, 60 secs
lola: 5493579 markings, 42414405 edges, 56369 markings/sec, 65 secs
lola: 5904882 markings, 45602016 edges, 82261 markings/sec, 70 secs
lola: 6365376 markings, 49069654 edges, 92099 markings/sec, 75 secs
lola: 6711981 markings, 52119582 edges, 69321 markings/sec, 80 secs
lola: 7184660 markings, 55655326 edges, 94536 markings/sec, 85 secs
lola: 7513918 markings, 58584336 edges, 65852 markings/sec, 90 secs
lola: 7944992 markings, 61873925 edges, 86215 markings/sec, 95 secs
lola: 8287599 markings, 64865797 edges, 68521 markings/sec, 100 secs
lola: 8638250 markings, 67866098 edges, 70130 markings/sec, 105 secs
lola: 8987972 markings, 70848100 edges, 69944 markings/sec, 110 secs
lola: 9307346 markings, 73719731 edges, 63875 markings/sec, 115 secs
lola: 9600436 markings, 76481719 edges, 58618 markings/sec, 120 secs
lola: 9862712 markings, 79009371 edges, 52455 markings/sec, 125 secs
lola: 10111475 markings, 81512738 edges, 49753 markings/sec, 130 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: subprocess 14 will run for 1513 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X ((X ((3 <= n5_10 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9)) U F ((c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_10 + c1_9 <= n9_7_10 + n9_1_10 + n9_6_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_0_10 + n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_0_7 + n9_0_8 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((3 <= n5_10 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9)) U F ((c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_10 + c1_9 <= n9_7_10 + n9_1_10 + n9_6_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_0_10 + n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_0_7 + n9_0_8 + n9_0_9 + n9_5_10 + n9_1_0 + n9_1_1 + n9_1_2 + n9_1_3 + n9_1_4 + n9_1_5 + n9_1_6 + n9_1_7 + n9_1_8 + n9_1_9 + n9_2_0 + n9_2_1 + n9_2_2 + n9_2_3 + n9_2_4 + n9_2_5 + n9_2_6 + n9_2_7 + n9_2_8 + n9_2_9 + n9_3_0 + n9_3_1 + n9_3_2 + n9_3_3 + n9_3_4 + n9_3_5 + n9_3_6 + n9_3_7 + n9_3_8 + n9_3_9 + n9_4_10 + n9_4_0 + n9_4_1 + n9_4_2 + n9_4_3 + n9_4_4 + n9_4_5 + n9_4_6 + n9_4_7 + n9_4_8 + n9_4_9 + n9_9_10 + n9_10_10 + n9_5_0 + n9_5_1 + n9_5_2 + n9_5_3 + n9_5_4 + n9_5_5 + n9_5_6 + n9_5_7 + n9_5_8 + n9_5_9 + n9_6_0 + n9_6_1 + n9_6_2 + n9_6_3 + n9_6_4 + n9_6_5 + n9_6_6 + n9_6_7 + n9_6_8 + n9_6_9 + n9_3_10 + n9_7_0 + n9_7_1 + n9_7_2 + n9_7_3 + n9_7_4 + n9_7_5 + n9_7_6 + n9_7_7 + n9_7_8 + n9_7_9 + n9_8_10 + n9_8_0 + n9_8_1 + n9_8_2 + n9_8_3 + n9_8_4 + n9_8_5 + n9_8_6 + n9_8_7 + n9_8_8 + n9_8_9 + n9_9_0 + n9_9_1 + n9_9_2 + n9_9_3 + n9_9_4 + n9_9_5 + n9_9_6 + n9_9_7 + n9_9_8 + n9_9_9 + n9_2_10)))))
lola: processed formula: A (X ((X ((3 <= n5_10 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9)) U F ((c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_10 + c1_9 <= n9_7_10 + n9_1_10 + n9_6_10 + n9_10_9 + n9_10_8 + n9_10_7 + n9_10_6 + n9_10_5 + n9_10_4 + n9_10_3 + n9_10_2 + n9_10_1 + n9_10_0 + n9_0_10 + n9_0_0 + n9_0_1 + n9_0_2 + n9_0_3 + n9_0_4 + n9_0_5 + n9_0_6 + n9_0_7 + n9_0_8 + ... (shortened)
lola: processed formula length: 1292
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 15 will run for 3027 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X ((a3 <= n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (X ((a3 <= n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9))))))
lola: processed formula: A (X (X (X (X ((a3 <= n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9))))))
lola: processed formula length: 103
lola: 0 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 704 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: RESULT
lola:
SUMMARY: no no unknown no no yes no yes no no yes yes yes no yes yes
lola: ========================================
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496384222871

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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="S_QuasiCertifProtocol-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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/S_QuasiCertifProtocol-PT-10.tgz
mv S_QuasiCertifProtocol-PT-10 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_QuasiCertifProtocol-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r138-smll-149479231800257"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;