fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2614.570 646538.00 1210694.00 2161.30 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-full
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 r066-smll-152649737100112
=====================================================================

--------------------
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 1526638666845


BK_STOP 1526639313383

--------------------
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 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...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
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 || 24773 markings, 31683 edges, 4955 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 49730 markings, 65101 edges, 4991 markings/sec, 5 secs
lola: sara is running 10 secs || 74455 markings, 98679 edges, 4945 markings/sec, 10 secs
lola: sara is running 15 secs || 99130 markings, 131513 edges, 4935 markings/sec, 15 secs
lola: sara is running 20 secs || 123576 markings, 166012 edges, 4889 markings/sec, 20 secs
lola: sara is running 25 secs || 147841 markings, 199035 edges, 4853 markings/sec, 25 secs
lola: sara is running 30 secs || 172340 markings, 233892 edges, 4900 markings/sec, 30 secs
lola: sara is running 35 secs || 196656 markings, 268160 edges, 4863 markings/sec, 35 secs
lola: sara is running 40 secs || 220508 markings, 302813 edges, 4770 markings/sec, 40 secs
lola: sara is running 45 secs || 245126 markings, 338100 edges, 4924 markings/sec, 45 secs
lola: sara is running 50 secs || 269764 markings, 372340 edges, 4928 markings/sec, 50 secs
lola: sara is running 55 secs || 294727 markings, 406604 edges, 4993 markings/sec, 55 secs
lola: sara is running 60 secs || 319869 markings, 441355 edges, 5028 markings/sec, 60 secs
lola: sara is running 65 secs || 344596 markings, 475263 edges, 4945 markings/sec, 65 secs
lola: sara is running 70 secs || 369512 markings, 509606 edges, 4983 markings/sec, 70 secs
lola: sara is running 75 secs || 394233 markings, 543089 edges, 4944 markings/sec, 75 secs
lola: sara is running 80 secs || 418539 markings, 569514 edges, 4861 markings/sec, 80 secs
lola: sara is running 85 secs || 443267 markings, 596527 edges, 4946 markings/sec, 85 secs
lola: sara is running 90 secs || 468030 markings, 623746 edges, 4953 markings/sec, 90 secs
lola: sara is running 95 secs || 493110 markings, 651437 edges, 5016 markings/sec, 95 secs
lola: sara is running 100 secs || 518394 markings, 679540 edges, 5057 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 244 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 || 128530 markings, 141268 edges, 25706 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 257912 markings, 284266 edges, 25876 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 || 71349 markings, 76849 edges, 14270 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 137365 markings, 147635 edges, 13203 markings/sec, 5 secs
lola: sara is running 10 secs || 203364 markings, 218404 edges, 13200 markings/sec, 10 secs

lola: sara is running 15 secs || 270214 markings, 290278 edges, 13370 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: state equation: calling and running 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 || 23487 markings, 28885 edges, 4697 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 || 23798 markings, 31023 edges, 4760 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 49212 markings, 63236 edges, 5083 markings/sec, 5 secs
lola: sara is running 10 secs || 74637 markings, 96522 edges, 5085 markings/sec, 10 secs
lola: sara is running 15 secs || 100161 markings, 129678 edges, 5105 markings/sec, 15 secs
lola: sara is running 20 secs || 126007 markings, 163848 edges, 5169 markings/sec, 20 secs
lola: sara is running 25 secs || 152246 markings, 199223 edges, 5248 markings/sec, 25 secs
lola: sara is running 30 secs || 178125 markings, 233270 edges, 5176 markings/sec, 30 secs
lola: sara is running 35 secs || 203659 markings, 266574 edges, 5107 markings/sec, 35 secs
lola: sara is running 40 secs || 229147 markings, 299433 edges, 5098 markings/sec, 40 secs
lola: sara is running 45 secs || 254525 markings, 333682 edges, 5076 markings/sec, 45 secs
lola: sara is running 50 secs || 279331 markings, 365666 edges, 4961 markings/sec, 50 secs
lola: sara is running 55 secs || 304707 markings, 398844 edges, 5075 markings/sec, 55 secs
lola: sara is running 60 secs || 330251 markings, 432449 edges, 5109 markings/sec, 60 secs
lola: sara is running 65 secs || 356093 markings, 467010 edges, 5168 markings/sec, 65 secs
lola: sara is running 70 secs || 381694 markings, 502403 edges, 5120 markings/sec, 70 secs
lola: sara is running 75 secs || 406883 markings, 536035 edges, 5038 markings/sec, 75 secs
lola: sara is running 80 secs || 432143 markings, 569252 edges, 5052 markings/sec, 80 secs
lola: sara is running 85 secs || 457650 markings, 603406 edges, 5101 markings/sec, 85 secs
lola: sara is running 90 secs || 483194 markings, 639024 edges, 5109 markings/sec, 90 secs
lola: sara is running 95 secs || 508282 markings, 671879 edges, 5018 markings/sec, 95 secs
lola: sara is running 100 secs || 533215 markings, 704680 edges, 4987 markings/sec, 100 secs
lola: sara is running 105 secs || 558126 markings, 736493 edges, 4982 markings/sec, 105 secs
lola: sara is running 110 secs || 583312 markings, 770498 edges, 5037 markings/sec, 110 secs
lola: sara is running 115 secs || 608334 markings, 804454 edges, 5004 markings/sec, 115 secs
lola: sara is running 120 secs || 632659 markings, 835620 edges, 4865 markings/sec, 120 secs
lola: sara is running 125 secs || 657281 markings, 869952 edges, 4924 markings/sec, 125 secs
lola: sara is running 130 secs || 681686 markings, 901683 edges, 4881 markings/sec, 130 secs
lola: sara is running 135 secs || 706143 markings, 933554 edges, 4891 markings/sec, 135 secs
lola: sara is running 140 secs || 730377 markings, 965291 edges, 4847 markings/sec, 140 secs
lola: sara is running 145 secs || 754520 markings, 997849 edges, 4829 markings/sec, 145 secs
lola: sara is running 150 secs || 778571 markings, 1029234 edges, 4810 markings/sec, 150 secs
lola: sara is running 155 secs || 802595 markings, 1060645 edges, 4805 markings/sec, 155 secs
lola: sara is running 160 secs || 827113 markings, 1092298 edges, 4904 markings/sec, 160 secs
lola: sara is running 165 secs || 851576 markings, 1123471 edges, 4893 markings/sec, 165 secs
lola: sara is running 170 secs || 875992 markings, 1155639 edges, 4883 markings/sec, 170 secs
lola: sara is running 175 secs || 900529 markings, 1187558 edges, 4907 markings/sec, 175 secs
lola: sara is running 180 secs || 924951 markings, 1219526 edges, 4884 markings/sec, 180 secs
lola: sara is running 185 secs || 949400 markings, 1251760 edges, 4890 markings/sec, 185 secs
lola: sara is running 190 secs || 974096 markings, 1285248 edges, 4939 markings/sec, 190 secs
lola: sara is running 195 secs || 998689 markings, 1318655 edges, 4919 markings/sec, 195 secs
lola: sara is running 200 secs || 1023089 markings, 1350877 edges, 4880 markings/sec, 200 secs
lola: sara is running 205 secs || 1047766 markings, 1383566 edges, 4935 markings/sec, 205 secs
lola: sara is running 210 secs || 1072356 markings, 1415522 edges, 4918 markings/sec, 210 secs
lola: sara is running 215 secs || 1097287 markings, 1450189 edges, 4986 markings/sec, 215 secs
lola: sara is running 220 secs || 1121963 markings, 1484616 edges, 4935 markings/sec, 220 secs
lola: sara is running 225 secs || 1146955 markings, 1518981 edges, 4998 markings/sec, 225 secs
lola: sara is running 230 secs || 1172078 markings, 1553234 edges, 5025 markings/sec, 230 secs
lola: sara is running 235 secs || 1196818 markings, 1586159 edges, 4948 markings/sec, 235 secs
lola: sara is running 240 secs || 1221979 markings, 1620487 edges, 5032 markings/sec, 240 secs
lola: sara is running 245 secs || 1247709 markings, 1656468 edges, 5146 markings/sec, 245 secs
lola: sara is running 250 secs || 1272809 markings, 1689415 edges, 5020 markings/sec, 250 secs
lola: sara is running 255 secs || 1297760 markings, 1723079 edges, 4990 markings/sec, 255 secs
lola: sara is running 260 secs || 1323092 markings, 1758101 edges, 5066 markings/sec, 260 secs
lola: sara is running 265 secs || 1347927 markings, 1792030 edges, 4967 markings/sec, 265 secs
lola: sara is running 270 secs || 1372614 markings, 1824518 edges, 4937 markings/sec, 270 secs
lola: sara is running 275 secs || 1397640 markings, 1856873 edges, 5005 markings/sec, 275 secs
lola: sara is running 280 secs || 1422271 markings, 1890450 edges, 4926 markings/sec, 280 secs
lola: sara is running 285 secs || 1446834 markings, 1922480 edges, 4913 markings/sec, 285 secs
lola: sara is running 290 secs || 1471485 markings, 1956434 edges, 4930 markings/sec, 290 secs
lola: sara is running 295 secs || 1496592 markings, 1988876 edges, 5021 markings/sec, 295 secs
lola: sara is running 300 secs || 1521916 markings, 2022892 edges, 5065 markings/sec, 300 secs
lola: sara is running 305 secs || 1547357 markings, 2057152 edges, 5088 markings/sec, 305 secs
lola: sara is running 310 secs || 1572111 markings, 2089310 edges, 4951 markings/sec, 310 secs
lola: sara is running 315 secs || 1596674 markings, 2121664 edges, 4913 markings/sec, 315 secs
lola: sara is running 320 secs || 1622033 markings, 2154990 edges, 5072 markings/sec, 320 secs
lola: sara is running 325 secs || 1646981 markings, 2188086 edges, 4990 markings/sec, 325 secs
lola: sara is running 330 secs || 1671854 markings, 2220731 edges, 4975 markings/sec, 330 secs
lola: sara is running 335 secs || 1696937 markings, 2253346 edges, 5017 markings/sec, 335 secs
lola: sara is running 340 secs || 1722368 markings, 2287120 edges, 5086 markings/sec, 340 secs
lola: sara is running 345 secs || 1747703 markings, 2320852 edges, 5067 markings/sec, 345 secs
lola: sara is running 350 secs || 1773219 markings, 2354864 edges, 5103 markings/sec, 350 secs
lola: sara is running 355 secs || 1799528 markings, 2391956 edges, 5262 markings/sec, 355 secs
lola: sara is running 360 secs || 1825077 markings, 2425191 edges, 5110 markings/sec, 360 secs
lola: sara is running 365 secs || 1850380 markings, 2459392 edges, 5061 markings/sec, 365 secs
lola: sara is running 370 secs || 1876065 markings, 2495329 edges, 5137 markings/sec, 370 secs
lola: sara is running 375 secs || 1901078 markings, 2529179 edges, 5003 markings/sec, 375 secs
lola: sara is running 380 secs || 1925782 markings, 2561998 edges, 4941 markings/sec, 380 secs
lola: sara is running 385 secs || 1950786 markings, 2594361 edges, 5001 markings/sec, 385 secs
lola: sara is running 390 secs || 1975333 markings, 2627620 edges, 4909 markings/sec, 390 secs
lola: sara is running 395 secs || 1999711 markings, 2659452 edges, 4876 markings/sec, 395 secs
lola: sara is running 400 secs || 2024093 markings, 2692080 edges, 4876 markings/sec, 400 secs
lola: sara is running 405 secs || 2048776 markings, 2724170 edges, 4937 markings/sec, 405 secs
lola: sara is running 410 secs || 2073625 markings, 2756967 edges, 4970 markings/sec, 410 secs
lola: sara is running 415 secs || 2098337 markings, 2788905 edges, 4942 markings/sec, 415 secs
lola: sara is running 420 secs || 2123474 markings, 2822771 edges, 5027 markings/sec, 420 secs
lola: sara is running 425 secs || 2148647 markings, 2856370 edges, 5035 markings/sec, 425 secs
lola: sara is running 430 secs || 2173820 markings, 2889180 edges, 5035 markings/sec, 430 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 590 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 737 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 983 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 1475 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 || 23509 markings, 29522 edges, 4702 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 46908 markings, 60656 edges, 4680 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 2938 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: state equation: calling and running sara
sara: try reading problem file 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 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="DLCround-PT-10b"
export BK_EXAMINATION="ReachabilityFireability"
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/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-full"
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 r066-smll-152649737100112"
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 ;