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-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 r114-csrt-152666472700486
=====================================================================

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


BK_STOP 1527142495323

--------------------
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...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- 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
make: [verify] Error 134 (ignored)
----- Start make result stdout -----
----- 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: 1044202 markings, 2314155 edges, 2256899760931733504 markings/sec, 0 secs
lola: 2091942 markings, 4764600 edges, 209548 markings/sec, 5 secs
lola: 3062988 markings, 7221661 edges, 194209 markings/sec, 10 secs
lola: 4181502 markings, 9825755 edges, 223703 markings/sec, 15 secs
lola: 5301465 markings, 12527894 edges, 223993 markings/sec, 20 secs
lola: 6383937 markings, 15226083 edges, 216494 markings/sec, 25 secs
lola: 7451987 markings, 17718594 edges, 213610 markings/sec, 30 secs
lola: 8458736 markings, 20144698 edges, 201350 markings/sec, 35 secs
lola: 9431992 markings, 22467682 edges, 194651 markings/sec, 40 secs
lola: 10362715 markings, 24781119 edges, 186145 markings/sec, 45 secs
lola: 11351550 markings, 27087612 edges, 197767 markings/sec, 50 secs
lola: 12286473 markings, 29458805 edges, 186985 markings/sec, 55 secs
lola: 13223284 markings, 31709741 edges, 187362 markings/sec, 60 secs
lola: 14168755 markings, 33901689 edges, 189094 markings/sec, 65 secs
lola: 15115597 markings, 36066129 edges, 189368 markings/sec, 70 secs
lola: 16099195 markings, 38443611 edges, 196720 markings/sec, 75 secs
lola: 17054346 markings, 40701086 edges, 191030 markings/sec, 80 secs
lola: 17975854 markings, 42904924 edges, 184302 markings/sec, 85 secs
lola: 18915901 markings, 45334783 edges, 188009 markings/sec, 90 secs
lola: 19867275 markings, 47892502 edges, 190275 markings/sec, 95 secs
lola: 20799030 markings, 50191686 edges, 186351 markings/sec, 100 secs
lola: 21632108 markings, 52347187 edges, 166616 markings/sec, 105 secs
lola: 22469451 markings, 54491018 edges, 167469 markings/sec, 110 secs
lola: 23319374 markings, 56756741 edges, 169985 markings/sec, 115 secs
lola: 24213620 markings, 58895114 edges, 178849 markings/sec, 120 secs
lola: 25095032 markings, 61260412 edges, 176282 markings/sec, 125 secs
lola: 25998480 markings, 63731492 edges, 180690 markings/sec, 130 secs
lola: 26907775 markings, 65936090 edges, 181859 markings/sec, 135 secs
lola: 27704345 markings, 68199473 edges, 159314 markings/sec, 140 secs
lola: 28523352 markings, 70444746 edges, 163801 markings/sec, 145 secs
lola: 29449497 markings, 73032741 edges, 185229 markings/sec, 150 secs
lola: 30335188 markings, 75860598 edges, 177138 markings/sec, 155 secs
lola: 31264142 markings, 78283505 edges, 185791 markings/sec, 160 secs
lola: 32174195 markings, 80672628 edges, 182011 markings/sec, 165 secs
lola: 33080780 markings, 83040810 edges, 181317 markings/sec, 170 secs
lola: 33949778 markings, 85171819 edges, 173800 markings/sec, 175 secs
lola: 34783857 markings, 87506430 edges, 166816 markings/sec, 180 secs
lola: 35668835 markings, 89987604 edges, 176996 markings/sec, 185 secs
lola: 36590157 markings, 92356558 edges, 184264 markings/sec, 190 secs
lola: 37415390 markings, 94596969 edges, 165047 markings/sec, 195 secs
lola: 38245271 markings, 96962958 edges, 165976 markings/sec, 200 secs
lola: 39059353 markings, 99453806 edges, 162816 markings/sec, 205 secs
lola: 39919243 markings, 102024926 edges, 171978 markings/sec, 210 secs
lola: 40767537 markings, 104112537 edges, 169659 markings/sec, 215 secs
lola: 41620038 markings, 106230416 edges, 170500 markings/sec, 220 secs
lola: 42508444 markings, 108620445 edges, 177681 markings/sec, 225 secs
lola: 43403736 markings, 111142569 edges, 179058 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: 1146178 markings, 2397464 edges, 1953358685363240960 markings/sec, 0 secs
lola: 2046948 markings, 5052914 edges, 180154 markings/sec, 5 secs
lola: 3065540 markings, 7539648 edges, 203718 markings/sec, 10 secs
lola: 3976494 markings, 10140728 edges, 182191 markings/sec, 15 secs
lola: 4972884 markings, 12563911 edges, 199278 markings/sec, 20 secs
lola: 5840414 markings, 15130377 edges, 173506 markings/sec, 25 secs
lola: 6826050 markings, 17694473 edges, 197127 markings/sec, 30 secs
lola: 7766256 markings, 20163836 edges, 188041 markings/sec, 35 secs
lola: 8650133 markings, 22632171 edges, 176775 markings/sec, 40 secs
lola: 9465610 markings, 25124712 edges, 163095 markings/sec, 45 secs
lola: 10157226 markings, 27765579 edges, 138323 markings/sec, 50 secs
lola: 11140065 markings, 30030066 edges, 196568 markings/sec, 55 secs
lola: 11983348 markings, 32436789 edges, 168657 markings/sec, 60 secs
lola: 12847449 markings, 34775673 edges, 172820 markings/sec, 65 secs
lola: 13688535 markings, 37068383 edges, 168217 markings/sec, 70 secs
lola: 14523187 markings, 39529668 edges, 166930 markings/sec, 75 secs
lola: 15446146 markings, 41828252 edges, 184592 markings/sec, 80 secs
lola: 16283567 markings, 44174254 edges, 167484 markings/sec, 85 secs
lola: 17156634 markings, 46480141 edges, 174613 markings/sec, 90 secs
lola: 17942257 markings, 49176887 edges, 157125 markings/sec, 95 secs
lola: 18924731 markings, 51520629 edges, 196495 markings/sec, 100 secs
lola: 19848938 markings, 53828886 edges, 184841 markings/sec, 105 secs
lola: 20720726 markings, 56182559 edges, 174358 markings/sec, 110 secs
lola: 21607571 markings, 58568672 edges, 177369 markings/sec, 115 secs
lola: 22493629 markings, 60929874 edges, 177212 markings/sec, 120 secs
lola: 23316071 markings, 63356394 edges, 164488 markings/sec, 125 secs
lola: 24237091 markings, 65977474 edges, 184204 markings/sec, 130 secs
lola: 25105776 markings, 68516807 edges, 173737 markings/sec, 135 secs
lola: 25848903 markings, 71175819 edges, 148625 markings/sec, 140 secs
lola: 26749282 markings, 73680781 edges, 180076 markings/sec, 145 secs
lola: 27628717 markings, 75988789 edges, 175887 markings/sec, 150 secs
lola: 28466400 markings, 78384430 edges, 167537 markings/sec, 155 secs
lola: 29290174 markings, 80671352 edges, 164755 markings/sec, 160 secs
lola: 30140734 markings, 82915904 edges, 170112 markings/sec, 165 secs
lola: 30902550 markings, 85295053 edges, 152363 markings/sec, 170 secs
lola: 31854926 markings, 87405798 edges, 190475 markings/sec, 175 secs
lola: 32682086 markings, 89713910 edges, 165432 markings/sec, 180 secs
lola: 33410034 markings, 92092825 edges, 145590 markings/sec, 185 secs
lola: 34253341 markings, 93997718 edges, 168661 markings/sec, 190 secs
lola: 34936412 markings, 96108922 edges, 136614 markings/sec, 195 secs
lola: 35666291 markings, 98153633 edges, 145976 markings/sec, 200 secs
lola: 36399379 markings, 100178854 edges, 146618 markings/sec, 205 secs
lola: 37054519 markings, 102345346 edges, 131028 markings/sec, 210 secs
lola: 37751006 markings, 104648235 edges, 139297 markings/sec, 215 secs
lola: 38443807 markings, 106933718 edges, 138560 markings/sec, 220 secs
lola: 39081566 markings, 109326081 edges, 127552 markings/sec, 225 secs
lola: 39711268 markings, 111636722 edges, 125940 markings/sec, 230 secs
lola: 40531899 markings, 113643629 edges, 164126 markings/sec, 235 secs
lola: 41275737 markings, 115859304 edges, 148768 markings/sec, 240 secs
lola: 42119054 markings, 117912239 edges, 168663 markings/sec, 245 secs
lola: 42872577 markings, 119988489 edges, 150705 markings/sec, 250 secs
lola: 43577884 markings, 122165097 edges, 141061 markings/sec, 255 secs
lola: 44282970 markings, 124333804 edges, 141017 markings/sec, 260 secs
lola: 44949573 markings, 126599941 edges, 133321 markings/sec, 265 secs
lola: 45750788 markings, 128684936 edges, 160243 markings/sec, 270 secs
lola: 46495236 markings, 130914353 edges, 148890 markings/sec, 275 secs
lola: 47333324 markings, 132965442 edges, 167618 markings/sec, 280 secs
lola: 48092318 markings, 135173100 edges, 151799 markings/sec, 285 secs
lola: 48822691 markings, 137341823 edges, 146075 markings/sec, 290 secs
lola: 49489867 markings, 139741158 edges, 133435 markings/sec, 295 secs
lola: 50329043 markings, 142086145 edges, 167835 markings/sec, 300 secs
lola: 51184076 markings, 144165213 edges, 171007 markings/sec, 305 secs
lola: 51934267 markings, 146465796 edges, 150038 markings/sec, 310 secs
lola: 52734920 markings, 148572768 edges, 160131 markings/sec, 315 secs
lola: 53529740 markings, 150634246 edges, 158964 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-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 irma4mcc-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 r114-csrt-152666472700486"
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 ;