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 396K
-rw-r--r-- 1 mcc users 5.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 5.6K 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 9.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 193K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is IBM703-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-152658633000185
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526721891463


BK_STOP 1526721937325

--------------------
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 IBM703-PT-none as instance name.
Using IBM703 as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': True, 'Extended Free Choice': True, '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': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 338, 'Memory': 111.34, 'Tool': 'lola'}, {'Time': 418, 'Memory': 110.37, 'Tool': 'lola'}, {'Time': 1127, 'Memory': 139.41, 'Tool': 'gspn'}, {'Time': 3530, 'Memory': 159.78, 'Tool': 'gspn'}, {'Time': 3558, 'Memory': 2207.61, 'Tool': 'marcie'}, {'Time': 3594, 'Memory': 2207.39, 'Tool': 'marcie'}, {'Time': 5073, 'Memory': 346.69, 'Tool': 'itstools'}, {'Time': 5385, 'Memory': 335.22, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola IBM703-PT-none...

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


checking for too many tokens
===========================================================================================
IBM703-PT-none: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ IBM703-PT-none @ 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: 546/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 262 places, 284 transitions, 261 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 261 transition conflict sets
lola: TASK
lola: reading formula from IBM703-PT-none-CTLCardinality.task
lola: (E (G (((task_s00000732_input_s00000263 <= merge_s00000462_input_s00000285) OR (callToProcess_s00000596_output_s00000264 <= merge_s00000446_input_s00000263) OR ((2 <= merge_s00000457_activated) AND (task_s00000746_output_s00000264 <= task_s00000744_output_s00000264))))) OR ((2 <= merge_s00000455_input_s00000290) AND (1 <= process_s00000030__s00000703_input_s00000263) AND (task_s00000720_inputCriterion_s00000257_used + 1 <= merge_s00000456_input_s00000290))) : E ((E (X ((task_s00000760_output_s00000264 <= task_s00000755_output_s00000264))) U E (F ((2 <= task_s00000754_input_s00000263))))) : A (F (E (((1 <= task_s00000757_inputCriterion_s00000257_used) U (3 <= task_s00000753_output_s00000264))))) : A (X (A (G (((alpha <= task_s00000744_input_s00000263) OR (merge_s00000319_input_s00000290 <= task_s00000717_output_s00000264)))))) : NOT(A (X (A (F ((2 <= task_s00000727_input_s00000263)))))) : (NOT(A (F ((2 <= task_s00000722_output_s00000264)))) AND (E (F (((task_s00000763_inputCriterion_s00000257_used <= task_s00000724_input_s00000263) OR (task_s00000746_output_s00000264 <= task_s00000735_inputCriterion_s00000257_used)))) OR E (F ((task_s00000755_input_s00000263 <= 0))))) : E (G (((1 <= merge_s00000456_input_s00000290) OR (task_s00000708_output_s00000264 <= task_s00000732_input_s00000263) OR ((1 <= task_s00000710_output_s00000264) AND (task_s00000723_output_s00000264 <= task_s00000749_inputCriterion_s00000257_used)) OR (callToProcess_s00000348_inputCriterion_s00000257_used <= task_s00000748_output_s00000264)))) : E (G (E (F (((task_s00000737_inputCriterion_s00000257_used <= task_s00000709_input_s00000263) AND (3 <= decision_s00000787_input_s00000263)))))) : ((NOT(E (G ((decision_s00000787_input_s00000263 <= task_s00000711_output_s00000264)))) OR ((merge_s00000320_input_s00000263 <= 1) AND (merge_s00000446_input_s00000447 + 1 <= merge_s00000341_input_s00000285) AND (fork_s00000465_input_s00000263 + 1 <= task_s00000710_output_s00000264) AND (task_s00000750_inputCriterion_s00000257_used <= 1))) AND (E (X ((2 <= task_s00000706_input_s00000263))) OR E (F (((task_s00000747_output_s00000264 <= task_s00000725_inputCriterion_s00000257_used) OR (merge_s00000341_input_s00000285 <= decision_s00000793_input_s00000263)))))) : E ((A (X ((2 <= merge_s00000453_input_s00000290))) U E (G ((task_s00000758_output_s00000264 <= callToProcess_s00000348_inputCriterion_s00000257_used))))) : E (F (A (G ((merge_s00000319_input_s00000263 <= decision_s00000787_input_s00000263))))) : NOT(((((callToProcess_s00000596_inputCriterion_s00000257_used + 1 <= task_s00000748_output_s00000264) AND (task_s00000708_output_s00000264 <= 2)) OR A (F ((1 <= task_s00000758_inputCriterion_s00000257_used)))) AND (decision_s00000764_input_s00000263 <= task_s00000736_output_s00000264))) : A (F (((2 <= task_s00000717_inputCriterion_s00000257_used) AND (task_s00000748_output_s00000264 <= task_s00000709_inputCriterion_s00000257_used) AND ((2 <= task_s00000761_output_s00000264) OR (2 <= task_s00000706_input_s00000263)) AND (task_s00000730_output_s00000264 <= callToProcess_s00000808_output_s00000264) AND (3 <= task_s00000745_inputCriterion_s00000257_used) AND ((3 <= merge_s00000454_activated) OR (2 <= task_s00000761_output_s00000264))))) : E (F (E (G (((1 <= task_s00000712_output_s00000264) OR (merge_s00000319_activated <= fork_s00000464_input_s00000263)))))) : A (F (A (G (((3 <= task_s00000722_output_s00000264) AND (task_s00000755_inputCriterion_s00000257_used <= task_s00000709_output_s00000264)))))) : A (G (A (F ((3 <= task_s00000740_output_s00000264)))))
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 (G (((task_s00000732_input_s00000263 <= merge_s00000462_input_s00000285) OR (callToProcess_s00000596_output_s00000264 <= merge_s00000446_input_s00000263) OR ((2 <= merge_s00000457_activated) AND (task_s00000746_output_s00000264 <= task_s00000744_output_s00000264))))) OR ((2 <= merge_s00000455_input_s00000290) AND (1 <= process_s00000030__s00000703_input_s00000263) AND (task_s00000720_inputCri... (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: E (G (((task_s00000732_input_s00000263 <= merge_s00000462_input_s00000285) OR (callToProcess_s00000596_output_s00000264 <= merge_s00000446_input_s00000263) OR ((2 <= merge_s00000457_activated) AND (task_s00000746_output_s00000264 <= task_s00000744_output_s00000264)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((merge_s00000462_input_s00000285 + 1 <= task_s00000732_input_s00000263) AND (merge_s00000446_input_s00000263 + 1 <= callToProcess_s00000596_output_s00000264) AND ((merge_s00000457_activated <= 1) OR (task_s00000744_output_s00000264 + 1 <= task_s00000746_output_s00000264)))))
lola: processed formula length: 290
lola: 2 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: 6 markings, 5 edges
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: E ((E (X ((task_s00000760_output_s00000264 <= task_s00000755_output_s00000264))) U E (F ((2 <= task_s00000754_input_s00000263)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX((task_s00000760_output_s00000264 <= task_s00000755_output_s00000264)) U E(TRUE U (2 <= task_s00000754_input_s00000263)))
lola: processed formula length: 125
lola: 3 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 8370 markings, 49349 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (((1 <= task_s00000757_inputCriterion_s00000257_used) U (3 <= task_s00000753_output_s00000264)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E((1 <= task_s00000757_inputCriterion_s00000257_used) U (3 <= task_s00000753_output_s00000264)))
lola: processed formula length: 105
lola: 2 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: 6 markings, 11 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (G (((alpha <= task_s00000744_input_s00000263) OR (merge_s00000319_input_s00000290 <= task_s00000717_output_s00000264))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (A (G (((alpha <= task_s00000744_input_s00000263) OR (merge_s00000319_input_s00000290 <= task_s00000717_output_s00000264))))))
lola: processed formula: A (X (A (G (((alpha <= task_s00000744_input_s00000263) OR (merge_s00000319_input_s00000290 <= task_s00000717_output_s00000264))))))
lola: processed formula length: 132
lola: 0 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 8370 markings, 20508 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (A (F ((2 <= task_s00000727_input_s00000263))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (2 <= task_s00000727_input_s00000263))))
lola: processed formula length: 56
lola: 8 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F ((2 <= task_s00000722_output_s00000264)))) AND (E (F (((task_s00000763_inputCriterion_s00000257_used <= task_s00000724_input_s00000263) OR (task_s00000746_output_s00000264 <= task_s00000735_inputCriterion_s00000257_used)))) OR E (F ((task_s00000755_input_s00000263 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((task_s00000722_output_s00000264 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= task_s00000722_output_s00000264)))
lola: processed formula length: 53
lola: 5 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((task_s00000763_inputCriterion_s00000257_used <= task_s00000724_input_s00000263) OR (task_s00000746_output_s00000264 <= task_s00000735_inputCriterion_s00000257_used))))
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 1044 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 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= merge_s00000456_input_s00000290) OR (task_s00000708_output_s00000264 <= task_s00000732_input_s00000263) OR ((1 <= task_s00000710_output_s00000264) AND (task_s00000723_output_s00000264 <= task_s00000749_inputCriterion_s00000257_used)) OR (callToProcess_s00000348_inputCriterion_s00000257_used <= task_s00000748_output_s00000264))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((merge_s00000456_input_s00000290 <= 0) AND (task_s00000732_input_s00000263 + 1 <= task_s00000708_output_s00000264) AND ((task_s00000710_output_s00000264 <= 0) OR (task_s00000749_inputCriterion_s00000257_used + 1 <= task_s00000723_output_s00000264)) AND (task_s00000748_output_s00000264 + 1 <= callToProcess_s00000348_inputCriterion_s00000257_used))))
lola: processed formula length: 365
lola: 2 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((task_s00000737_inputCriterion_s00000257_used <= task_s00000709_input_s00000263) AND (3 <= decision_s00000787_input_s00000263))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((task_s00000737_inputCriterion_s00000257_used <= task_s00000709_input_s00000263) AND (3 <= decision_s00000787_input_s00000263))))))
lola: processed formula length: 158
lola: 2 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: 773 markings, 837 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (G ((decision_s00000787_input_s00000263 <= task_s00000711_output_s00000264)))) OR ((merge_s00000320_input_s00000263 <= 1) AND (merge_s00000446_input_s00000447 + 1 <= merge_s00000341_input_s00000285) AND (fork_s00000465_input_s00000263 + 1 <= task_s00000710_output_s00000264) AND (task_s00000750_inputCriterion_s00000257_used <= 1))) AND (E (X ((2 <= task_s00000706_input_s00000263))) OR E (F ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((task_s00000711_output_s00000264 + 1 <= decision_s00000787_input_s00000263)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((task_s00000711_output_s00000264 + 1 <= decision_s00000787_input_s00000263)))
lola: processed formula: A (F ((task_s00000711_output_s00000264 + 1 <= decision_s00000787_input_s00000263)))
lola: processed formula length: 83
lola: 3 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 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: 96 markings, 96 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((merge_s00000320_input_s00000263 <= 1) AND (merge_s00000446_input_s00000447 + 1 <= merge_s00000341_input_s00000285) AND (fork_s00000465_input_s00000263 + 1 <= task_s00000710_output_s00000264) AND (task_s00000750_inputCriterion_s00000257_used <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((merge_s00000320_input_s00000263 <= 1) AND (merge_s00000446_input_s00000447 + 1 <= merge_s00000341_input_s00000285) AND (fork_s00000465_input_s00000263 + 1 <= task_s00000710_output_s00000264) AND (task_s00000750_inputCriterion_s00000257_used <= 1))
lola: processed formula length: 249
lola: 3 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: processed formula with 4 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (X ((2 <= merge_s00000453_input_s00000290))) U E (G ((task_s00000758_output_s00000264 <= callToProcess_s00000348_inputCriterion_s00000257_used)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(AX((2 <= merge_s00000453_input_s00000290)) U NOT(A(TRUE U (callToProcess_s00000348_inputCriterion_s00000257_used + 1 <= task_s00000758_output_s00000264))))
lola: processed formula length: 157
lola: 4 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((merge_s00000319_input_s00000263 <= decision_s00000787_input_s00000263)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (decision_s00000787_input_s00000263 + 1 <= merge_s00000319_input_s00000263))))
lola: processed formula length: 100
lola: 3 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: 87 markings, 99 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((((callToProcess_s00000596_inputCriterion_s00000257_used + 1 <= task_s00000748_output_s00000264) AND (task_s00000708_output_s00000264 <= 2)) OR A (F ((1 <= task_s00000758_inputCriterion_s00000257_used)))) AND (decision_s00000764_input_s00000263 <= task_s00000736_output_s00000264)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((task_s00000748_output_s00000264 <= callToProcess_s00000596_inputCriterion_s00000257_used) OR (3 <= task_s00000708_output_s00000264))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((task_s00000748_output_s00000264 <= callToProcess_s00000596_inputCriterion_s00000257_used) OR (3 <= task_s00000708_output_s00000264))
lola: processed formula length: 135
lola: 7 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((task_s00000758_inputCriterion_s00000257_used <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= task_s00000758_inputCriterion_s00000257_used)))
lola: processed formula length: 66
lola: 9 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= task_s00000717_inputCriterion_s00000257_used) AND (task_s00000748_output_s00000264 <= task_s00000709_inputCriterion_s00000257_used) AND ((2 <= task_s00000761_output_s00000264) OR (2 <= task_s00000706_input_s00000263)) AND (task_s00000730_output_s00000264 <= callToProcess_s00000808_output_s00000264) AND (3 <= task_s00000745_inputCriterion_s00000257_used) AND ((3 <= merge_s00000454_act... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= task_s00000717_inputCriterion_s00000257_used) AND (task_s00000748_output_s00000264 <= task_s00000709_inputCriterion_s00000257_used) AND ((2 <= task_s00000761_output_s00000264) OR (2 <= task_s00000706_input_s00000263)) AND (task_s00000730_output_s00000264 <= callToProcess_s00000808_output_s00000264) AND (3 <= task_s00000745_inputCriterion_s00000257_used) AND ((3 <= merge_s00000454_activated) OR (2 <= task_s00000761_output_s00000264)))))
lola: processed formula: A (F (((2 <= task_s00000717_inputCriterion_s00000257_used) AND (task_s00000748_output_s00000264 <= task_s00000709_inputCriterion_s00000257_used) AND ((2 <= task_s00000761_output_s00000264) OR (2 <= task_s00000706_input_s00000263)) AND (task_s00000730_output_s00000264 <= callToProcess_s00000808_output_s00000264) AND (3 <= task_s00000745_inputCriterion_s00000257_used) AND ((3 <= merge_s00000454_act... (shortened)
lola: processed formula length: 454
lola: 0 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 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: 96 markings, 96 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((1 <= task_s00000712_output_s00000264) OR (merge_s00000319_activated <= fork_s00000464_input_s00000263))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U ((task_s00000712_output_s00000264 <= 0) AND (fork_s00000464_input_s00000263 + 1 <= merge_s00000319_activated)))))
lola: processed formula length: 135
lola: 3 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((3 <= task_s00000722_output_s00000264) AND (task_s00000755_inputCriterion_s00000257_used <= task_s00000709_output_s00000264))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (((3 <= task_s00000722_output_s00000264) AND (task_s00000755_inputCriterion_s00000257_used <= task_s00000709_output_s00000264))))))
lola: processed formula: A (F (A (G (((3 <= task_s00000722_output_s00000264) AND (task_s00000755_inputCriterion_s00000257_used <= task_s00000709_output_s00000264))))))
lola: processed formula length: 142
lola: 0 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 97 markings, 98 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((3 <= task_s00000740_output_s00000264)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (3 <= task_s00000740_output_s00000264)))))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 262 places; total mentions: 0
lola: closed formula file IBM703-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1044 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: 6 markings, 6 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no yes yes yes yes no no yes yes yes no yes no no
FORMULA IBM703-PT-none-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM703-PT-none-CTLCardinality-15 FALSE 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="IBM703-PT-none"
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/IBM703-PT-none.tgz
mv IBM703-PT-none 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 IBM703-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 r102-smll-152658633000185"
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 ;