fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r067-smll-152649739600112
Last Updated
June 26, 2018

About the Execution of Irma.struct for DLCround-PT-10b

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2609.630 658407.00 1233556.00 2772.60 FTFFFTFTFTFFTTTF normal

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 1.7M
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.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 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 3.0K 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 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.5M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is DLCround-PT-10b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r067-smll-152649739600112
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-00
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-01
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-02
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-03
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-04
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-05
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-06
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-07
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-08
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-09
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-10
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-11
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-12
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-13
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-14
FORMULA_NAME DLCround-PT-10b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1526638511844


BK_STOP 1526639170251

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DLCround-PT-10b as instance name.
Using DLCround as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 201911, 'Memory': 1527.72, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola DLCround-PT-10b...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
DLCround-PT-10b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ DLCround-PT-10b @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 10116/65536 symbol table entries, 2628 collisions
lola: preprocessing...
lola: finding significant places
lola: 3924 places, 6192 transitions, 3711 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 8844 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-10b-ReachabilityFireability.task
lola: A (G (((FIREABLE(t1722) OR FIREABLE(t5039) OR NOT FIREABLE(t83)) AND (NOT FIREABLE(t5162) OR NOT FIREABLE(t2664)) AND NOT FIREABLE(t982)))) : E (F ((FIREABLE(t1915) AND (NOT FIREABLE(t5095) OR NOT FIREABLE(t4112)) AND ((FIREABLE(t1963) AND FIREABLE(t4506)) OR (FIREABLE(t1667) AND FIREABLE(t2524)) OR FIREABLE(t2093))))) : E (F ((FIREABLE(t5352) AND FIREABLE(t3433) AND FIREABLE(t3698)))) : A (G ((FIREABLE(t4496) OR FIREABLE(t1208) OR (FIREABLE(t4586) AND FIREABLE(t2184)) OR (NOT FIREABLE(t5864) AND NOT FIREABLE(t6149)) OR (NOT FIREABLE(t5261) AND NOT FIREABLE(t5202)) OR NOT FIREABLE(t2129)))) : A (G ((FIREABLE(t3982) OR FIREABLE(t3265) OR NOT FIREABLE(t3814) OR (FIREABLE(t4703) AND FIREABLE(t4654)) OR (FIREABLE(t3349) AND FIREABLE(t5704)) OR FIREABLE(t302)))) : E (F ((FIREABLE(t6108) OR (FIREABLE(t5429) AND (FIREABLE(t31) OR FIREABLE(t3251))) OR (NOT FIREABLE(t5986) AND (FIREABLE(t5584) OR FIREABLE(t4477)) AND (FIREABLE(t3393) OR FIREABLE(t1061) OR (FIREABLE(t1141) AND FIREABLE(t2087))))))) : A (G ((NOT FIREABLE(t5330) AND (NOT FIREABLE(t1259) OR (NOT FIREABLE(t1874) AND NOT FIREABLE(t451)))))) : E (F ((((FIREABLE(t1724) OR FIREABLE(t4661) OR FIREABLE(t2539)) AND NOT FIREABLE(t597)) OR ((FIREABLE(t1230) OR FIREABLE(t737) OR (FIREABLE(t1545) AND FIREABLE(t2867))) AND (FIREABLE(t4179) OR NOT FIREABLE(t3752)))))) : A (G (NOT FIREABLE(t1248))) : E (F ((FIREABLE(t2660) OR FIREABLE(t1715) OR (FIREABLE(t2261) AND NOT FIREABLE(t5844))))) : A (G ((NOT FIREABLE(t3453) OR ((FIREABLE(t5962) OR FIREABLE(t5396)) AND (FIREABLE(t4447) OR FIREABLE(t4043)) AND NOT FIREABLE(t887))))) : A (G (NOT FIREABLE(t3064))) : E (F (FIREABLE(t5086))) : E (F ((FIREABLE(t604) AND (NOT FIREABLE(t176) OR NOT FIREABLE(t971) OR NOT FIREABLE(t3497))))) : E (F ((NOT FIREABLE(t5858) AND NOT FIREABLE(t2158) AND FIREABLE(t3731) AND FIREABLE(t327) AND FIREABLE(t3580)))) : A (G (((NOT FIREABLE(t5945) AND NOT FIREABLE(t4286)) OR (NOT FIREABLE(t2362) AND NOT FIREABLE(t5418)) OR (FIREABLE(t2704) AND FIREABLE(t386) AND (FIREABLE(t5471) OR FIREABLE(t1826)) AND FIREABLE(t4908)))))
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 (((FIREABLE(t1722) OR FIREABLE(t5039) OR NOT FIREABLE(t83)) AND (NOT FIREABLE(t5162) OR NOT FIREABLE(t2664)) AND NOT FIREABLE(t982))))
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 464 bytes per marking, with 1 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 10 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1915) AND (NOT FIREABLE(t5095) OR NOT FIREABLE(t4112)) AND ((FIREABLE(t1963) AND FIREABLE(t4506)) OR (FIREABLE(t1667) AND FIREABLE(t2524)) OR FIREABLE(t2093)))))
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 464 bytes per marking, with 1 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 48 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability.sara.
lola: sara is running 0 secs || 23720 markings, 30423 edges, 4744 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 48518 markings, 63301 edges, 4960 markings/sec, 5 secs
lola: sara is running 10 secs || 73096 markings, 96745 edges, 4916 markings/sec, 10 secs
lola: sara is running 15 secs || 97705 markings, 129617 edges, 4922 markings/sec, 15 secs
lola: sara is running 20 secs || 122094 markings, 164025 edges, 4878 markings/sec, 20 secs
lola: sara is running 25 secs || 146340 markings, 196894 edges, 4849 markings/sec, 25 secs
lola: sara is running 30 secs || 170834 markings, 231698 edges, 4899 markings/sec, 30 secs
lola: sara is running 35 secs || 195657 markings, 266517 edges, 4965 markings/sec, 35 secs
lola: sara is running 40 secs || 220095 markings, 302277 edges, 4888 markings/sec, 40 secs
lola: sara is running 45 secs || 245377 markings, 338402 edges, 5056 markings/sec, 45 secs
lola: sara is running 50 secs || 270634 markings, 373792 edges, 5051 markings/sec, 50 secs
lola: sara is running 55 secs || 296291 markings, 408736 edges, 5131 markings/sec, 55 secs
lola: sara is running 60 secs || 321882 markings, 444106 edges, 5118 markings/sec, 60 secs
lola: sara is running 65 secs || 347146 markings, 478742 edges, 5053 markings/sec, 65 secs
lola: sara is running 70 secs || 372635 markings, 513976 edges, 5098 markings/sec, 70 secs
lola: sara is running 75 secs || 397992 markings, 547150 edges, 5071 markings/sec, 75 secs
lola: sara is running 80 secs || 423018 markings, 574378 edges, 5005 markings/sec, 80 secs
lola: sara is running 85 secs || 448249 markings, 602039 edges, 5046 markings/sec, 85 secs
lola: sara is running 90 secs || 472983 markings, 629200 edges, 4947 markings/sec, 90 secs
lola: sara is running 95 secs || 498275 markings, 657237 edges, 5058 markings/sec, 95 secs
lola: sara is running 100 secs || 523383 markings, 685016 edges, 5022 markings/sec, 100 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 543682 markings, 707535 edges
lola: ========================================
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t5352) AND FIREABLE(t3433) AND FIREABLE(t3698))))
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 464 bytes per marking, with 1 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 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-2.sara.
lola: sara is running 0 secs || 130010 markings, 142901 edges, 26002 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 262149 markings, 288942 edges, 26428 markings/sec, 5 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t4496) OR FIREABLE(t1208) OR (FIREABLE(t4586) AND FIREABLE(t2184)) OR (NOT FIREABLE(t5864) AND NOT FIREABLE(t6149)) OR (NOT FIREABLE(t5261) AND NOT FIREABLE(t5202)) OR NOT FIREABLE(t2129))))
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 464 bytes per marking, with 1 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 192 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-3.sara.
lola: sara is running 0 secs || 67312 markings, 72530 edges, 13462 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 128987 markings, 138663 edges, 12335 markings/sec, 5 secs
lola: sara is running 10 secs || 190609 markings, 204763 edges, 12324 markings/sec, 10 secs

lola: sara is running 15 secs || 252227 markings, 270742 edges, 12324 markings/sec, 15 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t3982) OR FIREABLE(t3265) OR NOT FIREABLE(t3814) OR (FIREABLE(t4703) AND FIREABLE(t4654)) OR (FIREABLE(t3349) AND FIREABLE(t5704)) OR FIREABLE(t302))))
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 464 bytes per marking, with 1 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 168 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 54 markings, 53 edges
lola: ========================================
lola: subprocess 5 will run for 308 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t6108) OR (FIREABLE(t5429) AND (FIREABLE(t31) OR FIREABLE(t3251))) OR (NOT FIREABLE(t5986) AND (FIREABLE(t5584) OR FIREABLE(t4477)) AND (FIREABLE(t3393) OR FIREABLE(t1061) OR (FIREABLE(t1141) AND FIREABLE(t2087)))))))
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 464 bytes per marking, with 1 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 60 literals and 15 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 108 markings, 107 edges
lola: ========================================
lola: subprocess 6 will run for 339 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t5330) AND (NOT FIREABLE(t1259) OR (NOT FIREABLE(t1874) AND NOT FIREABLE(t451))))))
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 464 bytes per marking, with 1 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 DLCround-PT-10b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-6.sara.
lola: sara is running 0 secs || 23931 markings, 29468 edges, 4786 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 43266 markings, 53598 edges
lola: ========================================
lola: subprocess 7 will run for 376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t1724) OR FIREABLE(t4661) OR FIREABLE(t2539)) AND NOT FIREABLE(t597)) OR ((FIREABLE(t1230) OR FIREABLE(t737) OR (FIREABLE(t1545) AND FIREABLE(t2867))) AND (FIREABLE(t4179) OR NOT FIREABLE(t3752))))))
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 464 bytes per marking, with 1 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 24 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1948 markings, 2178 edges
lola: ========================================
lola: subprocess 8 will run for 423 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t1248)))
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 464 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2376 markings, 2691 edges
lola: ========================================
lola: subprocess 9 will run for 483 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2660) OR FIREABLE(t1715) OR (FIREABLE(t2261) AND NOT FIREABLE(t5844)))))
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 464 bytes per marking, with 1 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 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 53 markings, 52 edges
lola: ========================================
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t3453) OR ((FIREABLE(t5962) OR FIREABLE(t5396)) AND (FIREABLE(t4447) OR FIREABLE(t4043)) AND NOT FIREABLE(t887)))))
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 464 bytes per marking, with 1 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 26 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-10.sara.
lola: sara is running 0 secs || 24483 markings, 31879 edges, 4897 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 49010 markings, 62971 edges, 4905 markings/sec, 5 secs
lola: sara is running 10 secs || 73553 markings, 95047 edges, 4909 markings/sec, 10 secs
lola: sara is running 15 secs || 98264 markings, 127317 edges, 4942 markings/sec, 15 secs
lola: sara is running 20 secs || 122786 markings, 159710 edges, 4904 markings/sec, 20 secs
lola: sara is running 25 secs || 147357 markings, 192757 edges, 4914 markings/sec, 25 secs
lola: sara is running 30 secs || 171756 markings, 224941 edges, 4880 markings/sec, 30 secs
lola: sara is running 35 secs || 195735 markings, 256325 edges, 4796 markings/sec, 35 secs
lola: sara is running 40 secs || 219810 markings, 287375 edges, 4815 markings/sec, 40 secs
lola: sara is running 45 secs || 243684 markings, 318515 edges, 4775 markings/sec, 45 secs
lola: sara is running 50 secs || 267619 markings, 350622 edges, 4787 markings/sec, 50 secs
lola: sara is running 55 secs || 291571 markings, 381480 edges, 4790 markings/sec, 55 secs
lola: sara is running 60 secs || 315517 markings, 413401 edges, 4789 markings/sec, 60 secs
lola: sara is running 65 secs || 339566 markings, 445484 edges, 4810 markings/sec, 65 secs
lola: sara is running 70 secs || 363713 markings, 477507 edges, 4829 markings/sec, 70 secs
lola: sara is running 75 secs || 387423 markings, 510444 edges, 4742 markings/sec, 75 secs
lola: sara is running 80 secs || 410897 markings, 541982 edges, 4695 markings/sec, 80 secs
lola: sara is running 85 secs || 434505 markings, 572266 edges, 4722 markings/sec, 85 secs
lola: sara is running 90 secs || 458323 markings, 604251 edges, 4764 markings/sec, 90 secs
lola: sara is running 95 secs || 482209 markings, 637662 edges, 4777 markings/sec, 95 secs
lola: sara is running 100 secs || 505788 markings, 668762 edges, 4716 markings/sec, 100 secs
lola: sara is running 105 secs || 529929 markings, 700503 edges, 4828 markings/sec, 105 secs
lola: sara is running 110 secs || 554211 markings, 731383 edges, 4856 markings/sec, 110 secs
lola: sara is running 115 secs || 578709 markings, 764121 edges, 4900 markings/sec, 115 secs
lola: sara is running 120 secs || 603011 markings, 796819 edges, 4860 markings/sec, 120 secs
lola: sara is running 125 secs || 627384 markings, 828915 edges, 4875 markings/sec, 125 secs
lola: sara is running 130 secs || 651832 markings, 862858 edges, 4890 markings/sec, 130 secs
lola: sara is running 135 secs || 675362 markings, 893330 edges, 4706 markings/sec, 135 secs
lola: sara is running 140 secs || 698880 markings, 923981 edges, 4704 markings/sec, 140 secs
lola: sara is running 145 secs || 722386 markings, 954854 edges, 4701 markings/sec, 145 secs
lola: sara is running 150 secs || 745938 markings, 985697 edges, 4710 markings/sec, 150 secs
lola: sara is running 155 secs || 769446 markings, 1017523 edges, 4702 markings/sec, 155 secs
lola: sara is running 160 secs || 792918 markings, 1047884 edges, 4694 markings/sec, 160 secs
lola: sara is running 165 secs || 816617 markings, 1078717 edges, 4740 markings/sec, 165 secs
lola: sara is running 170 secs || 840466 markings, 1109170 edges, 4770 markings/sec, 170 secs
lola: sara is running 175 secs || 864343 markings, 1140170 edges, 4775 markings/sec, 175 secs
lola: sara is running 180 secs || 888276 markings, 1171871 edges, 4787 markings/sec, 180 secs
lola: sara is running 185 secs || 912177 markings, 1202675 edges, 4780 markings/sec, 185 secs
lola: sara is running 190 secs || 936026 markings, 1234063 edges, 4770 markings/sec, 190 secs
lola: sara is running 195 secs || 959896 markings, 1265699 edges, 4774 markings/sec, 195 secs
lola: sara is running 200 secs || 984810 markings, 1300263 edges, 4983 markings/sec, 200 secs
lola: sara is running 205 secs || 1009174 markings, 1332252 edges, 4873 markings/sec, 205 secs
lola: sara is running 210 secs || 1033772 markings, 1364876 edges, 4920 markings/sec, 210 secs
lola: sara is running 215 secs || 1058389 markings, 1397409 edges, 4923 markings/sec, 215 secs
lola: sara is running 220 secs || 1082981 markings, 1430011 edges, 4918 markings/sec, 220 secs
lola: sara is running 225 secs || 1107931 markings, 1464946 edges, 4990 markings/sec, 225 secs
lola: sara is running 230 secs || 1132588 markings, 1498588 edges, 4931 markings/sec, 230 secs
lola: sara is running 235 secs || 1157831 markings, 1534452 edges, 5049 markings/sec, 235 secs
lola: sara is running 240 secs || 1182722 markings, 1567047 edges, 4978 markings/sec, 240 secs
lola: sara is running 245 secs || 1207457 markings, 1600536 edges, 4947 markings/sec, 245 secs
lola: sara is running 250 secs || 1232977 markings, 1636070 edges, 5104 markings/sec, 250 secs
lola: sara is running 255 secs || 1258414 markings, 1670236 edges, 5087 markings/sec, 255 secs
lola: sara is running 260 secs || 1283432 markings, 1703893 edges, 5004 markings/sec, 260 secs
lola: sara is running 265 secs || 1308528 markings, 1738286 edges, 5019 markings/sec, 265 secs
lola: sara is running 270 secs || 1333371 markings, 1771939 edges, 4969 markings/sec, 270 secs
lola: sara is running 275 secs || 1357429 markings, 1804389 edges, 4812 markings/sec, 275 secs
lola: sara is running 280 secs || 1382002 markings, 1836611 edges, 4915 markings/sec, 280 secs
lola: sara is running 285 secs || 1406593 markings, 1868375 edges, 4918 markings/sec, 285 secs
lola: sara is running 290 secs || 1430787 markings, 1901208 edges, 4839 markings/sec, 290 secs
lola: sara is running 295 secs || 1455020 markings, 1933275 edges, 4847 markings/sec, 295 secs
lola: sara is running 300 secs || 1479357 markings, 1966535 edges, 4867 markings/sec, 300 secs
lola: sara is running 305 secs || 1504277 markings, 1999231 edges, 4984 markings/sec, 305 secs
lola: sara is running 310 secs || 1529241 markings, 2033451 edges, 4993 markings/sec, 310 secs
lola: sara is running 315 secs || 1554264 markings, 2066339 edges, 5005 markings/sec, 315 secs
lola: sara is running 320 secs || 1578498 markings, 2097684 edges, 4847 markings/sec, 320 secs
lola: sara is running 325 secs || 1602558 markings, 2129306 edges, 4812 markings/sec, 325 secs
lola: sara is running 330 secs || 1627189 markings, 2162024 edges, 4926 markings/sec, 330 secs
lola: sara is running 335 secs || 1651602 markings, 2194128 edges, 4883 markings/sec, 335 secs
lola: sara is running 340 secs || 1675759 markings, 2226004 edges, 4831 markings/sec, 340 secs
lola: sara is running 345 secs || 1700469 markings, 2257842 edges, 4942 markings/sec, 345 secs
lola: sara is running 350 secs || 1725432 markings, 2291289 edges, 4993 markings/sec, 350 secs
lola: sara is running 355 secs || 1750289 markings, 2324184 edges, 4971 markings/sec, 355 secs
lola: sara is running 360 secs || 1775405 markings, 2357944 edges, 5023 markings/sec, 360 secs
lola: sara is running 365 secs || 1801101 markings, 2394188 edges, 5139 markings/sec, 365 secs
lola: sara is running 370 secs || 1826184 markings, 2426779 edges, 5017 markings/sec, 370 secs
lola: sara is running 375 secs || 1850989 markings, 2460224 edges, 4961 markings/sec, 375 secs
lola: sara is running 380 secs || 1876038 markings, 2495292 edges, 5010 markings/sec, 380 secs
lola: sara is running 385 secs || 1900561 markings, 2528540 edges, 4905 markings/sec, 385 secs
lola: sara is running 390 secs || 1924726 markings, 2560583 edges, 4833 markings/sec, 390 secs
lola: sara is running 395 secs || 1949218 markings, 2592425 edges, 4898 markings/sec, 395 secs
lola: sara is running 400 secs || 1973456 markings, 2624862 edges, 4848 markings/sec, 400 secs
lola: sara is running 405 secs || 1997430 markings, 2656566 edges, 4795 markings/sec, 405 secs
lola: sara is running 410 secs || 2021334 markings, 2688369 edges, 4781 markings/sec, 410 secs
lola: sara is running 415 secs || 2045393 markings, 2719774 edges, 4812 markings/sec, 415 secs
lola: sara is running 420 secs || 2069909 markings, 2751970 edges, 4903 markings/sec, 420 secs
lola: sara is running 425 secs || 2094059 markings, 2783559 edges, 4830 markings/sec, 425 secs
lola: sara is running 430 secs || 2118779 markings, 2816381 edges, 4944 markings/sec, 430 secs
lola: sara is running 435 secs || 2143462 markings, 2849413 edges, 4937 markings/sec, 435 secs
lola: sara is running 440 secs || 2168214 markings, 2882188 edges, 4950 markings/sec, 440 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2183449 markings, 2901320 edges
lola: ========================================
lola: subprocess 11 will run for 587 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t3064)))
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 464 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 385 markings, 384 edges
lola: ========================================
lola: subprocess 12 will run for 734 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t5086)))
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 464 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 236 markings, 235 edges
lola: ========================================
lola: subprocess 13 will run for 979 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t604) AND (NOT FIREABLE(t176) OR NOT FIREABLE(t971) OR NOT FIREABLE(t3497)))))
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 464 bytes per marking, with 1 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 DLCround-PT-10b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 65 markings, 64 edges
lola: ========================================
lola: subprocess 14 will run for 1469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t5858) AND NOT FIREABLE(t2158) AND FIREABLE(t3731) AND FIREABLE(t327) AND FIREABLE(t3580))))
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 464 bytes per marking, with 1 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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-10b-ReachabilityFireability-14.sara.
lola: sara is running 0 secs || 23336 markings, 29328 edges, 4667 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 47279 markings, 61189 edges, 4789 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 52967 markings, 68693 edges
lola: ========================================
lola: subprocess 15 will run for 2927 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t5945) AND NOT FIREABLE(t4286)) OR (NOT FIREABLE(t2362) AND NOT FIREABLE(t5418)) OR (FIREABLE(t2704) AND FIREABLE(t386) AND (FIREABLE(t5471) OR FIREABLE(t1826)) AND FIREABLE(t4908)))))
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 464 bytes per marking, with 1 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 116 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-10b-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 170 markings, 169 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no yes no yes no yes no no yes yes yes no
FORMULA DLCround-PT-10b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-10b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCround-PT-10b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-10b.tgz
mv DLCround-PT-10b 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-structural"
echo " Input is DLCround-PT-10b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r067-smll-152649739600112"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;