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 mcc4mcc-full
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 r118-csrt-152666478500486
=====================================================================

--------------------
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 1527295988846


BK_STOP 1527296559555

--------------------
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 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': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PermAdmissibility-PT-05...

Time: 3600 - MCC
----- Start make prepare stderr -----
----- Start make prepare stdout -----
===========================================================================================
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 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
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: 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 236 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: 1031415 markings, 2284651 edges, 2256899760931733504 markings/sec, 0 secs
lola: 2093914 markings, 4769189 edges, 212500 markings/sec, 5 secs
lola: 3050558 markings, 7185101 edges, 191329 markings/sec, 10 secs
lola: 4023713 markings, 9482927 edges, 194631 markings/sec, 15 secs
lola: 4977757 markings, 11774800 edges, 190809 markings/sec, 20 secs
lola: 5954468 markings, 14207001 edges, 195342 markings/sec, 25 secs
lola: 6960980 markings, 16551736 edges, 201302 markings/sec, 30 secs
lola: 7915484 markings, 18931071 edges, 190901 markings/sec, 35 secs
lola: 8911382 markings, 21165187 edges, 199180 markings/sec, 40 secs
lola: 9874519 markings, 23577673 edges, 192627 markings/sec, 45 secs
lola: 10836800 markings, 25913633 edges, 192456 markings/sec, 50 secs
lola: 11822645 markings, 28290440 edges, 197169 markings/sec, 55 secs
lola: 12746415 markings, 30638866 edges, 184754 markings/sec, 60 secs
lola: 13670710 markings, 32794673 edges, 184859 markings/sec, 65 secs
lola: 14597101 markings, 34839315 edges, 185278 markings/sec, 70 secs
lola: 15470592 markings, 37017756 edges, 174698 markings/sec, 75 secs
lola: 16380111 markings, 39057750 edges, 181904 markings/sec, 80 secs
lola: 17267997 markings, 41286225 edges, 177577 markings/sec, 85 secs
lola: 18185686 markings, 43370019 edges, 183538 markings/sec, 90 secs
lola: 19043646 markings, 45632308 edges, 171592 markings/sec, 95 secs
lola: 19902505 markings, 48022316 edges, 171772 markings/sec, 100 secs
lola: 20808361 markings, 50215461 edges, 181171 markings/sec, 105 secs
lola: 21630674 markings, 52344287 edges, 164463 markings/sec, 110 secs
lola: 22460835 markings, 54469412 edges, 166032 markings/sec, 115 secs
lola: 23287798 markings, 56676730 edges, 165393 markings/sec, 120 secs
lola: 24172611 markings, 58786779 edges, 176963 markings/sec, 125 secs
lola: 25034986 markings, 61089916 edges, 172475 markings/sec, 130 secs
lola: 25880691 markings, 63422837 edges, 169141 markings/sec, 135 secs
lola: 26766845 markings, 65564198 edges, 177231 markings/sec, 140 secs
lola: 27553945 markings, 67738987 edges, 157420 markings/sec, 145 secs
lola: 28378923 markings, 69993167 edges, 164996 markings/sec, 150 secs
lola: 29246664 markings, 72435571 edges, 173548 markings/sec, 155 secs
lola: 30064872 markings, 74996392 edges, 163642 markings/sec, 160 secs
lola: 30919233 markings, 77421692 edges, 170872 markings/sec, 165 secs
lola: 31734171 markings, 79513736 edges, 162988 markings/sec, 170 secs
lola: 32573862 markings, 81698567 edges, 167938 markings/sec, 175 secs
lola: 33425568 markings, 83908699 edges, 170341 markings/sec, 180 secs
lola: 34283055 markings, 86035385 edges, 171497 markings/sec, 185 secs
lola: 35091966 markings, 88344991 edges, 161782 markings/sec, 190 secs
lola: 35907352 markings, 90657293 edges, 163077 markings/sec, 195 secs
lola: 36733444 markings, 92708256 edges, 165218 markings/sec, 200 secs
lola: 37550509 markings, 94962337 edges, 163413 markings/sec, 205 secs
lola: 38384748 markings, 97484569 edges, 166848 markings/sec, 210 secs
lola: 39211718 markings, 99918983 edges, 165394 markings/sec, 215 secs
lola: 39993701 markings, 102172872 edges, 156397 markings/sec, 220 secs
lola: 40760599 markings, 104092113 edges, 153380 markings/sec, 225 secs
lola: 41597928 markings, 106168084 edges, 167466 markings/sec, 230 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 235 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 235 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: 1041000 markings, 2183435 edges, 1953358685363240960 markings/sec, 0 secs
lola: 1950559 markings, 4668131 edges, 181912 markings/sec, 5 secs
lola: 2850187 markings, 7089428 edges, 179926 markings/sec, 10 secs
lola: 3715879 markings, 9307718 edges, 173138 markings/sec, 15 secs
lola: 4572029 markings, 11625016 edges, 171230 markings/sec, 20 secs
lola: 5423256 markings, 13871962 edges, 170245 markings/sec, 25 secs
lola: 6322436 markings, 16304354 edges, 179836 markings/sec, 30 secs
lola: 7285308 markings, 18785990 edges, 192574 markings/sec, 35 secs
lola: 8198136 markings, 21185786 edges, 182566 markings/sec, 40 secs
lola: 9037809 markings, 23819969 edges, 167935 markings/sec, 45 secs
lola: 9844863 markings, 26541693 edges, 161411 markings/sec, 50 secs
lola: 10762866 markings, 29203678 edges, 183601 markings/sec, 55 secs
lola: 11719199 markings, 31712310 edges, 191267 markings/sec, 60 secs
lola: 12620449 markings, 34281142 edges, 180250 markings/sec, 65 secs
lola: 13586940 markings, 36744107 edges, 193298 markings/sec, 70 secs
lola: 14455991 markings, 39434110 edges, 173810 markings/sec, 75 secs
lola: 15479099 markings, 41905968 edges, 204622 markings/sec, 80 secs
lola: 16393392 markings, 44503568 edges, 182859 markings/sec, 85 secs
lola: 17330202 markings, 46977142 edges, 187362 markings/sec, 90 secs
lola: 18127954 markings, 49575056 edges, 159550 markings/sec, 95 secs
lola: 19066830 markings, 51928267 edges, 187775 markings/sec, 100 secs
lola: 20006054 markings, 54165170 edges, 187845 markings/sec, 105 secs
lola: 20837995 markings, 56568206 edges, 166388 markings/sec, 110 secs
lola: 21748177 markings, 58988490 edges, 182036 markings/sec, 115 secs
lola: 22663858 markings, 61366470 edges, 183136 markings/sec, 120 secs
lola: 23490069 markings, 63855779 edges, 165242 markings/sec, 125 secs
lola: 24400587 markings, 66414573 edges, 182104 markings/sec, 130 secs
lola: 25238732 markings, 68969478 edges, 167629 markings/sec, 135 secs
lola: 25974457 markings, 71623311 edges, 147145 markings/sec, 140 secs
lola: 26834803 markings, 73851505 edges, 172069 markings/sec, 145 secs
lola: 27612948 markings, 75958286 edges, 155629 markings/sec, 150 secs
lola: 28359998 markings, 78097783 edges, 149410 markings/sec, 155 secs
lola: 29118430 markings, 80131271 edges, 151686 markings/sec, 160 secs
lola: 29851449 markings, 82199299 edges, 146604 markings/sec, 165 secs
lola: 30575896 markings, 84266587 edges, 144889 markings/sec, 170 secs
lola: 31386248 markings, 86300735 edges, 162070 markings/sec, 175 secs
lola: 32197902 markings, 88275838 edges, 162331 markings/sec, 180 secs
lola: 32907544 markings, 90476637 edges, 141928 markings/sec, 185 secs
lola: 33660318 markings, 92566743 edges, 150555 markings/sec, 190 secs
lola: 34465449 markings, 94634930 edges, 161026 markings/sec, 195 secs
lola: 35187733 markings, 96904963 edges, 144457 markings/sec, 200 secs
lola: 36026859 markings, 99060753 edges, 167825 markings/sec, 205 secs
lola: 36772418 markings, 101351551 edges, 149112 markings/sec, 210 secs
lola: 37493856 markings, 103724170 edges, 144288 markings/sec, 215 secs
lola: 38219038 markings, 106173221 edges, 145036 markings/sec, 220 secs
lola: 38887915 markings, 108569414 edges, 133775 markings/sec, 225 secs
lola: 39552139 markings, 111018158 edges, 132845 markings/sec, 230 secs
lola: 40390515 markings, 113243914 edges, 167675 markings/sec, 235 secs
lola: 41174367 markings, 115602187 edges, 156770 markings/sec, 240 secs
lola: 42011350 markings, 117699841 edges, 167397 markings/sec, 245 secs
lola: 42795241 markings, 119797562 edges, 156778 markings/sec, 250 secs
lola: 43520014 markings, 122005721 edges, 144955 markings/sec, 255 secs
lola: 44261425 markings, 124263951 edges, 148282 markings/sec, 260 secs
lola: 44972762 markings, 126665901 edges, 142267 markings/sec, 265 secs
lola: 45831592 markings, 128947132 edges, 171766 markings/sec, 270 secs
lola: 46636985 markings, 131329518 edges, 161079 markings/sec, 275 secs
lola: 47545783 markings, 133502722 edges, 181760 markings/sec, 280 secs
lola: 48317064 markings, 135892755 edges, 154256 markings/sec, 285 secs
lola: 49069712 markings, 138164729 edges, 150530 markings/sec, 290 secs
lola: 49717220 markings, 140602307 edges, 129502 markings/sec, 295 secs
lola: 50610266 markings, 142748172 edges, 178609 markings/sec, 300 secs
lola: 51433292 markings, 144897889 edges, 164605 markings/sec, 305 secs
lola: 52172817 markings, 147130917 edges, 147905 markings/sec, 310 secs
lola: 53012739 markings, 149215542 edges, 167984 markings/sec, 315 secs
lola: 53781999 markings, 151421511 edges, 153852 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)
----- Kill lola and sara stderr -----
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 -----
----- Finished stdout -----
----- 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="PermAdmissibility-PT-05"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-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/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 mcc4mcc-full"
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 r118-csrt-152666478500486"
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 ;