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 376K
-rw-r--r-- 1 mcc users 6.4K 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 5.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K 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.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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 171K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is IBM5964-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-smll-152658636800180
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526777178711


BK_STOP 1526777224545

--------------------
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 IBM5964-PT-none as instance name.
Using IBM5964 as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 254, 'Memory': 112.34, 'Tool': 'lola'}, {'Time': 336, 'Memory': 110.73, 'Tool': 'lola'}, {'Time': 810, 'Memory': 102.24, 'Tool': 'gspn'}, {'Time': 2671, 'Memory': 239.3, 'Tool': 'itstools'}, {'Time': 2773, 'Memory': 243.85, 'Tool': 'itstools'}, {'Time': 3581, 'Memory': 161.04, 'Tool': 'gspn'}, {'Time': 6057, 'Memory': 7484.44, 'Tool': 'marcie'}, {'Time': 6613, 'Memory': 7484.97, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola IBM5964-PT-none...

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


checking for too many tokens
===========================================================================================
IBM5964-PT-none: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ IBM5964-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: 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-ReachabilityCardinality.task
lola: A (G ((callToTask_s00005971_output_s00000959 <= callToTask_s00005970_output_s00000981))) : E (F (((callToProcess_s00001273_inputCriterion_s00000937_used <= callToTask_s00005967_input_s00000952) AND (3 <= callToTask_s00005969_input_s00000952)))) : A (G ((((merge_s00001292_input_s00000986 <= 2) OR (callToProcess_s00005925_input_s00000952 + 1 <= callToTask_s00005969_output_s00000938)) AND ((callToTask_s00005968_input_s00000935 <= 1) OR (decision_s00001286_activated <= 1))))) : A (G ((((callToProcess_s00002316_output_s00000959 <= callToTask_s00002183_output_s00000962) OR (1 <= process_s00000383__s00005964_input_s00000936)) AND (callToTask_s00005969_input_s00000952 <= callToTask_s00005849_output_s00000960) AND ((callToTask_s00005970_input_s00000935 <= callToProcess_s00002411_output_s00000956) OR (callToTask_s00002526_output_s00000938 <= callToTask_s00002741_output_s00000960) OR (callToProcess_s00002538_input_s00001011 <= 1))))) : A (G (((callToTask_s00005965_output_s00000956 <= merge_s00001290_input_s00000935) AND ((callToTask_s00002526_output_s00000938 <= fork_s00001067_input_s00000950) OR (merge_s00001120_input_s00000988 <= 0))))) : E (F (FALSE)) : A (G (((1 <= callToTask_s00005849_input_s00000985) OR (3 <= callToTask_s00002427_input_s00001203) OR ((fork_s00001067_activated_s00000991 <= merge_s00001120_input_s00000952) AND (1 <= callToTask_s00005965_output_s00000938)) OR (callToTask_s00002186_input_s00000935 <= callToTask_s00001971_output_s00000938)))) : E (F (((callToTask_s00005970_output_s00000938 + 1 <= callToProcess_s00001273_output_s00000956) AND (callToTask_s00005897_output_s00000956 + 1 <= callToProcess_s00002538_input_s00000952) AND (1 <= callToTask_s00002190_output_s00000956) AND ((callToTask_s00005849_output_s00000938 <= fork_s00001293_input_s00000952) OR (callToTask_s00005849_output_s00000960 <= callToTask_s00002181_inputCriterion_s00000937_used))))) : E (F ((2 <= callToTask_s00005969_input_s00000952))) : A (G ((((callToTask_s00005897_output_s00000956 <= 1) AND (callToTask_s00005970_output_s00000981 + 1 <= callToTask_s00002185_input_s00000952)) OR (callToProcess_s00002411_input_s00000985 <= callToTask_s00001971_input_s00000952)))) : A (G ((((callToTask_s00002427_input_s00001013 <= callToProcess_s00002411_output_s00000956) OR (2 <= callToTask_s00005897_input_s00000986) OR ((3 <= callToProcess_s00002538_output_s00000956) AND (callToTask_s00005897_inputCriterion_s00000937_used <= callToTask_s00005970_input_s00000935))) AND ((callToProcess_s00002411_input_s00000985 + 1 <= callToTask_s00001632_inputCriterion_s00000937_used) OR (callToProcess_s00002538_input_s00000952 <= 2))))) : E (F ((1 <= callToTask_s00002186_input_s00000935))) : E (F ((2 <= merge_s00001291_input_s00000986))) : A (G (((callToTask_s00002526_input_s00000935 <= 1) OR (merge_s00001291_input_s00000952 <= callToTask_s00001632_output_s00000979)))) : A (G ((((3 <= callToTask_s00002186_inputCriterion_s00000937_used) OR (join_s00001295_input_s00000950 <= process_s00000383__s00005964_output_s00001610)) AND ((callToTask_s00002183_output_s00000981 <= callToTask_s00005970_input_s00000950) OR (3 <= callToTask_s00005966_output_s00000938) OR ((2 <= callToTask_s00001971_output_s00000956) AND (1 <= callToTask_s00005849_input_s00000950)))))) : A (G (((callToProcess_s00004075_input_s00000986 <= 0) OR (decision_s00001287_activated + 1 <= process_s00000383__s00005964_output_s00001610) OR ((callToTask_s00005897_inputCriterion_s00000937_used <= 0) AND (callToTask_s00001971_output_s00000981 + 1 <= callToTask_s00005968_input_s00000952)))))
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 ((callToTask_s00005971_output_s00000959 <= callToTask_s00005970_output_s00000981)))
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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((callToProcess_s00001273_inputCriterion_s00000937_used <= callToTask_s00005967_input_s00000952) AND (3 <= callToTask_s00005969_input_s00000952))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((merge_s00001292_input_s00000986 <= 2) OR (callToProcess_s00005925_input_s00000952 + 1 <= callToTask_s00005969_output_s00000938)) AND ((callToTask_s00005968_input_s00000935 <= 1) OR (decision_s00001286_activated <= 1)))))
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 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1928 markings, 3252 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((callToProcess_s00002316_output_s00000959 <= callToTask_s00002183_output_s00000962) OR (1 <= process_s00000383__s00005964_input_s00000936)) AND (callToTask_s00005969_input_s00000952 <= callToTask_s00005849_output_s00000960) AND ((callToTask_s00005970_input_s00000935 <= callToProcess_s00002411_output_s00000956) OR (callToTask_s00002526_output_s00000938 <= callToTask_s00002741_output_s0000... (shortened)
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 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2051 markings, 4124 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((callToTask_s00005965_output_s00000956 <= merge_s00001290_input_s00000935) AND ((callToTask_s00002526_output_s00000938 <= fork_s00001067_input_s00000950) OR (merge_s00001120_input_s00000988 <= 0)))))
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 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2088 markings, 3161 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FALSE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file IBM5964-PT-none-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= callToTask_s00005849_input_s00000985) OR (3 <= callToTask_s00002427_input_s00001203) OR ((fork_s00001067_activated_s00000991 <= merge_s00001120_input_s00000952) AND (1 <= callToTask_s00005965_output_s00000938)) OR (callToTask_s00002186_input_s00000935 <= callToTask_s00001971_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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((callToTask_s00005970_output_s00000938 + 1 <= callToProcess_s00001273_output_s00000956) AND (callToTask_s00005897_output_s00000956 + 1 <= callToProcess_s00002538_input_s00000952) AND (1 <= callToTask_s00002190_output_s00000956) AND ((callToTask_s00005849_output_s00000938 <= fork_s00001293_input_s00000952) OR (callToTask_s00005849_output_s00000960 <= callToTask_s00002181_inputCriterion_s000... (shortened)
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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityCardinality-7.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1162 markings, 1582 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= callToTask_s00005969_input_s00000952)))
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-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((callToTask_s00005897_output_s00000956 <= 1) AND (callToTask_s00005970_output_s00000981 + 1 <= callToTask_s00002185_input_s00000952)) OR (callToProcess_s00002411_input_s00000985 <= callToTask_s00001971_input_s00000952))))
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 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((callToTask_s00002427_input_s00001013 <= callToProcess_s00002411_output_s00000956) OR (2 <= callToTask_s00005897_input_s00000986) OR ((3 <= callToProcess_s00002538_output_s00000956) AND (callToTask_s00005897_inputCriterion_s00000937_used <= callToTask_s00005970_input_s00000935))) AND ((callToProcess_s00002411_input_s00000985 + 1 <= callToTask_s00001632_inputCriterion_s00000937_used) OR ... (shortened)
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 8 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= callToTask_s00002186_input_s00000935)))
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-ReachabilityCardinality-11.sarasara:
try reading problem file IBM5964-PT-none-ReachabilityCardinality-10.sara.
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= merge_s00001291_input_s00000986)))
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-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((callToTask_s00002526_input_s00000935 <= 1) OR (merge_s00001291_input_s00000952 <= callToTask_s00001632_output_s00000979))))
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-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityCardinality-13.sara.

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= callToTask_s00002186_inputCriterion_s00000937_used) OR (join_s00001295_input_s00000950 <= process_s00000383__s00005964_output_s00001610)) AND ((callToTask_s00002183_output_s00000981 <= callToTask_s00005970_input_s00000950) OR (3 <= callToTask_s00005966_output_s00000938) OR ((2 <= callToTask_s00001971_output_s00000956) AND (1 <= callToTask_s00005849_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 8 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((callToProcess_s00004075_input_s00000986 <= 0) OR (decision_s00001287_activated + 1 <= process_s00000383__s00005964_output_s00001610) OR ((callToTask_s00005897_inputCriterion_s00000937_used <= 0) AND (callToTask_s00001971_output_s00000981 + 1 <= callToTask_s00005968_input_s00000952)))))
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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBM5964-PT-none-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file IBM5964-PT-none-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1866 markings, 2534 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes yes no yes no no yes no no no yes yes yes
FORMULA IBM5964-PT-none-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA IBM5964-PT-none-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBM5964-PT-none-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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="IBM5964-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-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/IBM5964-PT-none.tgz
mv IBM5964-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 mcc4mcc-full"
echo " Input is IBM5964-PT-none, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-smll-152658636800180"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;