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 IBM5964-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484500084
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494618754128


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ IBM5964-PT-none @ 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: 402/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 263 places, 139 transitions, 135 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 133 transition conflict sets
lola: TASK
lola: reading formula from IBM5964-PT-none-CTLCardinality.task
lola: ((((callToTask_s00005967_inputCriterion_s00000937_used <= callToTask_s00005970_output_s00000979) OR ((2 <= merge_s00000945_input_s00000935) AND (callToTask_s00002190_output_s00000979 <= callToTask_s00002427_input_s00000952)) OR ((callToTask_s00005967_output_s00000938 + 1 <= merge_s00001290_input_s00001009) AND (callToTask_s00001746_output_s00000956 <= 1))) AND (E (G ((callToTask_s00001632_output_s00000979 <= process_s00000383__s00005964_output_s00001610))) OR E (F ((1 <= callToTask_s00005967_output_s00000979))))) OR ((A (G ((callToTask_s00001971_output_s00000979 <= callToTask_s00001632_inputCriterion_s00000937_used))) OR ((callToTask_s00005967_output_s00000938 <= process_s00000383__s00005964_input_s00001512) AND (1 <= merge_s00001290_activated))) AND E (F (((callToTask_s00002427_output_s00000979 <= callToTask_s00005965_input_s00000950) AND (callToProcess_s00004075_input_s00000950 <= callToTask_s00002741_input_s00000986)))))) : A (F (E (X ((callToTask_s00002185_input_s00000950 + 1 <= callToTask_s00005970_input_s00000935))))) : A (F ((A (G ((merge_s00000945_input_s00000986 <= callToTask_s00005849_input_s00000952))) AND ((callToTask_s00002427_output_s00000979 + 1 <= callToProcess_s00002411_input_s00000950) OR (callToTask_s00005972_output_s00000979 <= 1))))) : (E (F (((process_s00000383__s00005964_input_s00001609 <= callToTask_s00005969_input_s00000935) AND (1 <= callToTask_s00002189_output_s00000960) AND ((2 <= callToTask_s00002181_output_s00000979) OR (3 <= callToTask_s00005968_output_s00000979))))) OR (2 <= callToTask_s00005972_input_s00001009)) : E (((merge_s00000945_input_s00000987 <= callToTask_s00005897_output_s00000938) U ((callToProcess_s00002538_input_s00001011 + 1 <= callToTask_s00001632_output_s00000959) AND (fork_s00001067_activated_s00000991 + 1 <= callToTask_s00002741_inputCriterion_s00000937_used)))) : E (F ((3 <= callToTask_s00002185_output_s00000956))) : A (G (A (F (((callToProcess_s00002411_output_s00000981 <= callToTask_s00005972_input_s00000950) OR (1 <= callToTask_s00002427_input_s00001013)))))) : E (F ((((merge_s00001120_input_s00000950 <= merge_s00001120_input_s00001010) OR ((callToTask_s00002526_output_s00000981 <= callToTask_s00001971_output_s00000938) AND (merge_s00001290_input_s00000950 <= decision_s00001618_activated))) AND E (X ((2 <= process_s00000383__s00005964_output_s00001463)))))) : NOT(E (F (((1 <= callToTask_s00002427_output_s00000938) OR (3 <= endNode_s00000942_input_default) OR ((3 <= callToTask_s00002741_output_s00000960) AND (callToTask_s00005897_inputCriterion_s00000937_used <= callToProcess_s00004075_input_s00000950)))))) : ((((callToTask_s00005969_input_s00000935 + 1 <= callToTask_s00002185_output_s00000956) AND (callToTask_s00002181_output_s00000938 + 1 <= callToTask_s00001632_output_s00000979)) OR ((callToTask_s00005965_input_s00000950 <= 2) AND (callToTask_s00001971_input_s00000985 <= 0)) OR (callToTask_s00001971_output_s00000938 + 1 <= merge_s00001066_activated)) AND A (F (((fork_s00001293_activated_s00000993 + 1 <= callToTask_s00005849_output_s00000960) AND (merge_s00001120_input_s00001010 + 1 <= decision_s00001288_activated))))) : NOT(NOT((E (G ((2 <= callToTask_s00002427_input_s00001203))) OR A (F ((1 <= merge_s00000945_activated)))))) : A (G (((callToTask_s00005970_output_s00000956 <= 1) OR (callToProcess_s00002316_inputCriterion_s00000937_used + 1 <= callToProcess_s00002411_input_s00000935) OR (fork_s00001067_input_s00000950 <= callToTask_s00005969_output_s00000938)))) : E (((decision_s00000999_activated <= callToTask_s00005972_output_s00000979) U (3 <= callToTask_s00002185_input_s00000952))) : ((((callToTask_s00002427_output_s00000938 <= 0) OR (callToTask_s00005967_input_s00000952 + 1 <= callToTask_s00002186_input_s00001011) OR (callToProcess_s00002538_inputCriterion_s00000937_used <= 2)) AND E (((2 <= process_s00000383__s00005964_outputCriterion_s00000939_omega) U (callToTask_s00002183_output_s00000938 <= callToTask_s00005972_input_s00000935)))) AND A (G (((callToTask_s00002186_inputCriterion_s00000937_used <= 1) OR (process_s00000383__s00005964_output_s00001463 + 1 <= fork_s00001536_activated_s00000993))))) : E (F (A (((process_s00000383__s00005964_outputCriterion_s00000939_omega <= callToProcess_s00004075_input_s00000950) U (2 <= callToTask_s00005849_input_s00000950))))) : (A (G (E (G ((callToTask_s00005972_input_s00001009 <= callToTask_s00002190_output_s00000956))))) OR (1 <= process_s00000383__s00005964_input_s00000936))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((callToTask_s00005967_inputCriterion_s00000937_used <= callToTask_s00005970_output_s00000979) OR ((2 <= merge_s00000945_input_s00000935) AND (callToTask_s00002190_output_s00000979 <= callToTask_s00002427_input_s00000952)) OR ((callToTask_s00005967_output_s00000938 + 1 <= merge_s00001290_input_s00001009) AND (callToTask_s00001746_output_s00000956 <= 1))) AND (E (G ((callToTask_s00001632_output... (shortened)
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: ((callToTask_s00005967_inputCriterion_s00000937_used <= callToTask_s00005970_output_s00000979) OR ((2 <= merge_s00000945_input_s00000935) AND (callToTask_s00002190_output_s00000979 <= callToTask_s00002427_input_s00000952)) OR ((callToTask_s00005967_output_s00000938 + 1 <= merge_s00001290_input_s00001009) AND (callToTask_s00001746_output_s00000956 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((callToTask_s00005967_inputCriterion_s00000937_used <= callToTask_s00005970_output_s00000979) OR ((2 <= merge_s00000945_input_s00000935) AND (callToTask_s00002190_output_s00000979 <= callToTask_s00002427_input_s00000952)) OR ((callToTask_s00005967_output_s00000938 + 1 <= merge_s00001290_input_s00001009) AND (callToTask_s00001746_output_s00000956 <= 1)))
lola: processed formula length: 358
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: processed formula with 5 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((callToTask_s00001632_output_s00000979 <= process_s00000383__s00005964_output_s00001610)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (process_s00000383__s00005964_output_s00001610 + 1 <= callToTask_s00001632_output_s00000979)))
lola: processed formula length: 107
lola: 2 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((callToTask_s00002185_input_s00000950 + 1 <= callToTask_s00005970_input_s00000935)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((callToTask_s00002185_input_s00000950 + 1 <= callToTask_s00005970_input_s00000935)))
lola: processed formula length: 96
lola: 2 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((merge_s00000945_input_s00000986 <= callToTask_s00005849_input_s00000952))) AND ((callToTask_s00002427_output_s00000979 + 1 <= callToProcess_s00002411_input_s00000950) OR (callToTask_s00005972_output_s00000979 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(E(TRUE U (callToTask_s00005849_input_s00000952 + 1 <= merge_s00000945_input_s00000986))) AND ((callToTask_s00002427_output_s00000979 + 1 <= callToProcess_s00002411_input_s00000950) OR (callToTask_s00005972_output_s00000979 <= 1))))
lola: processed formula length: 246
lola: 3 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((process_s00000383__s00005964_input_s00001609 <= callToTask_s00005969_input_s00000935) AND (1 <= callToTask_s00002189_output_s00000960) AND ((2 <= callToTask_s00002181_output_s00000979) OR (3 <= callToTask_s00005968_output_s00000979))))) OR (2 <= callToTask_s00005972_input_s00001009))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((process_s00000383__s00005964_input_s00001609 <= callToTask_s00005969_input_s00000935) AND (1 <= callToTask_s00002189_output_s00000960) AND ((2 <= callToTask_s00002181_output_s00000979) OR (3 <= callToTask_s00005968_output_s00000979)))))
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 540 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-CTLCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= callToTask_s00005972_input_s00001009)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= callToTask_s00005972_input_s00001009)
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((merge_s00000945_input_s00000987 <= callToTask_s00005897_output_s00000938) U ((callToProcess_s00002538_input_s00001011 + 1 <= callToTask_s00001632_output_s00000959) AND (fork_s00001067_activated_s00000991 + 1 <= callToTask_s00002741_inputCriterion_s00000937_used))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((merge_s00000945_input_s00000987 <= callToTask_s00005897_output_s00000938) U ((callToProcess_s00002538_input_s00001011 + 1 <= callToTask_s00001632_output_s00000959) AND (fork_s00001067_activated_s00000991 + 1 <= callToTask_s00002741_inputCriterion_s00000937_used)))
lola: processed formula length: 267
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= callToTask_s00002185_output_s00000956)))
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 540 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: state equation: write sara problem file to IBM5964-PT-none-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-CTLCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((callToProcess_s00002411_output_s00000981 <= callToTask_s00005972_input_s00000950) OR (1 <= callToTask_s00002427_input_s00001013))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((callToProcess_s00002411_output_s00000981 <= callToTask_s00005972_input_s00000950) OR (1 <= callToTask_s00002427_input_s00001013))))))
lola: processed formula length: 162
lola: 2 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((merge_s00001120_input_s00000950 <= merge_s00001120_input_s00001010) OR ((callToTask_s00002526_output_s00000981 <= callToTask_s00001971_output_s00000938) AND (merge_s00001290_input_s00000950 <= decision_s00001618_activated))) AND E (X ((2 <= process_s00000383__s00005964_output_s00001463))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (((merge_s00001120_input_s00000950 <= merge_s00001120_input_s00001010) OR ((callToTask_s00002526_output_s00000981 <= callToTask_s00001971_output_s00000938) AND (merge_s00001290_input_s00000950 <= decision_s00001618_activated))) AND EX((2 <= process_s00000383__s00005964_output_s00001463))))
lola: processed formula length: 300
lola: 2 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((1 <= callToTask_s00002427_output_s00000938) OR (3 <= endNode_s00000942_input_default) OR ((3 <= callToTask_s00002741_output_s00000960) AND (callToTask_s00005897_inputCriterion_s00000937_used <= callToProcess_s00004075_input_s00000950))))))
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 540 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 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-CTLCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((callToTask_s00005969_input_s00000935 + 1 <= callToTask_s00002185_output_s00000956) AND (callToTask_s00002181_output_s00000938 + 1 <= callToTask_s00001632_output_s00000979)) OR ((callToTask_s00005965_input_s00000950 <= 2) AND (callToTask_s00001971_input_s00000985 <= 0)) OR (callToTask_s00001971_output_s00000938 + 1 <= merge_s00001066_activated)) AND A (F (((fork_s00001293_activated_s00000993 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((callToTask_s00005969_input_s00000935 + 1 <= callToTask_s00002185_output_s00000956) AND (callToTask_s00002181_output_s00000938 + 1 <= callToTask_s00001632_output_s00000979)) OR ((callToTask_s00005965_input_s00000950 <= 2) AND (callToTask_s00001971_input_s00000985 <= 0)) OR (callToTask_s00001971_output_s00000938 + 1 <= merge_s00001066_activated))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((callToTask_s00005969_input_s00000935 + 1 <= callToTask_s00002185_output_s00000956) AND (callToTask_s00002181_output_s00000938 + 1 <= callToTask_s00001632_output_s00000979)) OR ((callToTask_s00005965_input_s00000950 <= 2) AND (callToTask_s00001971_input_s00000985 <= 0)) OR (callToTask_s00001971_output_s00000938 + 1 <= merge_s00001066_activated))
lola: processed formula length: 351
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: processed formula with 5 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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((fork_s00001293_activated_s00000993 + 1 <= callToTask_s00005849_output_s00000960) AND (merge_s00001120_input_s00001010 + 1 <= decision_s00001288_activated))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((fork_s00001293_activated_s00000993 + 1 <= callToTask_s00005849_output_s00000960) AND (merge_s00001120_input_s00001010 + 1 <= decision_s00001288_activated)))
lola: processed formula length: 167
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: lola: SUBRESULT========================================

lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((E (G ((2 <= callToTask_s00002427_input_s00001203))) OR A (F ((1 <= merge_s00000945_activated))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= callToTask_s00002427_input_s00001203)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (callToTask_s00002427_input_s00001203 <= 1)))
lola: processed formula length: 58
lola: 16 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= merge_s00000945_activated)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= merge_s00000945_activated))
lola: processed formula length: 42
lola: 15 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: SUBRESULT
lola: result: nolola:
========================================lola:
The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((callToTask_s00005970_output_s00000956 <= 1) OR (callToProcess_s00002316_inputCriterion_s00000937_used + 1 <= callToProcess_s00002411_input_s00000935) OR (fork_s00001067_input_s00000950 <= callToTask_s00005969_output_s00000938))))
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 540 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-CTLCardinality-11.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((decision_s00000999_activated <= callToTask_s00005972_output_s00000979) U (3 <= callToTask_s00002185_input_s00000952)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((decision_s00000999_activated <= callToTask_s00005972_output_s00000979) U (3 <= callToTask_s00002185_input_s00000952))
lola: processed formula length: 120
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((callToTask_s00002427_output_s00000938 <= 0) OR (callToTask_s00005967_input_s00000952 + 1 <= callToTask_s00002186_input_s00001011) OR (callToProcess_s00002538_inputCriterion_s00000937_used <= 2)) AND E (((2 <= process_s00000383__s00005964_outputCriterion_s00000939_omega) U (callToTask_s00002183_output_s00000938 <= callToTask_s00005972_input_s00000935)))) AND A (G (((callToTask_s00002186_input... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((callToTask_s00002427_output_s00000938 <= 0) OR (callToTask_s00005967_input_s00000952 + 1 <= callToTask_s00002186_input_s00001011) OR (callToProcess_s00002538_inputCriterion_s00000937_used <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((callToTask_s00002427_output_s00000938 <= 0) OR (callToTask_s00005967_input_s00000952 + 1 <= callToTask_s00002186_input_s00001011) OR (callToProcess_s00002538_inputCriterion_s00000937_used <= 2))
lola: processed formula length: 198
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: processed formula with 3 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 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((2 <= process_s00000383__s00005964_outputCriterion_s00000939_omega) U (callToTask_s00002183_output_s00000938 <= callToTask_s00005972_input_s00000935)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((2 <= process_s00000383__s00005964_outputCriterion_s00000939_omega) U (callToTask_s00002183_output_s00000938 <= callToTask_s00005972_input_s00000935))
lola: processed formula length: 152
lola: 2 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((callToTask_s00002186_inputCriterion_s00000937_used <= 1) OR (process_s00000383__s00005964_output_s00001463 + 1 <= fork_s00001536_activated_s00000993))))
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 540 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-CTLCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: lola: SUBRESULT
========================================
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((process_s00000383__s00005964_outputCriterion_s00000939_omega <= callToProcess_s00004075_input_s00000950) U (2 <= callToTask_s00005849_input_s00000950)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((process_s00000383__s00005964_outputCriterion_s00000939_omega <= callToProcess_s00004075_input_s00000950) U (2 <= callToTask_s00005849_input_s00000950)))
lola: processed formula length: 164
lola: 2 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (G ((callToTask_s00005972_input_s00001009 <= callToTask_s00002190_output_s00000956))))) OR (1 <= process_s00000383__s00005964_input_s00000936))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((callToTask_s00005972_input_s00001009 <= callToTask_s00002190_output_s00000956)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (callToTask_s00002190_output_s00000956 + 1 <= callToTask_s00005972_input_s00001009))))
lola: processed formula length: 108
lola: 4 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: lola: ========================================
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no no yes no yes no no yes no yes no yes
FORMULA IBM5964-PT-none-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494618754441

--------------------
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="IBM5964-PT-none"
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/IBM5964-PT-none.tgz
mv IBM5964-PT-none 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 IBM5964-PT-none, 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 r038-blw7-149440484500084"
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 ;