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 836K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K 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.1K 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 6.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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 21K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K 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 484K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PermAdmissibility-PT-50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478600507
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527296400352


BK_STOP 1527296809629

--------------------
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-50 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': 2664949, 'Memory': 15952.22, 'Tool': 'lola'}, {'Time': 2665565, 'Memory': 15952.27, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PermAdmissibility-PT-50...

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


checking for too many tokens
===========================================================================================
PermAdmissibility-PT-50: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PermAdmissibility-PT-50 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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-50-CTLCardinality.task
lola: (((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) AND E (G ((aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 + 1 <= c15)))) OR E (F (((2 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) AND (2 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) AND (3 <= c7))))) : (E (((c13 <= 1) U (c14 + 1 <= c11))) AND E (F (E (F ((c8 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)))))) : E (((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= 1) U (aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7 + 1 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7))) : (NOT(A (F (((c12 <= c5) AND (c17 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))))) OR E (F (A (X ((1 <= c9)))))) : A (F ((A (F ((1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))) AND ((c16 <= 1) AND (c15 <= 2))))) : (E (((c15 <= c13) U ((out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) AND (3 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))) AND A ((((3 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7) AND (1 <= c14)) U ((3 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) OR (3 <= in1_0 + in1_1))))) : (NOT((E (G ((c16 <= c14))) AND (out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7 <= aux8_2 + aux8_3 + aux8_6 + aux8_7))) OR NOT(((in2_2 + in2_3 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7) OR A (G ((1 <= in3_4 + in3_5)))))) : A (F (A (G ((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 + 1 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7))))) : E (X (NOT(A (F ((2 <= out4_0)))))) : (NOT(NOT(A (G ((out4_3 <= c9))))) AND (NOT(A (G ((c18 <= aux11_4)))) OR E (F (((1 <= c110) AND (aux16_5 <= out8_5)))))) : A (((aux15_3 <= out1_7) U A (X ((1 <= aux15_7))))) : E (G (((aux11_0 <= 1) AND (aux13_2 <= 2) AND (aux9_4 <= 2) AND (out7_6 <= 1)))) : NOT(((A (G ((c15 <= out8_2))) OR (out3_1 + 1 <= out5_3)) OR ((out6_4 <= c110) AND A (G ((3 <= in4_7)))))) : E (G ((out8_3 <= aux11_2))) : E (F (E (((out8_2 <= c8) U (1 <= aux15_0))))) : E (F (A (X (((1 <= out4_1) OR (aux5_4 <= aux9_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: (((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) AND E (G ((aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 + 1 <= c15)))) OR E (F (((2 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) AND (2 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) AND (3 <= c7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (aux5_0 + aux5_1 + aux5_4 + aux5_5 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (aux5_0 + aux5_1 + aux5_4 + aux5_5 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7)
lola: processed formula length: 108
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-50-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: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 + 1 <= c15)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (c15 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7)))
lola: processed formula length: 101
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-50-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 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 (((2 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) AND (2 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) AND (3 <= c7))))
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 544 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 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 37 markings, 36 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((c13 <= 1) U (c14 + 1 <= c11))) AND E (F (E (F ((c8 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((c13 <= 1) U (c14 + 1 <= c11)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((c13 <= 1) U (c14 + 1 <= c11))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-50-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 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: 105 markings, 104 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((c8 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)))
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 544 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to PermAdmissibility-PT-50-CTLCardinality-2.sara
lola: 0 markings, 0 edges
lola: lola: ========================================SUBRESULT

lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= 1) U (aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7 + 1 <= 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((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= 1) U (aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7 + 1 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7))
lola: processed formula length: 238
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-50-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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file PermAdmissibility-PT-50-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: 1552684 markings, 1713082 edges, 3225752436249460736 markings/sec, 0 secs
lola: 3055680 markings, 3406057 edges, 300599 markings/sec, 5 secs
lola: 4488653 markings, 5016242 edges, 286595 markings/sec, 10 secs
lola: 5952252 markings, 6682582 edges, 292720 markings/sec, 15 secs
lola: 7421007 markings, 8355764 edges, 293751 markings/sec, 20 secs
lola: 8894467 markings, 10023345 edges, 294692 markings/sec, 25 secs
lola: 10356089 markings, 11681874 edges, 292324 markings/sec, 30 secs
lola: 11747316 markings, 13280965 edges, 278245 markings/sec, 35 secs
lola: 13201363 markings, 14940509 edges, 290809 markings/sec, 40 secs
lola: 14609101 markings, 16563374 edges, 281548 markings/sec, 45 secs
lola: 16096133 markings, 18292618 edges, 297406 markings/sec, 50 secs
lola: 17463495 markings, 19846392 edges, 273472 markings/sec, 55 secs
lola: 18902737 markings, 21495136 edges, 287848 markings/sec, 60 secs
lola: 20301178 markings, 23091164 edges, 279688 markings/sec, 65 secs
lola: 21611131 markings, 24583919 edges, 261991 markings/sec, 70 secs
lola: 23017025 markings, 26204871 edges, 281179 markings/sec, 75 secs
lola: 24304810 markings, 27669269 edges, 257557 markings/sec, 80 secs
lola: 25585803 markings, 29145685 edges, 256199 markings/sec, 85 secs
lola: 26987513 markings, 30770477 edges, 280342 markings/sec, 90 secs
lola: 28438480 markings, 32458817 edges, 290193 markings/sec, 95 secs
lola: 29903154 markings, 34139418 edges, 292935 markings/sec, 100 secs
lola: 31252724 markings, 35697025 edges, 269914 markings/sec, 105 secs
lola: 32595229 markings, 37260405 edges, 268501 markings/sec, 110 secs
lola: 33995450 markings, 38892808 edges, 280044 markings/sec, 115 secs
lola: 35256855 markings, 40360115 edges, 252281 markings/sec, 120 secs
lola: 36724546 markings, 42101064 edges, 293538 markings/sec, 125 secs
lola: 37970765 markings, 43511516 edges, 249244 markings/sec, 130 secs
lola: 39232945 markings, 44957898 edges, 252436 markings/sec, 135 secs
lola: 40493586 markings, 46411735 edges, 252128 markings/sec, 140 secs
lola: 41970216 markings, 48117142 edges, 295326 markings/sec, 145 secs
lola: 43371480 markings, 49754093 edges, 280253 markings/sec, 150 secs
lola: 44731070 markings, 51297044 edges, 271918 markings/sec, 155 secs
lola: 45992611 markings, 52741308 edges, 252308 markings/sec, 160 secs
lola: 47273863 markings, 54216680 edges, 256250 markings/sec, 165 secs
lola: 48582439 markings, 55731299 edges, 261715 markings/sec, 170 secs
lola: 49958418 markings, 57330103 edges, 275196 markings/sec, 175 secs
lola: 51324842 markings, 58900227 edges, 273285 markings/sec, 180 secs
lola: 52519881 markings, 60268022 edges, 239008 markings/sec, 185 secs
lola: 53706138 markings, 61635212 edges, 237251 markings/sec, 190 secs
lola: 54948346 markings, 63091225 edges, 248442 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F (((c12 <= c5) AND (c17 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))))) OR E (F (A (X ((1 <= c9))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((c5 + 1 <= c12) OR (out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 + 1 <= c17))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((c12 <= c5) AND (c17 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))))
lola: processed formula length: 111
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-50-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 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 4 will run for 277 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((1 <= c9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((1 <= c9)))
lola: processed formula length: 23
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-50-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 355 markings, 354 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F ((1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))) AND ((c16 <= 1) AND (c15 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U (1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7)) AND ((c16 <= 1) AND (c15 <= 2))))
lola: processed formula length: 130
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-50-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: 1741409 markings, 1861796 edges, 2947805517474430976 markings/sec, 0 secs
lola: 3408920 markings, 3692814 edges, 333502 markings/sec, 5 secs
lola: 4949340 markings, 5404728 edges, 308084 markings/sec, 10 secs
lola: 6497192 markings, 7150059 edges, 309570 markings/sec, 15 secs
lola: 7930859 markings, 8984381 edges, 286733 markings/sec, 20 secs
lola: 9455684 markings, 10675312 edges, 304965 markings/sec, 25 secs
lola: 10995397 markings, 12465283 edges, 307943 markings/sec, 30 secs
lola: 12488708 markings, 14113144 edges, 298662 markings/sec, 35 secs
lola: 13953508 markings, 15707528 edges, 292960 markings/sec, 40 secs
lola: 15430104 markings, 17358806 edges, 295319 markings/sec, 45 secs
lola: 16883799 markings, 19116300 edges, 290739 markings/sec, 50 secs
lola: 18386206 markings, 20752571 edges, 300481 markings/sec, 55 secs
lola: 19858943 markings, 22367420 edges, 294547 markings/sec, 60 secs
lola: 21225393 markings, 23914317 edges, 273290 markings/sec, 65 secs
lola: 22614954 markings, 25555499 edges, 277912 markings/sec, 70 secs
lola: 24072344 markings, 27166298 edges, 291478 markings/sec, 75 secs
lola: 25459556 markings, 28770581 edges, 277442 markings/sec, 80 secs
lola: 26795052 markings, 30266991 edges, 267099 markings/sec, 85 secs
lola: 28093820 markings, 31707563 edges, 259754 markings/sec, 90 secs
lola: 29416960 markings, 33193501 edges, 264628 markings/sec, 95 secs
lola: 30780420 markings, 34701007 edges, 272692 markings/sec, 100 secs
lola: 32145219 markings, 36243915 edges, 272960 markings/sec, 105 secs
lola: 33497904 markings, 37745086 edges, 270537 markings/sec, 110 secs
lola: 34815688 markings, 39234221 edges, 263557 markings/sec, 115 secs
lola: 36173375 markings, 40706056 edges, 271537 markings/sec, 120 secs
lola: 37505481 markings, 42181778 edges, 266421 markings/sec, 125 secs
lola: 38777048 markings, 43690651 edges, 254313 markings/sec, 130 secs
lola: 40078736 markings, 45163804 edges, 260338 markings/sec, 135 secs
lola: 41387737 markings, 46604329 edges, 261800 markings/sec, 140 secs
lola: 42674342 markings, 48048345 edges, 257321 markings/sec, 145 secs
lola: 44001571 markings, 49539096 edges, 265446 markings/sec, 150 secs
lola: 45305575 markings, 50990968 edges, 260801 markings/sec, 155 secs
lola: 46699415 markings, 52560317 edges, 278768 markings/sec, 160 secs
lola: 48050428 markings, 54081738 edges, 270203 markings/sec, 165 secs
lola: 49342248 markings, 55528939 edges, 258364 markings/sec, 170 secs
lola: 50716469 markings, 57031277 edges, 274844 markings/sec, 175 secs
lola: 52047113 markings, 58512015 edges, 266129 markings/sec, 180 secs
lola: 53299463 markings, 60021486 edges, 250470 markings/sec, 185 secs
lola: 54131974 markings, 60961886 edges, 166502 markings/sec, 190 secs
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 PermAdmissibility-PT-50-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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-50"
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-50.tgz
mv PermAdmissibility-PT-50 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-50, 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-152666478600507"
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 ;