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 892K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K 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.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 26K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K 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-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666472700479
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527141869234


BK_STOP 1527142648419

--------------------
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-02 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': 1698283, 'Memory': 15945.32, 'Tool': 'lola'}, {'Time': 1700645, 'Memory': 15946.14, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PermAdmissibility-PT-02...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
PermAdmissibility-PT-02: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PermAdmissibility-PT-02 @ 3540 seconds
----- 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-02-CTLCardinality.task
lola: E (X ((((in1_0 + in1_1 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux7_2 + aux7_3 + aux7_6 + aux7_7) OR ((aux6_0 + aux6_1 + aux6_4 + aux6_5 <= c7) AND (2 <= c7))) AND A (F ((2 <= c20)))))) : E (G (((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= 0) OR (c16 <= 0) OR (3 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)))) : (E (G (((in3_4 + in3_5 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 1)))) AND E (X ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)))) : A (F (((out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= c6) AND (3 <= in2_2 + in2_3) AND (c19 + 1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) AND (3 <= c12) AND (3 <= c16) AND (c20 <= 1)))) : (NOT((E (F ((in2_2 + in2_3 <= aux7_2 + aux7_3 + aux7_6 + aux7_7))) AND A (X ((2 <= aux5_0 + aux5_1 + aux5_4 + aux5_5))))) OR (A (G (((2 <= c14) AND (c6 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))) OR E (G (((3 <= in2_2 + in2_3) OR (3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)))))) : E (G (E (F (((in2_2 + in2_3 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) AND (c15 <= in3_4 + in3_5)))))) : E (G (NOT(A (G ((3 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)))))) : NOT(A (F (A (G ((c9 <= in3_4 + in3_5)))))) : (((((out3_2 <= 2) AND (aux16_6 + 1 <= c15)) OR (2 <= out7_5)) AND A (F (((aux15_2 <= aux11_3) AND (2 <= out7_5))))) OR E (G (((aux16_6 <= 0) OR (out5_2 + 1 <= out6_7))))) : A ((A (X ((out8_5 <= c110))) U ((c17 + 1 <= aux5_1) OR (out7_6 + 1 <= aux5_4)))) : E (F ((A (F ((1 <= c19))) AND (aux13_0 + 1 <= out4_5)))) : NOT((A (F (((2 <= out6_0) OR (2 <= aux9_0)))) OR E (G ((aux10_3 + 1 <= out5_1))))) : A (X (A (F (((2 <= in1_1) AND (out6_6 <= out1_5)))))) : E (G ((out1_4 <= aux6_4))) : ((((1 <= out2_7) AND (aux7_3 <= aux11_2)) AND (E (F ((2 <= out7_6))) AND (3 <= aux6_1))) OR E (G (E (G ((c8 <= in4_6)))))) : A (F ((A (X ((3 <= aux13_7))) OR E (G ((out1_3 <= out4_2))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((((in1_0 + in1_1 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux7_2 + aux7_3 + aux7_6 + aux7_7) OR ((aux6_0 + aux6_1 + aux6_4 + aux6_5 <= c7) AND (2 <= c7))) AND A (F ((2 <= c20))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((((in1_0 + in1_1 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= aux7_2 + aux7_3 + aux7_6 + aux7_7) OR ((aux6_0 + aux6_1 + aux6_4 + aux6_5 <= c7) AND (2 <= c7))) AND A(TRUE U (2 <= c20))))
lola: processed formula length: 304
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-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: 38 markings, 40 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= 0) OR (c16 <= 0) OR (3 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7) AND (1 <= c16) AND (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 2))))
lola: processed formula length: 205
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 64 markings, 63 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((in3_4 + in3_5 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 1)))) AND E (X ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= 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 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((in3_4 + in3_5 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 + 1 <= in3_4 + in3_5) AND (2 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))))
lola: processed formula length: 198
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= 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: EX((aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7))
lola: processed formula length: 156
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= c6) AND (3 <= in2_2 + in2_3) AND (c19 + 1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) AND (3 <= c12) AND (3 <= c16) AND (c20 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= c6) AND (3 <= in2_2 + in2_3) AND (c19 + 1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) AND (3 <= c12) AND (3 <= c16) AND (c20 <= 1))))
lola: processed formula: A (F (((out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= c6) AND (3 <= in2_2 + in2_3) AND (c19 + 1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) AND (3 <= c12) AND (3 <= c16) AND (c20 <= 1))))
lola: processed formula length: 244
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (F ((in2_2 + in2_3 <= aux7_2 + aux7_3 + aux7_6 + aux7_7))) AND A (X ((2 <= aux5_0 + aux5_1 + aux5_4 + aux5_5))))) OR (A (G (((2 <= c14) AND (c6 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7)))) OR E (G (((3 <= in2_2 + in2_3) OR (3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((aux7_2 + aux7_3 + aux7_6 + aux7_7 + 1 <= in2_2 + in2_3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= 1))
lola: processed formula length: 44
lola: 9 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= c14) AND (c6 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= in2_2 + in2_3) OR (3 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((in2_2 + in2_3 <= 2) AND (out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7 <= 2))))
lola: processed formula length: 118
lola: 10 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 956 markings, 1276 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((in2_2 + in2_3 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) AND (c15 <= in3_4 + in3_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((in2_2 + in2_3 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) AND (c15 <= in3_4 + in3_5))))))
lola: processed formula length: 147
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-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: 33 markings, 82 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (G ((3 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 2)))))
lola: processed formula length: 114
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-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: 33 markings, 65 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (G ((c9 <= in3_4 + in3_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (in3_4 + in3_5 + 1 <= c9)))))
lola: processed formula length: 55
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-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: 1037926 markings, 2741983 edges, 3689329903141912576 markings/sec, 0 secs
lola: 2070100 markings, 5703277 edges, 206435 markings/sec, 5 secs
lola: 3125635 markings, 8424429 edges, 211107 markings/sec, 10 secs
lola: 4122634 markings, 10909738 edges, 199400 markings/sec, 15 secs
lola: 4986213 markings, 13198146 edges, 172716 markings/sec, 20 secs
lola: 5869210 markings, 15426305 edges, 176599 markings/sec, 25 secs
lola: 6771557 markings, 17789918 edges, 180469 markings/sec, 30 secs
lola: 7642681 markings, 20098088 edges, 174225 markings/sec, 35 secs
lola: 8496649 markings, 22782914 edges, 170794 markings/sec, 40 secs
lola: 9327993 markings, 25341045 edges, 166269 markings/sec, 45 secs
lola: 10156319 markings, 27849236 edges, 165665 markings/sec, 50 secs
lola: 10969870 markings, 30520192 edges, 162710 markings/sec, 55 secs
lola: 11833327 markings, 32940219 edges, 172691 markings/sec, 60 secs
lola: 12707428 markings, 35145539 edges, 174820 markings/sec, 65 secs
lola: 13701435 markings, 37671481 edges, 198801 markings/sec, 70 secs
lola: 14678453 markings, 40136137 edges, 195404 markings/sec, 75 secs
lola: 15687196 markings, 42584131 edges, 201749 markings/sec, 80 secs
lola: 16657345 markings, 44933489 edges, 194030 markings/sec, 85 secs
lola: 17577777 markings, 47277368 edges, 184086 markings/sec, 90 secs
lola: 18462054 markings, 49648635 edges, 176855 markings/sec, 95 secs
lola: 19319156 markings, 51979432 edges, 171420 markings/sec, 100 secs
lola: 20164120 markings, 54088631 edges, 168993 markings/sec, 105 secs
lola: 21007455 markings, 56589833 edges, 168667 markings/sec, 110 secs
lola: 21839887 markings, 59099878 edges, 166486 markings/sec, 115 secs
lola: 22632003 markings, 61452400 edges, 158423 markings/sec, 120 secs
lola: 23447933 markings, 63975444 edges, 163186 markings/sec, 125 secs
lola: 24321802 markings, 66564389 edges, 174774 markings/sec, 130 secs
lola: 25135627 markings, 69031103 edges, 162765 markings/sec, 135 secs
lola: 25970942 markings, 71498642 edges, 167063 markings/sec, 140 secs
lola: 26880813 markings, 74195886 edges, 181974 markings/sec, 145 secs
lola: 27743781 markings, 76752928 edges, 172594 markings/sec, 150 secs
lola: 28534286 markings, 79179705 edges, 158101 markings/sec, 155 secs
lola: 29313854 markings, 81531475 edges, 155914 markings/sec, 160 secs
lola: 30089940 markings, 83876686 edges, 155217 markings/sec, 165 secs
lola: 30905594 markings, 86214925 edges, 163131 markings/sec, 170 secs
lola: 31783120 markings, 88569365 edges, 175505 markings/sec, 175 secs
lola: 32637256 markings, 90895718 edges, 170827 markings/sec, 180 secs
lola: 33585534 markings, 93425197 edges, 189656 markings/sec, 185 secs
lola: 34542297 markings, 95901140 edges, 191353 markings/sec, 190 secs
lola: 35377179 markings, 98249306 edges, 166976 markings/sec, 195 secs
lola: 36201331 markings, 100561871 edges, 164830 markings/sec, 200 secs
lola: 37102881 markings, 102701937 edges, 180310 markings/sec, 205 secs
lola: 38004608 markings, 104962108 edges, 180345 markings/sec, 210 secs
lola: 38925845 markings, 107423075 edges, 184247 markings/sec, 215 secs
lola: 39796638 markings, 109785913 edges, 174159 markings/sec, 220 secs
lola: 40660352 markings, 112048237 edges, 172743 markings/sec, 225 secs
lola: 41476837 markings, 114119537 edges, 163297 markings/sec, 230 secs
lola: 42261523 markings, 115987096 edges, 156937 markings/sec, 235 secs
lola: 43133303 markings, 118187159 edges, 174356 markings/sec, 240 secs
lola: 44022616 markings, 120630749 edges, 177863 markings/sec, 245 secs
lola: 44902636 markings, 123103409 edges, 176004 markings/sec, 250 secs
lola: 45746160 markings, 125474778 edges, 168705 markings/sec, 255 secs
lola: 46587931 markings, 127766869 edges, 168354 markings/sec, 260 secs
lola: 47499146 markings, 130065000 edges, 182243 markings/sec, 265 secs
lola: 48338811 markings, 132269090 edges, 167933 markings/sec, 270 secs
lola: 49151837 markings, 134568772 edges, 162605 markings/sec, 275 secs
lola: 49991567 markings, 136951870 edges, 167946 markings/sec, 280 secs
lola: 50877729 markings, 139316663 edges, 177232 markings/sec, 285 secs
lola: 51753056 markings, 141610989 edges, 175065 markings/sec, 290 secs
lola: 52644866 markings, 143938402 edges, 178362 markings/sec, 295 secs
lola: 53480909 markings, 146285303 edges, 167209 markings/sec, 300 secs
lola: 54340417 markings, 148723522 edges, 171902 markings/sec, 305 secs
lola: 55209976 markings, 150991152 edges, 173912 markings/sec, 310 secs
lola: 56133220 markings, 153525342 edges, 184649 markings/sec, 315 secs
lola: 57047098 markings, 156018863 edges, 182776 markings/sec, 320 secs
lola: 57847579 markings, 158112837 edges, 160096 markings/sec, 325 secs
lola: 58668539 markings, 160224497 edges, 164192 markings/sec, 330 secs
lola: 59465216 markings, 162269475 edges, 159335 markings/sec, 335 secs
lola: 60213463 markings, 164302631 edges, 149649 markings/sec, 340 secs
lola: 60979518 markings, 166228230 edges, 153211 markings/sec, 345 secs
lola: 61729167 markings, 168282966 edges, 149930 markings/sec, 350 secs
lola: 62488448 markings, 170239062 edges, 151856 markings/sec, 355 secs
lola: 63200266 markings, 172178678 edges, 142364 markings/sec, 360 secs
lola: 63976448 markings, 174114065 edges, 155236 markings/sec, 365 secs
lola: 64856854 markings, 176398262 edges, 176081 markings/sec, 370 secs
lola: 65701888 markings, 178942526 edges, 169007 markings/sec, 375 secs
lola: 66507131 markings, 181534535 edges, 161049 markings/sec, 380 secs
lola: 67370350 markings, 183967203 edges, 172644 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((out3_2 <= 2) AND (aux16_6 + 1 <= c15)) OR (2 <= out7_5)) AND A (F (((aux15_2 <= aux11_3) AND (2 <= out7_5))))) OR E (G (((aux16_6 <= 0) OR (out5_2 + 1 <= out6_7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((out3_2 <= 2) AND (aux16_6 + 1 <= c15)) OR (2 <= out7_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((out3_2 <= 2) AND (aux16_6 + 1 <= c15)) OR (2 <= out7_5))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
lola: processed formula with 3 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 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((aux16_6 <= 0) OR (out5_2 + 1 <= out6_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= aux16_6) AND (out6_7 <= out5_2))))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 33 markings, 32 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((out8_5 <= c110))) U ((c17 + 1 <= aux5_1) OR (out7_6 + 1 <= aux5_4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX((out8_5 <= c110)) U ((c17 + 1 <= aux5_1) OR (out7_6 + 1 <= aux5_4)))
lola: processed formula length: 74
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-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: 2365 markings, 2368 edges
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (F ((1 <= c19))) AND (aux13_0 + 1 <= out4_5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: E(TRUE U (A(TRUE U (1 <= c19)) AND (aux13_0 + 1 <= out4_5)))
lola: processed formula length: 60
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-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: 1349392 markings, 1931921 edges, 3689329903141912576 markings/sec, 0 secs
lola: 2510582 markings, 3637170 edges, 232238 markings/sec, 5 secs
lola: 3695662 markings, 5261270 edges, 237016 markings/sec, 10 secs
lola: 4821744 markings, 6890513 edges, 225216 markings/sec, 15 secs
lola: 5868649 markings, 8446017 edges, 209381 markings/sec, 20 secs
lola: 6974629 markings, 10052066 edges, 221196 markings/sec, 25 secs
lola: 8082381 markings, 11651935 edges, 221550 markings/sec, 30 secs
lola: 9139687 markings, 13248535 edges, 211461 markings/sec, 35 secs
lola: 10211614 markings, 14828012 edges, 214385 markings/sec, 40 secs
lola: 11230139 markings, 16439954 edges, 203705 markings/sec, 45 secs
lola: 12193964 markings, 18348007 edges, 192765 markings/sec, 50 secs
lola: 13099021 markings, 20193889 edges, 181011 markings/sec, 55 secs
lola: 14009743 markings, 22036867 edges, 182144 markings/sec, 60 secs
lola: 14955554 markings, 23904675 edges, 189162 markings/sec, 65 secs
lola: 15892366 markings, 25681588 edges, 187362 markings/sec, 70 secs
lola: 16728122 markings, 27499030 edges, 167151 markings/sec, 75 secs
lola: 17901518 markings, 29160348 edges, 234679 markings/sec, 80 secs
lola: 19005452 markings, 30690712 edges, 220787 markings/sec, 85 secs
lola: 20069144 markings, 32187178 edges, 212738 markings/sec, 90 secs
lola: 21055780 markings, 33603566 edges, 197327 markings/sec, 95 secs
lola: 22090277 markings, 35068412 edges, 206899 markings/sec, 100 secs
lola: 23072616 markings, 36513573 edges, 196468 markings/sec, 105 secs
lola: 24029730 markings, 37972433 edges, 191423 markings/sec, 110 secs
lola: 24898284 markings, 39569113 edges, 173711 markings/sec, 115 secs
lola: 25833384 markings, 41258026 edges, 187020 markings/sec, 120 secs
lola: 26761400 markings, 42960261 edges, 185603 markings/sec, 125 secs
lola: 27723865 markings, 44639524 edges, 192493 markings/sec, 130 secs
lola: 28610137 markings, 46185439 edges, 177254 markings/sec, 135 secs
lola: 29625452 markings, 47601713 edges, 203063 markings/sec, 140 secs
lola: 30584473 markings, 49031316 edges, 191804 markings/sec, 145 secs
lola: 31520131 markings, 50582616 edges, 187132 markings/sec, 150 secs
lola: 32436245 markings, 52101663 edges, 183223 markings/sec, 155 secs
lola: 33336770 markings, 53644682 edges, 180105 markings/sec, 160 secs
lola: 34339956 markings, 55079288 edges, 200637 markings/sec, 165 secs
lola: 35304638 markings, 56606259 edges, 192936 markings/sec, 170 secs
lola: 36125424 markings, 58061027 edges, 164157 markings/sec, 175 secs
lola: 36944060 markings, 59509214 edges, 163727 markings/sec, 180 secs
lola: 37951107 markings, 60935793 edges, 201409 markings/sec, 185 secs
lola: 38966496 markings, 62320537 edges, 203078 markings/sec, 190 secs
lola: 40043048 markings, 63766978 edges, 215310 markings/sec, 195 secs
lola: 41129643 markings, 65268960 edges, 217319 markings/sec, 200 secs
lola: 42068593 markings, 66621530 edges, 187790 markings/sec, 205 secs
lola: 42943697 markings, 68104774 edges, 175021 markings/sec, 210 secs
lola: 43837175 markings, 69552258 edges, 178696 markings/sec, 215 secs
lola: 44660158 markings, 71030635 edges, 164597 markings/sec, 220 secs
lola: 45638706 markings, 72444955 edges, 195710 markings/sec, 225 secs
lola: 46551495 markings, 73712071 edges, 182558 markings/sec, 230 secs
lola: 47352616 markings, 75104900 edges, 160224 markings/sec, 235 secs
lola: 48203151 markings, 76594014 edges, 170107 markings/sec, 240 secs
lola: 49141644 markings, 78045145 edges, 187699 markings/sec, 245 secs
lola: 50229186 markings, 79477478 edges, 217508 markings/sec, 250 secs
lola: 51306561 markings, 81006274 edges, 215475 markings/sec, 255 secs
lola: 52326408 markings, 82431607 edges, 203969 markings/sec, 260 secs
lola: 53344302 markings, 83837097 edges, 203579 markings/sec, 265 secs
lola: 54356847 markings, 85229115 edges, 202509 markings/sec, 270 secs
lola: 55388653 markings, 86588362 edges, 206361 markings/sec, 275 secs
lola: 56350168 markings, 87926152 edges, 192303 markings/sec, 280 secs
lola: 57289979 markings, 89320746 edges, 187962 markings/sec, 285 secs
lola: 58185103 markings, 90616030 edges, 179025 markings/sec, 290 secs
lola: 59172086 markings, 91942217 edges, 197397 markings/sec, 295 secs
lola: 60158160 markings, 93274816 edges, 197215 markings/sec, 300 secs
lola: 61112479 markings, 94642011 edges, 190864 markings/sec, 305 secs
lola: 62055695 markings, 96027611 edges, 188643 markings/sec, 310 secs
lola: 63018193 markings, 97340385 edges, 192500 markings/sec, 315 secs
lola: 63952086 markings, 98616868 edges, 186779 markings/sec, 320 secs
lola: 64765393 markings, 99922076 edges, 162661 markings/sec, 325 secs
lola: 65616881 markings, 101323166 edges, 170298 markings/sec, 330 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 561 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F (((2 <= out6_0) OR (2 <= aux9_0)))) OR E (G ((aux10_3 + 1 <= out5_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 561 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((out6_0 <= 1) AND (aux9_0 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= out6_0) OR (2 <= aux9_0))))
lola: processed formula length: 48
lola: 9 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 33 markings, 32 edges
lola: subprocess 12 will run for 701 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((out5_1 <= aux10_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((out5_1 <= aux10_3)))
lola: ========================================
lola: processed formula: A (F ((out5_1 <= aux10_3)))
lola: processed formula length: 27
lola: 7 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-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: 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 701 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((2 <= in1_1) AND (out6_6 <= out1_5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U ((2 <= in1_1) AND (out6_6 <= out1_5))))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-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: 32 markings, 31 edges
lola: ========================================
lola: subprocess 13 will run for 935 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((out1_4 <= aux6_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (aux6_4 + 1 <= out1_4)))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 14 will run for 1402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((1 <= out2_7) AND (aux7_3 <= aux11_2)) AND (E (F ((2 <= out7_6))) AND (3 <= aux6_1))) OR E (G (E (G ((c8 <= in4_6))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= out2_7) AND (aux7_3 <= aux11_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= out2_7) AND (aux7_3 <= aux11_2))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-CTLCardinality.task
lola: processed formula with 2 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 15 will run for 2805 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((c8 <= in4_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (in4_6 + 1 <= c8))))
lola: processed formula length: 42
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-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: 33 markings, 97 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2805 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((3 <= aux13_7))) OR E (G ((out1_3 <= out4_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (AX((3 <= aux13_7)) OR NOT(A(TRUE U (out4_2 + 1 <= out1_3)))))
lola: processed formula length: 71
lola: 4 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-02-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 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: 33 markings, 33 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no yes yes unknown yes no unknown yes no yes yes yes
FORMULA PermAdmissibility-PT-02-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-02-CTLCardinality-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-02"
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-02.tgz
mv PermAdmissibility-PT-02 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-02, 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-152666472700479"
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 ;