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 900K
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 481K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PermAdmissibility-PT-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666474100486
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527154019021


BK_STOP 1527154591163

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PermAdmissibility-PT-05 as instance name.
Using PermAdmissibility 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': False, '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': None}.
Known tools are: [{'Time': 1671517, 'Memory': 15938.78, 'Tool': 'lola'}, {'Time': 1676795, 'Memory': 15937.75, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola PermAdmissibility-PT-05...

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


checking for too many tokens
===========================================================================================
PermAdmissibility-PT-05: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PermAdmissibility-PT-05 @ 3539 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-PT-05-CTLCardinality.task
lola: A (G (E (X (((2 <= aux5_0 + aux5_1 + aux5_4 + aux5_5) OR (2 <= c17)))))) : E (F ((E (G ((c15 <= c110))) OR ()))) : (E (G (E (G ((c5 <= in1_0 + in1_1))))) AND (c11 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)) : E ((A (G ((1 <= in1_0 + in1_1))) U E (G ((2 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7))))) : NOT(((E (G ((c18 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7))) AND ((3 <= in1_0 + in1_1) AND (c16 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7) AND (c20 <= 0))) AND (out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= 2))) : A (F (A (G ((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= 0))))) : A (G (A (F ((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= 0))))) : (A (G ((c19 <= in1_0 + in1_1))) AND A (X (((c5 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7) OR (3 <= c14) OR (aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7))))) : (((aux15_4 <= 0) AND (out8_4 <= 2) AND (2 <= aux10_5) AND (1 <= aux11_2) AND (1 <= aux13_4) AND (3 <= aux7_2)) OR NOT(E (G ((out5_4 <= out4_4))))) : E (G ((aux16_1 <= out5_0))) : A (G (NOT(E (G ((3 <= out5_1)))))) : A (F (A (X ((1 <= out5_7))))) : A (X ((E (G ((aux6_4 <= c19))) AND A (X ((aux14_2 <= out4_7)))))) : NOT((((aux10_4 + 1 <= out6_7) AND (aux16_0 <= 1) AND (out2_2 <= 2) AND (aux16_7 + 1 <= out4_6)) OR (((1 <= aux7_2) OR (1 <= aux16_3) OR (2 <= aux14_7)) OR A (F ((3 <= out5_2)))))) : NOT((E (((aux6_0 <= out6_1) U (1 <= out2_4))) OR A (X ((in4_6 <= 1))))) : A (G (A (G ((aux12_4 <= out1_1)))))
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 (E (X (((2 <= aux5_0 + aux5_1 + aux5_4 + aux5_5) OR (2 <= c17))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(((2 <= aux5_0 + aux5_1 + aux5_4 + aux5_5) OR (2 <= c17))))))
lola: processed formula length: 81
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-05-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 69 markings, 68 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((c15 <= c110))) OR ())))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (c110 + 1 <= c15))))
lola: processed formula length: 42
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-05-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: 1043763 markings, 2312951 edges, 2256899760931733504 markings/sec, 0 secs
lola: 2033577 markings, 4601824 edges, 197963 markings/sec, 5 secs
lola: 2995604 markings, 7032556 edges, 192405 markings/sec, 10 secs
lola: 3957535 markings, 9322585 edges, 192386 markings/sec, 15 secs
lola: 4940657 markings, 11681027 edges, 196624 markings/sec, 20 secs
lola: 5930315 markings, 14142362 edges, 197932 markings/sec, 25 secs
lola: 6949888 markings, 16524351 edges, 203915 markings/sec, 30 secs
lola: 7924368 markings, 18950500 edges, 194896 markings/sec, 35 secs
lola: 8925864 markings, 21198436 edges, 200299 markings/sec, 40 secs
lola: 9919794 markings, 23708597 edges, 198786 markings/sec, 45 secs
lola: 10874435 markings, 26008143 edges, 190928 markings/sec, 50 secs
lola: 11808877 markings, 28252249 edges, 186888 markings/sec, 55 secs
lola: 12714686 markings, 30569372 edges, 181162 markings/sec, 60 secs
lola: 13653302 markings, 32748720 edges, 187723 markings/sec, 65 secs
lola: 14613819 markings, 34870435 edges, 192103 markings/sec, 70 secs
lola: 15513706 markings, 37127832 edges, 179977 markings/sec, 75 secs
lola: 16505704 markings, 39340979 edges, 198400 markings/sec, 80 secs
lola: 17473142 markings, 41802602 edges, 193488 markings/sec, 85 secs
lola: 18458641 markings, 44085844 edges, 197100 markings/sec, 90 secs
lola: 19359858 markings, 46396623 edges, 180243 markings/sec, 95 secs
lola: 20218987 markings, 48783619 edges, 171826 markings/sec, 100 secs
lola: 21096823 markings, 50836019 edges, 175567 markings/sec, 105 secs
lola: 21880243 markings, 52947241 edges, 156684 markings/sec, 110 secs
lola: 22711539 markings, 55141766 edges, 166259 markings/sec, 115 secs
lola: 23555651 markings, 57307655 edges, 168822 markings/sec, 120 secs
lola: 24459700 markings, 59523787 edges, 180810 markings/sec, 125 secs
lola: 25337638 markings, 61913327 edges, 175588 markings/sec, 130 secs
lola: 26194656 markings, 64255336 edges, 171404 markings/sec, 135 secs
lola: 27101302 markings, 66545911 edges, 181329 markings/sec, 140 secs
lola: 27982889 markings, 69010588 edges, 176317 markings/sec, 145 secs
lola: 28935463 markings, 71539556 edges, 190515 markings/sec, 150 secs
lola: 29795129 markings, 74130241 edges, 171933 markings/sec, 155 secs
lola: 30641986 markings, 76832755 edges, 169371 markings/sec, 160 secs
lola: 31571334 markings, 79079046 edges, 185870 markings/sec, 165 secs
lola: 32470327 markings, 81434158 edges, 179799 markings/sec, 170 secs
lola: 33349554 markings, 83761543 edges, 175845 markings/sec, 175 secs
lola: 34235226 markings, 85916906 edges, 177134 markings/sec, 180 secs
lola: 35081963 markings, 88320817 edges, 169347 markings/sec, 185 secs
lola: 35908685 markings, 90660377 edges, 165344 markings/sec, 190 secs
lola: 36782687 markings, 92815595 edges, 174800 markings/sec, 195 secs
lola: 37594067 markings, 95077412 edges, 162276 markings/sec, 200 secs
lola: 38413404 markings, 97562374 edges, 163867 markings/sec, 205 secs
lola: 39228891 markings, 99973550 edges, 163097 markings/sec, 210 secs
lola: 40055791 markings, 102310699 edges, 165380 markings/sec, 215 secs
lola: 40870316 markings, 104377054 edges, 162905 markings/sec, 220 secs
lola: 41759952 markings, 106578253 edges, 177927 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (G ((c5 <= in1_0 + in1_1))))) AND (c11 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((c5 <= in1_0 + in1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (in1_0 + in1_1 + 1 <= c5))))
lola: processed formula length: 50
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-05-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 81 markings, 241 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (c11 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (c11 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)
lola: processed formula length: 78
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-05-CTLCardinality.task
lola: processed formula with 1 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((1 <= in1_0 + in1_1))) U E (G ((2 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U (in1_0 + in1_1 <= 0))) U NOT(A(TRUE U (out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7 <= 1))))
lola: processed formula length: 132
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-05-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: 11 markings, 12 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((c18 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7))) AND ((3 <= in1_0 + in1_1) AND (c16 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7) AND (c20 <= 0))) AND (out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7 + 1 <= c18)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7 + 1 <= c18)))
lola: processed formula: A (F ((aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7 + 1 <= c18)))
lola: processed formula length: 98
lola: 8 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-05-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 31 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: 81 markings, 81 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((in1_0 + in1_1 <= 2) OR (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 + 1 <= c16) OR (1 <= c20)) OR (3 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((in1_0 + in1_1 <= 2) OR (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 + 1 <= c16) OR (1 <= c20)) OR (3 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7))
lola: processed formula length: 214
lola: 9 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-05-CTLCardinality.task
lola: processed formula with 4 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= 0)))))
lola: processed formula: A (F (A (G ((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= 0)))))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-05-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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: 82 markings, 83 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= 0)))))
lola: processed formula length: 114
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-05-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 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: 1072579 markings, 2229076 edges, 1953358685363240960 markings/sec, 0 secs
lola: 1961605 markings, 4722836 edges, 177805 markings/sec, 5 secs
lola: 2910960 markings, 7247637 edges, 189871 markings/sec, 10 secs
lola: 3815465 markings, 9570551 edges, 180901 markings/sec, 15 secs
lola: 4724761 markings, 12011293 edges, 181859 markings/sec, 20 secs
lola: 5559649 markings, 14351014 edges, 166978 markings/sec, 25 secs
lola: 6466977 markings, 16659393 edges, 181466 markings/sec, 30 secs
lola: 7369059 markings, 18982879 edges, 180416 markings/sec, 35 secs
lola: 8211686 markings, 21244824 edges, 168525 markings/sec, 40 secs
lola: 9007810 markings, 23753077 edges, 159225 markings/sec, 45 secs
lola: 9752708 markings, 26209352 edges, 148980 markings/sec, 50 secs
lola: 10572563 markings, 28716879 edges, 163971 markings/sec, 55 secs
lola: 11486508 markings, 31036385 edges, 182789 markings/sec, 60 secs
lola: 12340752 markings, 33427668 edges, 170849 markings/sec, 65 secs
lola: 13264067 markings, 35846156 edges, 184663 markings/sec, 70 secs
lola: 14111345 markings, 38383842 edges, 169456 markings/sec, 75 secs
lola: 15094201 markings, 40823923 edges, 196571 markings/sec, 80 secs
lola: 15924925 markings, 43239074 edges, 166145 markings/sec, 85 secs
lola: 16819598 markings, 45563448 edges, 178935 markings/sec, 90 secs
lola: 17641318 markings, 47975241 edges, 164344 markings/sec, 95 secs
lola: 18536705 markings, 50476608 edges, 179077 markings/sec, 100 secs
lola: 19466735 markings, 52772537 edges, 186006 markings/sec, 105 secs
lola: 20353214 markings, 55067853 edges, 177296 markings/sec, 110 secs
lola: 21168621 markings, 57509520 edges, 163081 markings/sec, 115 secs
lola: 22079214 markings, 59890150 edges, 182119 markings/sec, 120 secs
lola: 22981903 markings, 62228615 edges, 180538 markings/sec, 125 secs
lola: 23836576 markings, 64772100 edges, 170935 markings/sec, 130 secs
lola: 24698976 markings, 67379858 edges, 172480 markings/sec, 135 secs
lola: 25514376 markings, 69915295 edges, 163080 markings/sec, 140 secs
lola: 26307913 markings, 72722198 edges, 158707 markings/sec, 145 secs
lola: 27216027 markings, 74829284 edges, 181623 markings/sec, 150 secs
lola: 28001689 markings, 77149335 edges, 157132 markings/sec, 155 secs
lola: 28820717 markings, 79242497 edges, 163806 markings/sec, 160 secs
lola: 29518225 markings, 81382000 edges, 139502 markings/sec, 165 secs
lola: 30290147 markings, 83359583 edges, 154384 markings/sec, 170 secs
lola: 31024591 markings, 85459381 edges, 146889 markings/sec, 175 secs
lola: 31870611 markings, 87454365 edges, 169204 markings/sec, 180 secs
lola: 32639508 markings, 89607394 edges, 153779 markings/sec, 185 secs
lola: 33332445 markings, 91790222 edges, 138587 markings/sec, 190 secs
lola: 34134246 markings, 93732252 edges, 160360 markings/sec, 195 secs
lola: 34839085 markings, 95766741 edges, 140968 markings/sec, 200 secs
lola: 35536449 markings, 97803465 edges, 139473 markings/sec, 205 secs
lola: 36278344 markings, 99773131 edges, 148379 markings/sec, 210 secs
lola: 36950110 markings, 102038656 edges, 134353 markings/sec, 215 secs
lola: 37690509 markings, 104417639 edges, 148080 markings/sec, 220 secs
lola: 38386035 markings, 106748285 edges, 139105 markings/sec, 225 secs
lola: 39023760 markings, 109040328 edges, 127545 markings/sec, 230 secs
lola: 39638750 markings, 111386194 edges, 122998 markings/sec, 235 secs
lola: 40463840 markings, 113436407 edges, 165018 markings/sec, 240 secs
lola: 41231883 markings, 115746845 edges, 153609 markings/sec, 245 secs
lola: 42060320 markings, 117833206 edges, 165687 markings/sec, 250 secs
lola: 42828548 markings, 119875892 edges, 153646 markings/sec, 255 secs
lola: 43563314 markings, 122120184 edges, 146953 markings/sec, 260 secs
lola: 44315173 markings, 124446411 edges, 150372 markings/sec, 265 secs
lola: 44992995 markings, 126728488 edges, 135564 markings/sec, 270 secs
lola: 45817948 markings, 128884299 edges, 164991 markings/sec, 275 secs
lola: 46654479 markings, 131388071 edges, 167306 markings/sec, 280 secs
lola: 47596523 markings, 133664822 edges, 188409 markings/sec, 285 secs
lola: 48419161 markings, 136193988 edges, 164528 markings/sec, 290 secs
lola: 49210839 markings, 138668682 edges, 158336 markings/sec, 295 secs
lola: 49848909 markings, 141163336 edges, 127614 markings/sec, 300 secs
lola: 50827135 markings, 143273349 edges, 195645 markings/sec, 305 secs
lola: 51627780 markings, 145469969 edges, 160129 markings/sec, 310 secs
lola: 52361638 markings, 147795906 edges, 146772 markings/sec, 315 secs
lola: 53230804 markings, 149753827 edges, 173833 markings/sec, 320 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: '\ufffd'
Aborted (core dumped)
FORMULA PermAdmissibility-PT-05-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-05-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-05-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-05-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-05-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-05-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-05-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-05-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-05-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-05-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-05-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-05-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-05-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-05-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-05-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-05-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="PermAdmissibility-PT-05"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
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/PermAdmissibility-PT-05.tgz
mv PermAdmissibility-PT-05 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-structural"
echo " Input is PermAdmissibility-PT-05, 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 r115-csrt-152666474100486"
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 ;