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)
........................
/home/mcc/execution
total 572K
-rw-r--r-- 1 mcc users 9.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 290K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is QuasiCertifProtocol-PT-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-qhx2-152673580500073
=====================================================================

--------------------
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-PT-10-CTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527144874044


BK_STOP 1527145741099

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using QuasiCertifProtocol-PT-10 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 1129093, 'Memory': 15948.05, 'Tool': 'lola'}, {'Time': 1137285, 'Memory': 15948.24, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola QuasiCertifProtocol-PT-10...

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


checking for too many tokens
===========================================================================================
QuasiCertifProtocol-PT-10: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ QuasiCertifProtocol-PT-10 @ 3538 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 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-PT-10-CTLCardinality.task
lola: NOT(A (G (((1 <= Astart) OR (n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= AstopOK) OR (SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= a2) OR (1 <= AstopAbort))))) : (E (G (((CstopAbort + 1 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6) OR ((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 <= a2) AND (2 <= a2))))) OR NOT(A (G (((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 <= n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9) OR (s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10 <= a1)))))) : E ((A (G ((1 <= n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9))) U A (F ((2 <= n5_10 + n5_0 + n5_1 + n5_2 + n5_3 + n5_4 + n5_5 + n5_6 + n5_7 + n5_8 + n5_9))))) : E (F ((E (G ((n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9 <= AstopOK))) AND ((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 + 1 <= SstopAbort) AND (Astart + 1 <= a4))))) : (E (X ((1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10))) OR ((A (G ((SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= 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))) AND A (G ((1 <= n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9)))) OR E (((AstopAbort <= Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0) U (3 <= s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10))))) : ((A (G (((CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= malicious_reservoir) AND (3 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10)))) AND (((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 <= a3) AND (1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10) AND ((s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10 <= a5) OR (a3 <= a2))) AND A (G ((1 <= c1_8 + c1_7 + c1_6 + c1_5 + c1_4 + c1_3 + c1_2 + c1_1 + c1_0 + c1_10 + c1_9))))) OR (E (X ((AstopOK <= 0))) AND E (((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= Cstart_10 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + Cstart_7 + Cstart_8 + Cstart_9) U (Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10))))) : ((((n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 <= a1) AND (CstopAbort <= 0) AND ((1 <= a5) OR (CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10) OR (s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10 <= AstopAbort))) AND A (((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 <= a4) U (Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9)))) AND ((((a4 + 1 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6) AND (AstopOK <= 2)) OR (2 <= 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)) OR E (X (((a5 <= Astart) AND (a1 <= malicious_reservoir)))))) : A (F (A (X (((1 <= AstopAbort) OR (1 <= AstopOK)))))) : NOT(E (G (A (F ((2 <= n7_9_3)))))) : A (G (NOT(E (X ((2 <= n7_4_7)))))) : A (G (E (F ((1 <= n7_0_5))))) : E (G (A (G ((n7_5_2 <= 0))))) : A ((A (X ((n8_7_9 <= n7_1_8))) U E (X ((2 <= n7_6_7))))) : E (F (A (G ((2 <= n8_9_7))))) : A (X (A (G (((3 <= n8_0_9) OR (n7_0_0 <= n8_6_4)))))) : A (G (E (((n9_10_8 <= SstopOK_9) U (1 <= n8_6_4)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((1 <= Astart) OR (n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= AstopOK) OR (SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= a2) OR (1 <= AstopAbort)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 64 markings, 63 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-CTLCardinality.sara
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((CstopAbort + 1 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6) OR ((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 <= a2) AND (2 <= a2))))) OR NOT(A (G (((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 <= n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((CstopAbort + 1 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6) OR ((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 <= a2) AND (2 <= a2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= CstopAbort) AND ((a2 + 1 <= s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9) OR (a2 <= 1)))))
lola: processed formula length: 271
lola: 5 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9 + 1 <= s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9) AND (a1 + 1 <= 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 reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-PT-10-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((1 <= n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9))) U A (F ((2 <= 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 CTL
lola: processed formula: E(NOT(E(TRUE U (n2_10 + n2_0 + n2_1 + n2_2 + n2_3 + n2_4 + n2_5 + n2_6 + n2_7 + n2_8 + n2_9 <= 0))) U A(TRUE U (2 <= 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: 195
lola: 4 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 14 markings, 15 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9 <= AstopOK))) AND ((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 + 1 <= SstopAbort) AND (Astart + 1 <= a4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U (AstopOK + 1 <= n4_10 + n4_0 + n4_1 + n4_2 + n4_3 + n4_4 + n4_5 + n4_6 + n4_7 + n4_8 + n4_9))) AND ((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 + 1 <= SstopAbort) AND (Astart + 1 <= a4))))
lola: processed formula length: 244
lola: 3 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 301527 markings, 2569235 edges, 3689320832170983424 markings/sec, 0 secs
lola: 591550 markings, 5115871 edges, 58005 markings/sec, 5 secs
lola: 855617 markings, 7589283 edges, 52813 markings/sec, 10 secs
lola: 1092194 markings, 9944393 edges, 47315 markings/sec, 15 secs
lola: 1288191 markings, 12158956 edges, 39199 markings/sec, 20 secs
lola: 1531449 markings, 14267501 edges, 48652 markings/sec, 25 secs
lola: 1781590 markings, 16540006 edges, 50028 markings/sec, 30 secs
lola: 2042287 markings, 18864483 edges, 52139 markings/sec, 35 secs
lola: 2271469 markings, 21062652 edges, 45836 markings/sec, 40 secs
lola: 2479326 markings, 23216196 edges, 41571 markings/sec, 45 secs
lola: 2750075 markings, 25510890 edges, 54150 markings/sec, 50 secs
lola: 3037099 markings, 27852286 edges, 57405 markings/sec, 55 secs
lola: 3314489 markings, 30111913 edges, 55478 markings/sec, 60 secs
lola: 3572648 markings, 32361182 edges, 51632 markings/sec, 65 secs
lola: 3798539 markings, 34491577 edges, 45178 markings/sec, 70 secs
lola: 3994132 markings, 36563861 edges, 39119 markings/sec, 75 secs
lola: 4226922 markings, 38743817 edges, 46558 markings/sec, 80 secs
lola: 4448658 markings, 40923716 edges, 44347 markings/sec, 85 secs
lola: 4659692 markings, 43074836 edges, 42207 markings/sec, 90 secs
lola: 4860284 markings, 45158920 edges, 40118 markings/sec, 95 secs
lola: 5061173 markings, 47229469 edges, 40178 markings/sec, 100 secs
lola: 5252615 markings, 49268181 edges, 38288 markings/sec, 105 secs
lola: 5428507 markings, 51264644 edges, 35178 markings/sec, 110 secs
lola: 5587657 markings, 53210288 edges, 31830 markings/sec, 115 secs
lola: 5867623 markings, 55473548 edges, 55993 markings/sec, 120 secs
lola: 6137736 markings, 57731871 edges, 54023 markings/sec, 125 secs
lola: 6391783 markings, 59918157 edges, 50809 markings/sec, 130 secs
lola: 6603393 markings, 62000442 edges, 42322 markings/sec, 135 secs
lola: 6837865 markings, 64150543 edges, 46894 markings/sec, 140 secs
lola: 7108180 markings, 66417586 edges, 54063 markings/sec, 145 secs
lola: 7341290 markings, 68538375 edges, 46622 markings/sec, 150 secs
lola: 7543152 markings, 70586620 edges, 40372 markings/sec, 155 secs
lola: 7807020 markings, 72831270 edges, 52774 markings/sec, 160 secs
lola: 8036721 markings, 74983295 edges, 45940 markings/sec, 165 secs
lola: 8251664 markings, 77091066 edges, 42989 markings/sec, 170 secs
lola: 8491175 markings, 79279173 edges, 47902 markings/sec, 175 secs
lola: 8686963 markings, 81313096 edges, 39158 markings/sec, 180 secs
lola: 8923973 markings, 83472443 edges, 47402 markings/sec, 185 secs
lola: 9120838 markings, 85498115 edges, 39373 markings/sec, 190 secs
lola: 9329156 markings, 87529675 edges, 41664 markings/sec, 195 secs
lola: 9523807 markings, 89541022 edges, 38930 markings/sec, 200 secs
lola: 9708864 markings, 91494645 edges, 37011 markings/sec, 205 secs
lola: 9892694 markings, 93446972 edges, 36766 markings/sec, 210 secs
lola: 10056165 markings, 95290394 edges, 32694 markings/sec, 215 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 10124858 markings, 96057732 edges
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X ((1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10))) OR ((A (G ((SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= 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_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10))
lola: processed formula length: 86
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6 <= 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 + n... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 82 markings, 81 edges
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((AstopAbort <= Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0) U (3 <= s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s5_8 + s5_9 + s5_10)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((AstopAbort <= Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0) U (3 <= 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 length: 223
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 339890 markings, 2194279 edges, 2919057411576692736 markings/sec, 0 secs
lola: 652479 markings, 4425517 edges, 62518 markings/sec, 5 secs
lola: 948746 markings, 6587390 edges, 59253 markings/sec, 10 secs
lola: 1202547 markings, 8711790 edges, 50760 markings/sec, 15 secs
lola: 1481929 markings, 10833584 edges, 55876 markings/sec, 20 secs
lola: 1779478 markings, 12931417 edges, 59510 markings/sec, 25 secs
lola: 2077419 markings, 15018968 edges, 59588 markings/sec, 30 secs
lola: 2340645 markings, 17042495 edges, 52645 markings/sec, 35 secs
lola: 2570361 markings, 19014421 edges, 45943 markings/sec, 40 secs
lola: 3005832 markings, 20657682 edges, 87094 markings/sec, 45 secs
lola: 3427671 markings, 22327980 edges, 84368 markings/sec, 50 secs
lola: 3802060 markings, 23957671 edges, 74878 markings/sec, 55 secs
lola: 4084332 markings, 25877690 edges, 56454 markings/sec, 60 secs
lola: 4331661 markings, 27853223 edges, 49466 markings/sec, 65 secs
lola: 4596256 markings, 29887980 edges, 52919 markings/sec, 70 secs
lola: 4834446 markings, 31805031 edges, 47638 markings/sec, 75 secs
lola: 5060670 markings, 33734559 edges, 45245 markings/sec, 80 secs
lola: 5278073 markings, 35616123 edges, 43481 markings/sec, 85 secs
lola: 5476143 markings, 37491029 edges, 39614 markings/sec, 90 secs
lola: 5727154 markings, 39232915 edges, 50202 markings/sec, 95 secs
lola: 6133331 markings, 40839516 edges, 81235 markings/sec, 100 secs
lola: 6502907 markings, 42396969 edges, 73915 markings/sec, 105 secs
lola: 6836019 markings, 43942668 edges, 66622 markings/sec, 110 secs
lola: 7241441 markings, 45581340 edges, 81084 markings/sec, 115 secs
lola: 7585817 markings, 47178938 edges, 68875 markings/sec, 120 secs
lola: 7972441 markings, 48807017 edges, 77325 markings/sec, 125 secs
lola: 8324666 markings, 50405075 edges, 70445 markings/sec, 130 secs
lola: 8665930 markings, 52006104 edges, 68253 markings/sec, 135 secs
lola: 9020232 markings, 53588789 edges, 70860 markings/sec, 140 secs
lola: 9350610 markings, 55175814 edges, 66076 markings/sec, 145 secs
lola: 9662823 markings, 56721545 edges, 62443 markings/sec, 150 secs
lola: 9945621 markings, 58165517 edges, 56560 markings/sec, 155 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 10069678 markings, 58841954 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (((CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= malicious_reservoir) AND (3 <= s2_9 + s2_8 + s2_7 + s2_6 + s2_5 + s2_4 + s2_3 + s2_2 + s2_1 + s2_0 + s2_10)))) AND (((s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9 <= a3) AND (1 <= s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= malicious_reservoir) AND (3 <= 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 invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-10-CTLCardinality-5.sara
lola: ========================================
lola: subprocess 6 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((AstopOK <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((AstopOK <= 0))
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= Cstart_10 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + Cstart_7 + Cstart_8 + Cstart_9) U (Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((n6_0 + n6_1 + n6_2 + n6_3 + n6_4 + n6_5 + n6_6 + n6_7 + n6_8 + n6_9 + n6_10 <= Cstart_10 + Cstart_0 + Cstart_1 + Cstart_2 + Cstart_3 + Cstart_4 + Cstart_5 + Cstart_6 + Cstart_7 + Cstart_8 + Cstart_9) U (Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s... (shortened)
lola: processed formula length: 406
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 14 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 <= a1) AND (CstopAbort <= 0) AND ((1 <= a5) OR (CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10) OR (s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 <= a1) AND (CstopAbort <= 0) AND ((1 <= a5) OR (CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10) OR (s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((n3_9 + n3_8 + n3_7 + n3_6 + n3_5 + n3_4 + n3_3 + n3_2 + n3_1 + n3_0 + n3_10 <= a1) AND (CstopAbort <= 0) AND ((1 <= a5) OR (CstopOK_0 + CstopOK_1 + CstopOK_2 + CstopOK_3 + CstopOK_4 + CstopOK_5 + CstopOK_6 + CstopOK_7 + CstopOK_8 + CstopOK_9 + CstopOK_10 <= s6_0 + s6_1 + s6_2 + s6_3 + s6_4 + s6_5 + s6_6 + s6_7 + s6_8 + s6_9 + s6_10) OR (s5_0 + s5_1 + s5_2 + s5_3 + s5_4 + s5_5 + s5_6 + s5_7 + s... (shortened)
lola: processed formula length: 435
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 <= a4) U (Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 <= a4) U (Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9)))
lola: processed formula: A (((s4_0 + s4_1 + s4_2 + s4_3 + s4_4 + s4_5 + s4_6 + s4_7 + s4_8 + s4_9 + s4_10 <= a4) U (Sstart_10 + Sstart_9 + Sstart_8 + Sstart_7 + Sstart_6 + Sstart_5 + Sstart_4 + Sstart_3 + Sstart_2 + Sstart_1 + Sstart_0 <= s3_8 + s3_7 + s3_6 + s3_5 + s3_4 + s3_3 + s3_2 + s3_1 + s3_0 + s3_10 + s3_9)))
lola: processed formula length: 292
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: the resulting B\xfcchi 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: 276766 markings, 1475680 edges, 55353 markings/sec, 0 secs
lola: 576045 markings, 3126851 edges, 59856 markings/sec, 5 secs
lola: 843519 markings, 4780965 edges, 53495 markings/sec, 10 secs
lola: 1096713 markings, 6525893 edges, 50639 markings/sec, 15 secs
lola: 1306894 markings, 8240819 edges, 42036 markings/sec, 20 secs
lola: 1578566 markings, 9694108 edges, 54334 markings/sec, 25 secs
lola: 1842168 markings, 11148559 edges, 52720 markings/sec, 30 secs
lola: 2101674 markings, 12692787 edges, 51901 markings/sec, 35 secs
lola: 2329503 markings, 14240864 edges, 45566 markings/sec, 40 secs
lola: 2530570 markings, 15820293 edges, 40213 markings/sec, 45 secs
lola: 2739417 markings, 17279907 edges, 41769 markings/sec, 50 secs
lola: 2979860 markings, 18726181 edges, 48089 markings/sec, 55 secs
lola: 3234972 markings, 20225266 edges, 51022 markings/sec, 60 secs
lola: 3477235 markings, 21747152 edges, 48453 markings/sec, 65 secs
lola: 3706318 markings, 23284664 edges, 45817 markings/sec, 70 secs
lola: 3911854 markings, 24809679 edges, 41107 markings/sec, 75 secs
lola: 4112501 markings, 26361604 edges, 40129 markings/sec, 80 secs
lola: 4281150 markings, 27907032 edges, 33730 markings/sec, 85 secs
lola: 4497017 markings, 29587719 edges, 43173 markings/sec, 90 secs
lola: 4750666 markings, 31285217 edges, 50730 markings/sec, 95 secs
lola: 4993726 markings, 32913270 edges, 48612 markings/sec, 100 secs
lola: 5223527 markings, 34530241 edges, 45960 markings/sec, 105 secs
lola: 5436064 markings, 36140049 edges, 42507 markings/sec, 110 secs
lola: 5634585 markings, 37772475 edges, 39704 markings/sec, 115 secs
lola: 5823093 markings, 39398083 edges, 37702 markings/sec, 120 secs
lola: 5987127 markings, 40971705 edges, 32807 markings/sec, 125 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: 6086657 markings, 41934939 edges
lola: ========================================
lola: subprocess 8 will run for 377 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((a4 + 1 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6) AND (AstopOK <= 2)) OR (2 <= 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... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((a4 + 1 <= SstopOK_10 + SstopOK_0 + SstopOK_1 + SstopOK_2 + SstopOK_3 + SstopOK_4 + SstopOK_5 + SstopOK_8 + SstopOK_9 + SstopOK_7 + SstopOK_6) AND (AstopOK <= 2)) OR (2 <= 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... (shortened)
lola: processed formula length: 1285
lola: 1 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: processed formula with 3 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 431 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((a5 <= Astart) AND (a1 <= malicious_reservoir))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((a5 <= Astart) AND (a1 <= malicious_reservoir)))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= AstopAbort) OR (1 <= AstopOK))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(((1 <= AstopAbort) OR (1 <= AstopOK))))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-PT-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 363358 markings, 1272976 edges, 3689329903141912576 markings/sec, 0 secs
lola: 697506 markings, 2551467 edges, 66830 markings/sec, 5 secs
lola: 1014197 markings, 3843886 edges, 63338 markings/sec, 10 secs
lola: 1282244 markings, 5117413 edges, 53609 markings/sec, 15 secs
lola: 1620025 markings, 6349080 edges, 67556 markings/sec, 20 secs
lola: 1940413 markings, 7570729 edges, 64078 markings/sec, 25 secs
lola: 2242984 markings, 8768076 edges, 60514 markings/sec, 30 secs
lola: 2506834 markings, 9919146 edges, 52770 markings/sec, 35 secs
lola: 2839568 markings, 11141382 edges, 66547 markings/sec, 40 secs
lola: 3159303 markings, 12346832 edges, 63947 markings/sec, 45 secs
lola: 3455059 markings, 13539707 edges, 59151 markings/sec, 50 secs
lola: 3725879 markings, 14726392 edges, 54164 markings/sec, 55 secs
lola: 3969889 markings, 15921389 edges, 48802 markings/sec, 60 secs
lola: 4260450 markings, 17113576 edges, 58112 markings/sec, 65 secs
lola: 4548858 markings, 18315531 edges, 57682 markings/sec, 70 secs
lola: 4817266 markings, 19502522 edges, 53682 markings/sec, 75 secs
lola: 5082196 markings, 20683924 edges, 52986 markings/sec, 80 secs
lola: 5323494 markings, 21841564 edges, 48260 markings/sec, 85 secs
lola: 5560990 markings, 22974329 edges, 47499 markings/sec, 90 secs
lola: 5882264 markings, 24185746 edges, 64255 markings/sec, 95 secs
lola: 6180289 markings, 25387515 edges, 59605 markings/sec, 100 secs
lola: 6455691 markings, 26601091 edges, 55080 markings/sec, 105 secs
lola: 6735912 markings, 27844145 edges, 56044 markings/sec, 110 secs
lola: 7052779 markings, 29116354 edges, 63373 markings/sec, 115 secs
lola: 7329648 markings, 30352544 edges, 55374 markings/sec, 120 secs
lola: 7614042 markings, 31601295 edges, 56879 markings/sec, 125 secs
lola: 7889249 markings, 32783259 edges, 55041 markings/sec, 130 secs
lola: 8141137 markings, 33966065 edges, 50378 markings/sec, 135 secs
lola: 8429916 markings, 35207462 edges, 57756 markings/sec, 140 secs
lola: 8684129 markings, 36428426 edges, 50843 markings/sec, 145 secs
lola: 8947793 markings, 37634646 edges, 52733 markings/sec, 150 secs
lola: 9201909 markings, 38829061 edges, 50823 markings/sec, 155 secs
lola: 9445113 markings, 40018655 edges, 48641 markings/sec, 160 secs
lola: 9677123 markings, 41183460 edges, 46402 markings/sec, 165 secs
lola: 9883383 markings, 42278298 edges, 41252 markings/sec, 170 secs
lola: 10153133 markings, 43333888 edges, 53950 markings/sec, 175 secs
lola: 10476476 markings, 44377191 edges, 64669 markings/sec, 180 secs
lola: 10796628 markings, 45481040 edges, 64030 markings/sec, 185 secs
lola: 11083118 markings, 46637195 edges, 57298 markings/sec, 190 secs
lola: 11398185 markings, 47801522 edges, 63013 markings/sec, 195 secs
lola: 11730893 markings, 48909631 edges, 66542 markings/sec, 200 secs
lola: 12043191 markings, 50058297 edges, 62460 markings/sec, 205 secs
lola: 12333681 markings, 51291719 edges, 58098 markings/sec, 210 secs
lola: 12674778 markings, 52415590 edges, 68219 markings/sec, 215 secs
lola: 12985835 markings, 53544026 edges, 62211 markings/sec, 220 secs
lola: 13264513 markings, 54729618 edges, 55736 markings/sec, 225 secs
lola: 13580689 markings, 55803356 edges, 63235 markings/sec, 230 secs
lola: 13879012 markings, 56903970 edges, 59665 markings/sec, 235 secs
lola: 14150133 markings, 58078832 edges, 54224 markings/sec, 240 secs
lola: 14470289 markings, 59166033 edges, 64031 markings/sec, 245 secs
lola: 14765500 markings, 60299810 edges, 59042 markings/sec, 250 secs
lola: 15055185 markings, 61474877 edges, 57937 markings/sec, 255 secs
lola: 15360869 markings, 62599812 edges, 61137 markings/sec, 260 secs
lola: 15632824 markings, 63776354 edges, 54391 markings/sec, 265 secs
lola: 15921398 markings, 64848644 edges, 57715 markings/sec, 270 secs
lola: 16190817 markings, 65987680 edges, 53884 markings/sec, 275 secs
lola: 16469529 markings, 67043189 edges, 55742 markings/sec, 280 secs
lola: 16728564 markings, 68162866 edges, 51807 markings/sec, 285 secs
lola: 17004748 markings, 69217499 edges, 55237 markings/sec, 290 secs
lola: 17266222 markings, 70347796 edges, 52295 markings/sec, 295 secs
lola: 17546086 markings, 71480204 edges, 55973 markings/sec, 300 secs
lola: 17814957 markings, 72639098 edges, 53774 markings/sec, 305 secs
lola: 18071644 markings, 73787069 edges, 51337 markings/sec, 310 secs
lola: 18306500 markings, 75021082 edges, 46971 markings/sec, 315 secs
lola: 18588117 markings, 76096169 edges, 56323 markings/sec, 320 secs
lola: 18847994 markings, 77265393 edges, 51975 markings/sec, 325 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-PT-10-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
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/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-PT-10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is QuasiCertifProtocol-PT-10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r138-qhx2-152673580500073"
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 ;