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 868K
-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 24K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K 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 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K 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 15K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 481K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PermAdmissibility-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r259-csrt-152732584700143
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527463212905


BK_STOP 1527464460976

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PermAdmissibility-PT-20 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 1787034, 'Memory': 15950.71, 'Tool': 'lola'}, {'Time': 1798076, 'Memory': 15946.08, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PermAdmissibility-PT-20...

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


checking for too many tokens
===========================================================================================
PermAdmissibility-PT-20: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ PermAdmissibility-PT-20 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-PT-20-LTLCardinality.task
lola: A ((X (X ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c6))) U F (F ((c6 <= c16))))) : A (G (G (X (X ((1 <= c19)))))) : A (X (G (G ((2 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7))))) : A (((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) U (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5))) : A (X ((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= c16))) : A (X (F (X ((1 <= in2_2 + in2_3))))) : A ((X (X ((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= c110))) U (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7))) : A (G ((3 <= c18))) : A (F (G (X (X ((aux9_7 <= out2_5)))))) : A ((3 <= c18)) : A (F ((X ((out1_0 <= aux5_4)) U (out3_0 <= aux15_3)))) : A ((aux11_7 <= in3_4)) : A (F ((aux11_0 <= aux8_7))) : A (G ((out8_2 <= out2_1))) : A (G (G ((out6_7 <= out1_5)))) : A ((((out6_0 <= out5_1) U (out2_1 <= out4_2)) U F ((aux7_6 <= aux6_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: A ((X (X ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c6))) U F (F ((c6 <= c16)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (X ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c6))) U F ((c6 <= c16))))
lola: processed formula: A ((X (X ((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= c6))) U F ((c6 <= c16))))
lola: processed formula length: 117
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (X ((1 <= c19))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (X (X ((1 <= c19))))))
lola: processed formula: A (G (G (X (X ((1 <= c19))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 321 markings, 321 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G ((2 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (G ((2 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7)))))
lola: processed formula: A (X (G (G ((2 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7)))))
lola: processed formula length: 100
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 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: Formula contains X operator; stubborn sets not applicable
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: 321 markings, 321 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) U (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) U (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))
lola: processed formula: A (((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) U (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux5_0 + aux5_1 + aux5_4 + aux5_5)))
lola: processed formula length: 269
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= c16)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= c16)))
lola: processed formula: A (X ((out6_0 + out6_1 + out6_2 + out6_3 + out6_4 + out6_5 + out6_6 + out6_7 <= c16)))
lola: processed formula length: 86
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X ((1 <= in2_2 + in2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (X ((1 <= in2_2 + in2_3)))))
lola: processed formula: A (X (F (X ((1 <= in2_2 + in2_3)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 30 markings, 36 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= c110))) U (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (X ((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= c110))) U (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7)))
lola: processed formula: A ((X (X ((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= c110))) U (2 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7)))
lola: processed formula length: 188
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 708 markings, 708 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= c18)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (X ((aux9_7 <= out2_5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (X ((aux9_7 <= out2_5))))))
lola: processed formula: A (F (G (X (X ((aux9_7 <= out2_5))))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1011281 markings, 2762131 edges, 202256 markings/sec, 0 secs
lola: 1707509 markings, 5618294 edges, 139246 markings/sec, 5 secs
lola: 2480135 markings, 8446469 edges, 154525 markings/sec, 10 secs
lola: 3228705 markings, 11333670 edges, 149714 markings/sec, 15 secs
lola: 4091848 markings, 14002941 edges, 172629 markings/sec, 20 secs
lola: 4760938 markings, 16679408 edges, 133818 markings/sec, 25 secs
lola: 5417900 markings, 19415042 edges, 131392 markings/sec, 30 secs
lola: 6115974 markings, 22160055 edges, 139615 markings/sec, 35 secs
lola: 6974395 markings, 25017403 edges, 171684 markings/sec, 40 secs
lola: 7674151 markings, 28010180 edges, 139951 markings/sec, 45 secs
lola: 8400020 markings, 30950504 edges, 145174 markings/sec, 50 secs
lola: 9139194 markings, 33775754 edges, 147835 markings/sec, 55 secs
lola: 9771785 markings, 36749368 edges, 126518 markings/sec, 60 secs
lola: 10435402 markings, 39981428 edges, 132723 markings/sec, 65 secs
lola: 11014452 markings, 43019292 edges, 115810 markings/sec, 70 secs
lola: 11632572 markings, 45867755 edges, 123624 markings/sec, 75 secs
lola: 12181507 markings, 48447225 edges, 109787 markings/sec, 80 secs
lola: 12732018 markings, 51348649 edges, 110102 markings/sec, 85 secs
lola: 13367481 markings, 54255841 edges, 127093 markings/sec, 90 secs
lola: 13966766 markings, 57228159 edges, 119857 markings/sec, 95 secs
lola: 14612144 markings, 60408689 edges, 129076 markings/sec, 100 secs
lola: 15300796 markings, 63525664 edges, 137730 markings/sec, 105 secs
lola: 16038294 markings, 66513227 edges, 147500 markings/sec, 110 secs
lola: 16727034 markings, 69463938 edges, 137748 markings/sec, 115 secs
lola: 17389159 markings, 72350908 edges, 132425 markings/sec, 120 secs
lola: 18033263 markings, 75302460 edges, 128821 markings/sec, 125 secs
lola: 18871482 markings, 78471156 edges, 167644 markings/sec, 130 secs
lola: 19601674 markings, 81411816 edges, 146038 markings/sec, 135 secs
lola: 20240555 markings, 84506883 edges, 127776 markings/sec, 140 secs
lola: 20943423 markings, 87596454 edges, 140574 markings/sec, 145 secs
lola: 21596390 markings, 90503133 edges, 130593 markings/sec, 150 secs
lola: 22210202 markings, 93327210 edges, 122762 markings/sec, 155 secs
lola: 22820186 markings, 96024350 edges, 121997 markings/sec, 160 secs
lola: 23572544 markings, 98836113 edges, 150472 markings/sec, 165 secs
lola: 24216471 markings, 101714706 edges, 128785 markings/sec, 170 secs
lola: 24841899 markings, 104602912 edges, 125086 markings/sec, 175 secs
lola: 25460567 markings, 107426734 edges, 123734 markings/sec, 180 secs
lola: 26107904 markings, 110311005 edges, 129467 markings/sec, 185 secs
lola: 26709656 markings, 113102893 edges, 120350 markings/sec, 190 secs
lola: 27500005 markings, 116211723 edges, 158070 markings/sec, 195 secs
lola: 28195757 markings, 119243170 edges, 139150 markings/sec, 200 secs
lola: 28834400 markings, 122192693 edges, 127729 markings/sec, 205 secs
lola: 29470353 markings, 125114395 edges, 127191 markings/sec, 210 secs
lola: 30076639 markings, 127932534 edges, 121257 markings/sec, 215 secs
lola: 30820116 markings, 130930879 edges, 148695 markings/sec, 220 secs
lola: 31595042 markings, 134200435 edges, 154985 markings/sec, 225 secs
lola: 32342178 markings, 137390125 edges, 149427 markings/sec, 230 secs
lola: 33009232 markings, 140325211 edges, 133411 markings/sec, 235 secs
lola: 33701039 markings, 143347758 edges, 138361 markings/sec, 240 secs
lola: 34413401 markings, 146275990 edges, 142472 markings/sec, 245 secs
lola: 35106090 markings, 149366362 edges, 138538 markings/sec, 250 secs
lola: 35802394 markings, 152455446 edges, 139261 markings/sec, 255 secs
lola: 36497629 markings, 155539811 edges, 139047 markings/sec, 260 secs
lola: 37149902 markings, 158535274 edges, 130455 markings/sec, 265 secs
lola: 37816339 markings, 161577403 edges, 133287 markings/sec, 270 secs
lola: 38474614 markings, 164678758 edges, 131655 markings/sec, 275 secs
lola: 39261947 markings, 167999485 edges, 157467 markings/sec, 280 secs
lola: 39936722 markings, 170972198 edges, 134955 markings/sec, 285 secs
lola: 40603034 markings, 173956219 edges, 133262 markings/sec, 290 secs
lola: 41287071 markings, 176987649 edges, 136807 markings/sec, 295 secs
lola: 41921115 markings, 179832061 edges, 126809 markings/sec, 300 secs
lola: 42603914 markings, 183000838 edges, 136560 markings/sec, 305 secs
lola: 43299094 markings, 186276223 edges, 139036 markings/sec, 310 secs
lola: 44066105 markings, 189600241 edges, 153402 markings/sec, 315 secs
lola: 44780432 markings, 192716874 edges, 142865 markings/sec, 320 secs
lola: 45458000 markings, 195902591 edges, 135514 markings/sec, 325 secs
lola: 46151267 markings, 199013334 edges, 138653 markings/sec, 330 secs
lola: 46813327 markings, 202100202 edges, 132412 markings/sec, 335 secs
lola: 47469671 markings, 205171079 edges, 131269 markings/sec, 340 secs
lola: 48054696 markings, 208081342 edges, 117005 markings/sec, 345 secs
lola: 48688919 markings, 211022268 edges, 126845 markings/sec, 350 secs
lola: 49446058 markings, 213612464 edges, 151428 markings/sec, 355 secs
lola: 50129114 markings, 216406642 edges, 136611 markings/sec, 360 secs
lola: 50861485 markings, 219320055 edges, 146474 markings/sec, 365 secs
lola: 51512354 markings, 222022156 edges, 130174 markings/sec, 370 secs
lola: 52225891 markings, 224865363 edges, 142707 markings/sec, 375 secs
lola: 52895811 markings, 227651961 edges, 133984 markings/sec, 380 secs
lola: 53645232 markings, 230712932 edges, 149884 markings/sec, 385 secs
lola: 54356979 markings, 233790642 edges, 142349 markings/sec, 390 secs
lola: 55144937 markings, 236798652 edges, 157592 markings/sec, 395 secs
lola: 55905191 markings, 239774624 edges, 152051 markings/sec, 400 secs
lola: 56673764 markings, 242776227 edges, 153715 markings/sec, 405 secs
lola: 57410021 markings, 245798357 edges, 147251 markings/sec, 410 secs
lola: 58155356 markings, 248808008 edges, 149067 markings/sec, 415 secs
lola: 58883697 markings, 251715481 edges, 145668 markings/sec, 420 secs
lola: 59570757 markings, 254485731 edges, 137412 markings/sec, 425 secs
lola: 60223857 markings, 257199685 edges, 130620 markings/sec, 430 secs
lola: 60947474 markings, 259842679 edges, 144723 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= c18))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= c18)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((out1_0 <= aux5_4)) U (out3_0 <= aux15_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((X ((out1_0 <= aux5_4)) U (out3_0 <= aux15_3))))
lola: processed formula: A (F ((X ((out1_0 <= aux5_4)) U (out3_0 <= aux15_3))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((aux11_7 <= in3_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (aux11_7 <= in3_4)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.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 12 will run for 774 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((aux11_0 <= aux8_7)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((aux11_0 <= aux8_7)))
lola: processed formula: A (F ((aux11_0 <= aux8_7)))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1032 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((out8_2 <= out2_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: 872022 markings, 2938008 edges, 174404 markings/sec, 0 secs
lola: 1645796 markings, 5624915 edges, 154755 markings/sec, 5 secs
lola: 2365965 markings, 8428439 edges, 144034 markings/sec, 10 secs
lola: 3152366 markings, 11324616 edges, 157280 markings/sec, 15 secs
lola: 3887000 markings, 14169346 edges, 146927 markings/sec, 20 secs
lola: 4631883 markings, 17069392 edges, 148977 markings/sec, 25 secs
lola: 5349326 markings, 19675697 edges, 143489 markings/sec, 30 secs
lola: 5989494 markings, 22093914 edges, 128034 markings/sec, 35 secs
lola: 6644418 markings, 24494759 edges, 130985 markings/sec, 40 secs
lola: 7228404 markings, 26932642 edges, 116797 markings/sec, 45 secs
lola: 7890519 markings, 29473182 edges, 132423 markings/sec, 50 secs
lola: 8544545 markings, 32073182 edges, 130805 markings/sec, 55 secs
lola: 9184295 markings, 34481172 edges, 127950 markings/sec, 60 secs
lola: 9926789 markings, 37014741 edges, 148499 markings/sec, 65 secs
lola: 10601917 markings, 39422523 edges, 135026 markings/sec, 70 secs
lola: 11218387 markings, 41765306 edges, 123294 markings/sec, 75 secs
lola: 11738236 markings, 43992624 edges, 103970 markings/sec, 80 secs
lola: 12297606 markings, 46207917 edges, 111874 markings/sec, 85 secs
lola: 12817452 markings, 48518523 edges, 103969 markings/sec, 90 secs
lola: 13509204 markings, 51234356 edges, 138350 markings/sec, 95 secs
lola: 14144266 markings, 53825767 edges, 127012 markings/sec, 100 secs
lola: 14807656 markings, 56519258 edges, 132678 markings/sec, 105 secs
lola: 15449035 markings, 59216347 edges, 128276 markings/sec, 110 secs
lola: 16099101 markings, 61819642 edges, 130013 markings/sec, 115 secs
lola: 16726111 markings, 64488923 edges, 125402 markings/sec, 120 secs
lola: 17474414 markings, 67231129 edges, 149661 markings/sec, 125 secs
lola: 18188656 markings, 69896460 edges, 142848 markings/sec, 130 secs
lola: 18765613 markings, 72103251 edges, 115391 markings/sec, 135 secs
lola: 19279474 markings, 74395342 edges, 102772 markings/sec, 140 secs
lola: 19812852 markings, 76677226 edges, 106676 markings/sec, 145 secs
lola: 20365887 markings, 79101771 edges, 110607 markings/sec, 150 secs
lola: 20848582 markings, 81402695 edges, 96539 markings/sec, 155 secs
lola: 21472961 markings, 83983124 edges, 124876 markings/sec, 160 secs
lola: 22081006 markings, 86600341 edges, 121609 markings/sec, 165 secs
lola: 22664513 markings, 89160753 edges, 116701 markings/sec, 170 secs
lola: 23258252 markings, 91697972 edges, 118748 markings/sec, 175 secs
lola: 23798430 markings, 94114686 edges, 108036 markings/sec, 180 secs
lola: 24498164 markings, 96476808 edges, 139947 markings/sec, 185 secs
lola: 25137746 markings, 98820819 edges, 127916 markings/sec, 190 secs
lola: 25727983 markings, 101145838 edges, 118047 markings/sec, 195 secs
lola: 26391354 markings, 103695679 edges, 132674 markings/sec, 200 secs
lola: 27037203 markings, 105940660 edges, 129170 markings/sec, 205 secs
lola: 27592554 markings, 108120396 edges, 111070 markings/sec, 210 secs
lola: 28154269 markings, 110353008 edges, 112343 markings/sec, 215 secs
lola: 28773126 markings, 112676886 edges, 123771 markings/sec, 220 secs
lola: 29277093 markings, 114954535 edges, 100793 markings/sec, 225 secs
lola: 29783683 markings, 117164554 edges, 101318 markings/sec, 230 secs
lola: 30327251 markings, 119585931 edges, 108714 markings/sec, 235 secs
lola: 30948772 markings, 122152461 edges, 124304 markings/sec, 240 secs
lola: 31435613 markings, 124333182 edges, 97368 markings/sec, 245 secs
lola: 32120005 markings, 126692047 edges, 136878 markings/sec, 250 secs
lola: 32766847 markings, 129105972 edges, 129368 markings/sec, 255 secs
lola: 33488405 markings, 131553706 edges, 144312 markings/sec, 260 secs
lola: 34115905 markings, 133849377 edges, 125500 markings/sec, 265 secs
lola: 34649680 markings, 136017985 edges, 106755 markings/sec, 270 secs
lola: 35197494 markings, 138346145 edges, 109563 markings/sec, 275 secs
lola: 35734817 markings, 140539689 edges, 107465 markings/sec, 280 secs
lola: 36247394 markings, 142706883 edges, 102515 markings/sec, 285 secs
lola: 36798615 markings, 145024543 edges, 110244 markings/sec, 290 secs
lola: 37418829 markings, 147349517 edges, 124043 markings/sec, 295 secs
lola: 37955460 markings, 149701605 edges, 107326 markings/sec, 300 secs
lola: 38518979 markings, 152196343 edges, 112704 markings/sec, 305 secs
lola: 39209187 markings, 155033815 edges, 138042 markings/sec, 310 secs
lola: 39944397 markings, 157742547 edges, 147042 markings/sec, 315 secs
lola: 40578572 markings, 160046213 edges, 126835 markings/sec, 320 secs
lola: 41163524 markings, 162204269 edges, 116990 markings/sec, 325 secs
lola: 41642487 markings, 164273626 edges, 95793 markings/sec, 330 secs
lola: 42152140 markings, 166376977 edges, 101931 markings/sec, 335 secs
lola: 42623700 markings, 168411322 edges, 94312 markings/sec, 340 secs
lola: 43153499 markings, 170599439 edges, 105960 markings/sec, 345 secs
lola: 43623336 markings, 172835371 edges, 93967 markings/sec, 350 secs
lola: 44105623 markings, 174886224 edges, 96457 markings/sec, 355 secs
lola: 44658988 markings, 177170481 edges, 110673 markings/sec, 360 secs
lola: 45185645 markings, 179468036 edges, 105331 markings/sec, 365 secs
lola: 45634352 markings, 181640405 edges, 89741 markings/sec, 370 secs
lola: 46175679 markings, 184056214 edges, 108265 markings/sec, 375 secs
lola: 46763903 markings, 186501835 edges, 117645 markings/sec, 380 secs
lola: 47268301 markings, 188396978 edges, 100880 markings/sec, 385 secs
lola: 47706588 markings, 190352923 edges, 87657 markings/sec, 390 secs
lola: 48129697 markings, 192292328 edges, 84622 markings/sec, 395 secs
lola: 48567218 markings, 194254853 edges, 87504 markings/sec, 400 secs
lola: 49090951 markings, 196602647 edges, 104747 markings/sec, 405 secs
lola: 49542355 markings, 198525163 edges, 90281 markings/sec, 410 secs
lola: 49970727 markings, 200390022 edges, 85674 markings/sec, 415 secs
lola: 50364127 markings, 202324160 edges, 78680 markings/sec, 420 secs
lola: 50811344 markings, 204391861 edges, 89443 markings/sec, 425 secs
lola: 51232205 markings, 206550208 edges, 84172 markings/sec, 430 secs
lola: 51835065 markings, 208768528 edges, 120572 markings/sec, 435 secs
lola: 52461680 markings, 210996763 edges, 125323 markings/sec, 440 secs
lola: 52974229 markings, 213105903 edges, 102510 markings/sec, 445 secs
lola: 53488922 markings, 215248597 edges, 102939 markings/sec, 450 secs
lola: 53946351 markings, 217224485 edges, 91486 markings/sec, 455 secs
lola: 54442518 markings, 219304858 edges, 99233 markings/sec, 460 secs
lola: 54956032 markings, 221472792 edges, 102703 markings/sec, 465 secs
lola: 55450259 markings, 223618691 edges, 98845 markings/sec, 470 secs
lola: 55984398 markings, 225879252 edges, 106828 markings/sec, 475 secs
lola: 56422396 markings, 227977524 edges, 87600 markings/sec, 480 secs
lola: 56890477 markings, 229888364 edges, 93616 markings/sec, 485 secs
lola: 57301591 markings, 231798776 edges, 82223 markings/sec, 490 secs
lola: 57669088 markings, 233521708 edges, 73499 markings/sec, 495 secs
lola: 58086683 markings, 235512719 edges, 83519 markings/sec, 500 secs
lola: 58426039 markings, 237150048 edges, 67871 markings/sec, 505 secs
lola: 58488741 markings, 237392305 edges, 12540 markings/sec, 510 secs
lola: 58490842 markings, 237400875 edges, 420 markings/sec, 515 secs
lola: 58491847 markings, 237404258 edges, 201 markings/sec, 520 secs
lola: 58493780 markings, 237413375 edges, 387 markings/sec, 525 secs
lola: 58493784 markings, 237413405 edges, 1 markings/sec, 530 secs
lola: 58493788 markings, 237413430 edges, 1 markings/sec, 535 secs
lola: 58493792 markings, 237413462 edges, 1 markings/sec, 540 secs
lola: 58494232 markings, 237416138 edges, 88 markings/sec, 545 secs
lola: 58494235 markings, 237416158 edges, 1 markings/sec, 550 secs
lola: 58494237 markings, 237416170 edges, 0 markings/sec, 555 secs
lola: 58494239 markings, 237416192 edges, 0 markings/sec, 560 secs
lola: 58494315 markings, 237416634 edges, 15 markings/sec, 565 secs
lola: 58495701 markings, 237425209 edges, 277 markings/sec, 570 secs
lola: 58495703 markings, 237425223 edges, 0 markings/sec, 575 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1168 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((out6_7 <= out1_5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G ((out6_7 <= out1_5))))
lola: processed formula: A (G (G ((out6_7 <= out1_5))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.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: 321 markings, 321 edges
lola: ========================================
lola: subprocess 15 will run for 2337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((out6_0 <= out5_1) U (out2_1 <= out4_2)) U F ((aux7_6 <= aux6_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((out6_0 <= out5_1) U (out2_1 <= out4_2)) U F ((aux7_6 <= aux6_4))))
lola: processed formula: A ((((out6_0 <= out5_1) U (out2_1 <= out4_2)) U F ((aux7_6 <= aux6_4))))
lola: processed formula length: 72
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-20-LTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes yes yes no no unknown no yes yes yes unknown no yes
FORMULA PermAdmissibility-PT-20-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-LTLCardinality-15 TRUE 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-20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-20.tgz
mv PermAdmissibility-PT-20 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is PermAdmissibility-PT-20, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r259-csrt-152732584700143"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;