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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is DLCround-PT-08b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-csrt-149580961800300
=====================================================================

--------------------
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 DLCround-PT-08b-CTLCardinality-0
FORMULA_NAME DLCround-PT-08b-CTLCardinality-1
FORMULA_NAME DLCround-PT-08b-CTLCardinality-10
FORMULA_NAME DLCround-PT-08b-CTLCardinality-11
FORMULA_NAME DLCround-PT-08b-CTLCardinality-12
FORMULA_NAME DLCround-PT-08b-CTLCardinality-13
FORMULA_NAME DLCround-PT-08b-CTLCardinality-14
FORMULA_NAME DLCround-PT-08b-CTLCardinality-15
FORMULA_NAME DLCround-PT-08b-CTLCardinality-2
FORMULA_NAME DLCround-PT-08b-CTLCardinality-3
FORMULA_NAME DLCround-PT-08b-CTLCardinality-4
FORMULA_NAME DLCround-PT-08b-CTLCardinality-5
FORMULA_NAME DLCround-PT-08b-CTLCardinality-6
FORMULA_NAME DLCround-PT-08b-CTLCardinality-7
FORMULA_NAME DLCround-PT-08b-CTLCardinality-8
FORMULA_NAME DLCround-PT-08b-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496540473708


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


checking for too many tokens
===========================================================================================
DLCround-PT-08b: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ DLCround-PT-08b @ 3540 seconds
----- 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: 7820/65536 symbol table entries, 1621 collisions
lola: preprocessing...
lola: finding significant places
lola: 3088 places, 4732 transitions, 2931 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 6628 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-08b-CTLCardinality.task
lola: (A (G ((2 <= p1248))) OR A (F (E (X ((3 <= p2661)))))) : (((2 <= p1954) AND ((p2513 <= p1804) OR (1 <= p2655))) OR (A (X ((p2982 + 1 <= p2360))) OR A (G (((p2572 <= p2966) OR (p356 <= p2268)))))) : (((A (X ((3 <= p3009))) OR ((p1066 <= 2) AND (p75 <= 2))) AND E (X (((2 <= p506) OR (p665 <= p2534))))) AND A (F ((((p438 <= p929) OR (3 <= p2872)) AND (3 <= p2457))))) : A (X ((((p2838 + 1 <= p2689) AND (p905 <= p1495)) OR E (G ((p2915 <= p2293)))))) : (A (X (E (G ((p2675 <= p1071))))) AND (p1504 <= p2080)) : A (F ((((p1990 <= p3085) OR (p199 <= p1407) OR (2 <= p18)) AND A (G ((2 <= p720)))))) : A (G (((p1700 <= 1) OR (p2914 <= 2) OR ((3 <= p888) AND (p1922 + 1 <= p2722))))) : A (G ((p223 <= p1766))) : ((3 <= p251) OR NOT(E (G (((3 <= p2976) OR (p763 <= p2182)))))) : NOT(A ((((p2256 <= p2319) OR (3 <= p285)) U (p1505 + 1 <= p1337)))) : (E (G (((p2733 <= 0) AND (p597 <= p1414)))) AND (p1888 <= p102)) : E (G ((p2027 <= p1713))) : ((p2764 + 1 <= p2178) OR A (F (((p2047 + 1 <= p1240) OR (p2743 + 1 <= p2305))))) : E (F (((2 <= p834) AND ((p1619 <= p159) OR (2 <= p19)) AND (p1080 <= p2952)))) : A (F ((A (G ((p1542 <= p1719))) AND A (F ((3 <= p1076)))))) : E (F ((p304 + 1 <= p1712)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((2 <= p1248))) OR A (F (E (X ((3 <= p2661))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p1248)))
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 368 bytes per marking, with 13 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: lola: ========================================subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)

lola: ========================================
lola: ...considering subproblem: A (F (E (X ((3 <= p2661)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((3 <= p2661)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 368 bytes per marking, with 13 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: lola: ========================================
SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p1954) AND ((p2513 <= p1804) OR (1 <= p2655))) OR (A (X ((p2982 + 1 <= p2360))) OR A (G (((p2572 <= p2966) OR (p356 <= p2268))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p1954) AND ((p2513 <= p1804) OR (1 <= p2655)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((2 <= p1954) AND ((p2513 <= p1804) OR (1 <= p2655)))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p2982 + 1 <= p2360)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((p2982 + 1 <= p2360))
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 368 bytes per marking, with 13 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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2572 <= p2966) OR (p356 <= p2268))))
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 368 bytes per marking, with 13 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-08b-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-08b-CTLCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: ========================================SUBRESULT

lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (X ((3 <= p3009))) OR ((p1066 <= 2) AND (p75 <= 2))) AND E (X (((2 <= p506) OR (p665 <= p2534))))) AND A (F ((((p438 <= p929) OR (3 <= p2872)) AND (3 <= p2457)))))
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: A (X ((3 <= p3009)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((3 <= p3009))
lola: processed formula length: 16
lola: 2 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 368 bytes per marking, with 13 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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p1066 <= 2) AND (p75 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p1066 <= 2) AND (p75 <= 2))
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((2 <= p506) OR (p665 <= p2534))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((2 <= p506) OR (p665 <= p2534)))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 368 bytes per marking, with 13 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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((p438 <= p929) OR (3 <= p2872)) AND (3 <= p2457))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((p438 <= p929) OR (3 <= p2872)) AND (3 <= p2457)))
lola: processed formula length: 62
lola: 2 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 368 bytes per marking, with 13 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: SUBRESULT
lola: result: no
lola: lola: The Boolean predicate is false.
========================================
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((((p2838 + 1 <= p2689) AND (p905 <= p1495)) OR E (G ((p2915 <= p2293))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((((p2838 + 1 <= p2689) AND (p905 <= p1495)) OR NOT(A(TRUE U (p2293 + 1 <= p2915)))))
lola: processed formula length: 87
lola: 3 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 368 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (E (G ((p2675 <= p1071))))) AND (p1504 <= p2080))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((p2675 <= p1071)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (p1071 + 1 <= p2675))))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 368 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p1504 <= p2080)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1504 <= p2080)
lola: processed formula length: 16
lola: 0 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: SUBRESULT
lola: lola: result: yes
========================================
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((p1990 <= p3085) OR (p199 <= p1407) OR (2 <= p18)) AND A (G ((2 <= p720))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((p1990 <= p3085) OR (p199 <= p1407) OR (2 <= p18)) AND NOT(E(TRUE U (p720 <= 1)))))
lola: processed formula length: 96
lola: 3 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 368 bytes per marking, with 13 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1700 <= 1) OR (p2914 <= 2) OR ((3 <= p888) AND (p1922 + 1 <= p2722)))))
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 368 bytes per marking, with 13 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-08b-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-08b-CTLCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 180511 markings, 201573 edges, 36102 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p223 <= p1766)))
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 368 bytes per marking, with 13 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: state equation: write sara problem file to DLCround-PT-08b-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-08b-CTLCardinality-7.sara.
lola: sara is running 0 secs || 43728 markings, 52800 edges, 8746 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p251) OR NOT(E (G (((3 <= p2976) OR (p763 <= p2182))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p251)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p251)
lola: processed formula length: 11
lola: 3 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.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: ========================================
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p2976 <= 2) AND (p2182 + 1 <= p763))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p2976 <= 2) AND (p2182 + 1 <= p763)))
lola: processed formula length: 48
lola: 4 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 368 bytes per marking, with 13 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A ((((p2256 <= p2319) OR (3 <= p285)) U (p1505 + 1 <= p1337))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(((p2256 <= p2319) OR (3 <= p285)) U (p1505 + 1 <= p1337)))
lola: processed formula length: 65
lola: 7 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 368 bytes per marking, with 13 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: ========================================
lola: subprocess 10 will run for 587 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((p2733 <= 0) AND (p597 <= p1414)))) AND (p1888 <= p102))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 587 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p2733 <= 0) AND (p597 <= p1414))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= p2733) OR (p1414 + 1 <= p597))))
lola: processed formula length: 53
lola: 2 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 368 bytes per marking, with 13 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: ========================================
lola: subprocess 11 will run for 705 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p1888 <= p102)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1888 <= p102)
lola: processed formula length: 15
lola: 0 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 705 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p2027 <= p1713)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p1713 + 1 <= p2027)))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 368 bytes per marking, with 13 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: ========================================
lola: subprocess 12 will run for 881 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p2764 + 1 <= p2178) OR A (F (((p2047 + 1 <= p1240) OR (p2743 + 1 <= p2305)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 881 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p2764 + 1 <= p2178)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p2764 + 1 <= p2178)
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.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: ========================================
lola: subprocess 13 will run for 1175 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p2047 + 1 <= p1240) OR (p2743 + 1 <= p2305))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p2047 + 1 <= p1240) OR (p2743 + 1 <= p2305)))
lola: processed formula length: 57
lola: 1 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 368 bytes per marking, with 13 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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 13 will run for 1175 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p834) AND ((p1619 <= p159) OR (2 <= p19)) AND (p1080 <= p2952))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 368 bytes per marking, with 13 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-08b-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-08b-CTLCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 93593 markings, 108146 edges, 18719 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1759 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((p1542 <= p1719))) AND A (F ((3 <= p1076))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U (p1719 + 1 <= p1542))) AND A(TRUE U (3 <= p1076))))
lola: processed formula length: 74
lola: 4 rewrites
lola: formula mentions 0 of 3088 places; total mentions: 0
lola: closed formula file DLCround-PT-08b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 368 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 3519 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p304 + 1 <= p1712)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 368 bytes per marking, with 13 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: state equation: write sara problem file to DLCround-PT-08b-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-08b-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 43395 markings, 52397 edges, 8679 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: no no no yes yes no yes no no yes yes yes no no no yes
lola: ========================================
FORMULA DLCround-PT-08b-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08b-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08b-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08b-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08b-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08b-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08b-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08b-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08b-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08b-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08b-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08b-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08b-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08b-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08b-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08b-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496540500322

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="DLCround-PT-08b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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/DLCround-PT-08b.tgz
mv DLCround-PT-08b execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is DLCround-PT-08b, 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 r178-csrt-149580961800300"
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 ;