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-full
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 r258-csrt-152732584100143
=====================================================================

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


BK_STOP 1527458458774

--------------------
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-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': 'itstools'}].
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 stdout -----
----- Start make result stderr -----
LTLCardinality @ PermAdmissibility-PT-20 @ 3540 seconds
----- Start make result stderr -----
----- 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-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 236 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 295 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 354 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: 1014556 markings, 2778719 edges, 202911 markings/sec, 0 secs
lola: 1739753 markings, 5744907 edges, 145039 markings/sec, 5 secs
lola: 2532975 markings, 8597233 edges, 158644 markings/sec, 10 secs
lola: 3255016 markings, 11480383 edges, 144408 markings/sec, 15 secs
lola: 4141652 markings, 14136288 edges, 177327 markings/sec, 20 secs
lola: 4823504 markings, 16937336 edges, 136370 markings/sec, 25 secs
lola: 5488086 markings, 19746899 edges, 132916 markings/sec, 30 secs
lola: 6258793 markings, 22526301 edges, 154141 markings/sec, 35 secs
lola: 7044452 markings, 25408290 edges, 157132 markings/sec, 40 secs
lola: 7724052 markings, 28257930 edges, 135920 markings/sec, 45 secs
lola: 8425786 markings, 31020685 edges, 140347 markings/sec, 50 secs
lola: 9115762 markings, 33654871 edges, 137995 markings/sec, 55 secs
lola: 9708410 markings, 36425569 edges, 118530 markings/sec, 60 secs
lola: 10314249 markings, 39406473 edges, 121168 markings/sec, 65 secs
lola: 10911443 markings, 42427932 edges, 119439 markings/sec, 70 secs
lola: 11553596 markings, 45493933 edges, 128431 markings/sec, 75 secs
lola: 12178856 markings, 48429925 edges, 125052 markings/sec, 80 secs
lola: 12787654 markings, 51611306 edges, 121760 markings/sec, 85 secs
lola: 13445218 markings, 54569158 edges, 131513 markings/sec, 90 secs
lola: 14034233 markings, 57629213 edges, 117803 markings/sec, 95 secs
lola: 14677864 markings, 60682439 edges, 128726 markings/sec, 100 secs
lola: 15331213 markings, 63644931 edges, 130670 markings/sec, 105 secs
lola: 16059169 markings, 66616008 edges, 145591 markings/sec, 110 secs
lola: 16756287 markings, 69601939 edges, 139424 markings/sec, 115 secs
lola: 17443633 markings, 72616367 edges, 137469 markings/sec, 120 secs
lola: 18131211 markings, 75706284 edges, 137516 markings/sec, 125 secs
lola: 18935104 markings, 78714962 edges, 160779 markings/sec, 130 secs
lola: 19666065 markings, 81700033 edges, 146192 markings/sec, 135 secs
lola: 20323150 markings, 84860092 edges, 131417 markings/sec, 140 secs
lola: 20986587 markings, 87825299 edges, 132687 markings/sec, 145 secs
lola: 21634092 markings, 90726555 edges, 129501 markings/sec, 150 secs
lola: 22249870 markings, 93517176 edges, 123156 markings/sec, 155 secs
lola: 22930101 markings, 96370459 edges, 136046 markings/sec, 160 secs
lola: 23644787 markings, 99186875 edges, 142937 markings/sec, 165 secs
lola: 24279623 markings, 102020116 edges, 126967 markings/sec, 170 secs
lola: 24949222 markings, 105077696 edges, 133920 markings/sec, 175 secs
lola: 25630911 markings, 108111221 edges, 136338 markings/sec, 180 secs
lola: 26268749 markings, 111019298 edges, 127568 markings/sec, 185 secs
lola: 26871575 markings, 113801493 edges, 120565 markings/sec, 190 secs
lola: 27610414 markings, 116642769 edges, 147768 markings/sec, 195 secs
lola: 28270850 markings, 119635212 edges, 132087 markings/sec, 200 secs
lola: 28897236 markings, 122541441 edges, 125277 markings/sec, 205 secs
lola: 29559921 markings, 125507439 edges, 132537 markings/sec, 210 secs
lola: 30167700 markings, 128382809 edges, 121556 markings/sec, 215 secs
lola: 30965095 markings, 131500037 edges, 159479 markings/sec, 220 secs
lola: 31700378 markings, 134642912 edges, 147057 markings/sec, 225 secs
lola: 32446920 markings, 137769950 edges, 149308 markings/sec, 230 secs
lola: 33129034 markings, 140900293 edges, 136423 markings/sec, 235 secs
lola: 33867310 markings, 143991110 edges, 147655 markings/sec, 240 secs
lola: 34559173 markings, 146938181 edges, 138373 markings/sec, 245 secs
lola: 35208137 markings, 149829801 edges, 129793 markings/sec, 250 secs
lola: 35870996 markings, 152764091 edges, 132572 markings/sec, 255 secs
lola: 36541317 markings, 155735748 edges, 134064 markings/sec, 260 secs
lola: 37164822 markings, 158578417 edges, 124701 markings/sec, 265 secs
lola: 37791100 markings, 161466935 edges, 125256 markings/sec, 270 secs
lola: 38402416 markings, 164383446 edges, 122263 markings/sec, 275 secs
lola: 39123771 markings, 167432996 edges, 144271 markings/sec, 280 secs
lola: 39809241 markings, 170441552 edges, 137094 markings/sec, 285 secs
lola: 40477786 markings, 173408237 edges, 133709 markings/sec, 290 secs
lola: 41162255 markings, 176401169 edges, 136894 markings/sec, 295 secs
lola: 41824076 markings, 179393892 edges, 132364 markings/sec, 300 secs
lola: 42453708 markings, 182306098 edges, 125926 markings/sec, 305 secs
lola: 43053060 markings, 185236966 edges, 119870 markings/sec, 310 secs
lola: 43776773 markings, 188318624 edges, 144743 markings/sec, 315 secs
lola: 44444541 markings, 191231058 edges, 133554 markings/sec, 320 secs
lola: 45070426 markings, 194117924 edges, 125177 markings/sec, 325 secs
lola: 45707703 markings, 197025043 edges, 127455 markings/sec, 330 secs
lola: 46350280 markings, 199914270 edges, 128515 markings/sec, 335 secs
lola: 46957955 markings, 202762667 edges, 121535 markings/sec, 340 secs
lola: 47593644 markings, 205741710 edges, 127138 markings/sec, 345 secs
lola: 48194553 markings, 208759167 edges, 120182 markings/sec, 350 secs
lola: 48915356 markings, 211813885 edges, 144161 markings/sec, 355 secs
lola: 49667401 markings, 214495168 edges, 150409 markings/sec, 360 secs
lola: 50378825 markings, 217373241 edges, 142285 markings/sec, 365 secs
lola: 51085685 markings, 220240052 edges, 141372 markings/sec, 370 secs
lola: 51785189 markings, 223094318 edges, 139901 markings/sec, 375 secs
lola: 52532846 markings, 226100986 edges, 149531 markings/sec, 380 secs
lola: 53259996 markings, 229086193 edges, 145430 markings/sec, 385 secs
lola: 53974159 markings, 232076457 edges, 142833 markings/sec, 390 secs
lola: 54683798 markings, 235007367 edges, 141928 markings/sec, 395 secs
lola: 55443723 markings, 237915734 edges, 151985 markings/sec, 400 secs
lola: 56172313 markings, 240795173 edges, 145718 markings/sec, 405 secs
lola: 56883790 markings, 243664848 edges, 142295 markings/sec, 410 secs
lola: 57544457 markings, 246400333 edges, 132133 markings/sec, 415 secs
lola: 58234181 markings, 249113889 edges, 137945 markings/sec, 420 secs
lola: 58905148 markings, 251799993 edges, 134193 markings/sec, 425 secs
lola: 59570671 markings, 254485316 edges, 133105 markings/sec, 430 secs
lola: 60226280 markings, 257206861 edges, 131122 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: 869084 markings, 2932320 edges, 173817 markings/sec, 0 secs
lola: 1605457 markings, 5471694 edges, 147275 markings/sec, 5 secs
lola: 2311628 markings, 8198077 edges, 141234 markings/sec, 10 secs
lola: 3054698 markings, 10927879 edges, 148614 markings/sec, 15 secs
lola: 3753648 markings, 13676404 edges, 139790 markings/sec, 20 secs
lola: 4484038 markings, 16486923 edges, 146078 markings/sec, 25 secs
lola: 5196678 markings, 19157324 edges, 142528 markings/sec, 30 secs
lola: 5846716 markings, 21512542 edges, 130008 markings/sec, 35 secs
lola: 6466257 markings, 23842339 edges, 123908 markings/sec, 40 secs
lola: 7056269 markings, 26249530 edges, 118002 markings/sec, 45 secs
lola: 7690639 markings, 28675227 edges, 126874 markings/sec, 50 secs
lola: 8317115 markings, 31195200 edges, 125295 markings/sec, 55 secs
lola: 8927322 markings, 33663703 edges, 122041 markings/sec, 60 secs
lola: 9695349 markings, 36309603 edges, 153605 markings/sec, 65 secs
lola: 10402014 markings, 38676121 edges, 141333 markings/sec, 70 secs
lola: 11004289 markings, 40987592 edges, 120455 markings/sec, 75 secs
lola: 11551955 markings, 43190113 edges, 109533 markings/sec, 80 secs
lola: 12162947 markings, 45646475 edges, 122198 markings/sec, 85 secs
lola: 12704100 markings, 47977258 edges, 108231 markings/sec, 90 secs
lola: 13321131 markings, 50468448 edges, 123406 markings/sec, 95 secs
lola: 13938164 markings, 52936851 edges, 123407 markings/sec, 100 secs
lola: 14523574 markings, 55311669 edges, 117082 markings/sec, 105 secs
lola: 15082623 markings, 57690604 edges, 111810 markings/sec, 110 secs
lola: 15657302 markings, 60112776 edges, 114936 markings/sec, 115 secs
lola: 16247424 markings, 62477500 edges, 118024 markings/sec, 120 secs
lola: 16775345 markings, 64741006 edges, 105584 markings/sec, 125 secs
lola: 17389920 markings, 66908039 edges, 122915 markings/sec, 130 secs
lola: 18002395 markings, 69201086 edges, 122495 markings/sec, 135 secs
lola: 18555366 markings, 71219999 edges, 110594 markings/sec, 140 secs
lola: 18989377 markings, 73100141 edges, 86802 markings/sec, 145 secs
lola: 19442744 markings, 75129041 edges, 90673 markings/sec, 150 secs
lola: 19937353 markings, 77183775 edges, 98922 markings/sec, 155 secs
lola: 20378755 markings, 79159318 edges, 88280 markings/sec, 160 secs
lola: 20777861 markings, 81167813 edges, 79821 markings/sec, 165 secs
lola: 21368321 markings, 83535381 edges, 118092 markings/sec, 170 secs
lola: 21900927 markings, 85802649 edges, 106521 markings/sec, 175 secs
lola: 22393005 markings, 87976581 edges, 98416 markings/sec, 180 secs
lola: 22896028 markings, 90158555 edges, 100605 markings/sec, 185 secs
lola: 23392786 markings, 92287273 edges, 99352 markings/sec, 190 secs
lola: 23854630 markings, 94336413 edges, 92369 markings/sec, 195 secs
lola: 24446546 markings, 96281840 edges, 118383 markings/sec, 200 secs
lola: 24997808 markings, 98294372 edges, 110252 markings/sec, 205 secs
lola: 25537002 markings, 100322142 edges, 107839 markings/sec, 210 secs
lola: 26106867 markings, 102613455 edges, 113973 markings/sec, 215 secs
lola: 26753222 markings, 104992118 edges, 129271 markings/sec, 220 secs
lola: 27362025 markings, 107194510 edges, 121761 markings/sec, 225 secs
lola: 27872526 markings, 109314071 edges, 102100 markings/sec, 230 secs
lola: 28481525 markings, 111579623 edges, 121800 markings/sec, 235 secs
lola: 28979118 markings, 113583708 edges, 99519 markings/sec, 240 secs
lola: 29417641 markings, 115529729 edges, 87705 markings/sec, 245 secs
lola: 29832314 markings, 117432740 edges, 82935 markings/sec, 250 secs
lola: 30345540 markings, 119665189 edges, 102645 markings/sec, 255 secs
lola: 30929366 markings, 122062772 edges, 116765 markings/sec, 260 secs
lola: 31328743 markings, 123950384 edges, 79875 markings/sec, 265 secs
lola: 31992866 markings, 126227671 edges, 132825 markings/sec, 270 secs
lola: 32584557 markings, 128389482 edges, 118338 markings/sec, 275 secs
lola: 33187388 markings, 130489990 edges, 120566 markings/sec, 280 secs
lola: 33793621 markings, 132642969 edges, 121247 markings/sec, 285 secs
lola: 34360574 markings, 134799616 edges, 113391 markings/sec, 290 secs
lola: 34861450 markings, 137039995 edges, 100175 markings/sec, 295 secs
lola: 35421853 markings, 139288833 edges, 112081 markings/sec, 300 secs
lola: 35971157 markings, 141519115 edges, 109861 markings/sec, 305 secs
lola: 36422882 markings, 143625059 edges, 90345 markings/sec, 310 secs
lola: 37088390 markings, 146123954 edges, 133102 markings/sec, 315 secs
lola: 37649392 markings, 148384713 edges, 112200 markings/sec, 320 secs
lola: 38177251 markings, 150703902 edges, 105572 markings/sec, 325 secs
lola: 38793635 markings, 153329727 edges, 123277 markings/sec, 330 secs
lola: 39438751 markings, 155990076 edges, 129023 markings/sec, 335 secs
lola: 40154924 markings, 158473163 edges, 143235 markings/sec, 340 secs
lola: 40750978 markings, 160727441 edges, 119211 markings/sec, 345 secs
lola: 41356000 markings, 163021822 edges, 121004 markings/sec, 350 secs
lola: 41831582 markings, 165128398 edges, 95116 markings/sec, 355 secs
lola: 42357523 markings, 167218380 edges, 105188 markings/sec, 360 secs
lola: 42834417 markings, 169268981 edges, 95379 markings/sec, 365 secs
lola: 43333147 markings, 171429660 edges, 99746 markings/sec, 370 secs
lola: 43763968 markings, 173451463 edges, 86164 markings/sec, 375 secs
lola: 44284355 markings, 175599899 edges, 104077 markings/sec, 380 secs
lola: 44817826 markings, 177882135 edges, 106694 markings/sec, 385 secs
lola: 45303730 markings, 179967854 edges, 97181 markings/sec, 390 secs
lola: 45731140 markings, 182129568 edges, 85482 markings/sec, 395 secs
lola: 46258510 markings, 184411947 edges, 105474 markings/sec, 400 secs
lola: 46763507 markings, 186500632 edges, 100999 markings/sec, 405 secs
lola: 47217557 markings, 188192605 edges, 90810 markings/sec, 410 secs
lola: 47602603 markings, 189910000 edges, 77009 markings/sec, 415 secs
lola: 47992797 markings, 191656889 edges, 78039 markings/sec, 420 secs
lola: 48433899 markings, 193606532 edges, 88220 markings/sec, 425 secs
lola: 48858144 markings, 195614863 edges, 84849 markings/sec, 430 secs
lola: 49325362 markings, 197562424 edges, 93444 markings/sec, 435 secs
lola: 49758491 markings, 199422138 edges, 86626 markings/sec, 440 secs
lola: 50146508 markings, 201234627 edges, 77603 markings/sec, 445 secs
lola: 50540228 markings, 203140347 edges, 78744 markings/sec, 450 secs
lola: 50951829 markings, 205144521 edges, 82320 markings/sec, 455 secs
lola: 51375112 markings, 207206613 edges, 84657 markings/sec, 460 secs
lola: 51948572 markings, 209165872 edges, 114692 markings/sec, 465 secs
lola: 52485270 markings, 211072162 edges, 107340 markings/sec, 470 secs
lola: 52933535 markings, 212913376 edges, 89653 markings/sec, 475 secs
lola: 53355974 markings, 214733991 edges, 84488 markings/sec, 480 secs
lola: 53820272 markings, 216615627 edges, 92860 markings/sec, 485 secs
lola: 54205564 markings, 218427012 edges, 77058 markings/sec, 490 secs
lola: 54694823 markings, 220375874 edges, 97852 markings/sec, 495 secs
lola: 55177509 markings, 222367383 edges, 96537 markings/sec, 500 secs
lola: 55595294 markings, 224351327 edges, 83557 markings/sec, 505 secs
lola: 56101687 markings, 226424885 edges, 101279 markings/sec, 510 secs
lola: 56509435 markings, 228282015 edges, 81550 markings/sec, 515 secs
lola: 56903767 markings, 229941918 edges, 78866 markings/sec, 520 secs
lola: 57273292 markings, 231654971 edges, 73905 markings/sec, 525 secs
lola: 57658351 markings, 233460518 edges, 77012 markings/sec, 530 secs
lola: 58062438 markings, 235386368 edges, 80817 markings/sec, 535 secs
lola: 58458000 markings, 237261923 edges, 79112 markings/sec, 540 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1276 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 2552 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 stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-PT-20"
export BK_EXAMINATION="LTLCardinality"
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-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-full"
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 r258-csrt-152732584100143"
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 ;