About the Execution of M4M.struct for SwimmingPool-PT-09
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15901.020 | 332745.00 | 334709.00 | 1887.50 | ???????????????? | 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 168K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K 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.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.5K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.9K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is SwimmingPool-PT-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732267100665
=====================================================================
--------------------
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 SwimmingPool-PT-09-LTLCardinality-00
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-01
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-02
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-03
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-04
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-05
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-06
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-07
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-08
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-09
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-10
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-11
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-12
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-13
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-14
FORMULA_NAME SwimmingPool-PT-09-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527513102027
BK_STOP 1527513434772
--------------------
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 SwimmingPool-PT-09 as instance name.
Using SwimmingPool as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 709005, 'Memory': 15940.92, 'Tool': 'lola'}, {'Time': 709566, 'Memory': 15722.92, 'Tool': 'lola'}, {'Time': 3512783, 'Memory': 5537.69, 'Tool': 'itstools'}, {'Time': 3512853, 'Memory': 5543.51, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola SwimmingPool-PT-09...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
SwimmingPool-PT-09: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
SwimmingPool-PT-09: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ SwimmingPool-PT-09 @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- 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: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-09-LTLCardinality.task
lola: A (X (G (X (X ((Dress <= Entered)))))) : A (G (G (G (F ((Cabins <= Dress)))))) : A (X ((Dressed <= InBath))) : A ((Out <= Bags)) : A (G (X (G (X ((2 <= Cabins)))))) : A (X (F (F ((2 <= Entered))))) : A ((F ((1 <= WaitBag)) U G (X ((2 <= Dress))))) : A (((2 <= Cabins) U F ((Dress <= Out)))) : A (X ((Entered <= Cabins))) : A (F (X (((1 <= Undress) U (3 <= Entered))))) : A (F (((Dress <= WaitBag) U X ((1 <= Undress))))) : A (F (F (F ((Undress <= Cabins))))) : A ((2 <= Out)) : A (G (F ((Bags <= Out)))) : A (G ((InBath <= Entered))) : A (X ((Undress <= WaitBag)))
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 (X (G (X (X ((Dress <= Entered))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X (X ((Dress <= Entered))))))
lola: processed formula: A (X (G (X (X ((Dress <= Entered))))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6356 markings, 8766 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G (F ((Cabins <= Dress))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (G (F ((Cabins <= Dress))))))
lola: processed formula: A (G (G (G (F ((Cabins <= Dress))))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1371 markings, 1371 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((Dressed <= InBath)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((Dressed <= InBath)))
lola: processed formula: A (X ((Dressed <= InBath)))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((Out <= Bags))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Out <= Bags)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G (X ((2 <= Cabins))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G (X ((2 <= Cabins))))))
lola: processed formula: A (G (X (G (X ((2 <= Cabins))))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 633 markings, 633 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F ((2 <= Entered)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((2 <= Entered))))
lola: processed formula: A (X (F ((2 <= Entered))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 459 markings, 459 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((1 <= WaitBag)) U G (X ((2 <= Dress)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((1 <= WaitBag)) U G (X ((2 <= Dress)))))
lola: processed formula: A ((F ((1 <= WaitBag)) U G (X ((2 <= Dress)))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2310385 markings, 6281843 edges, 462077 markings/sec, 0 secs
lola: 4375839 markings, 12035915 edges, 413091 markings/sec, 5 secs
lola: 6329045 markings, 17518773 edges, 390641 markings/sec, 10 secs
lola: 8201401 markings, 22810762 edges, 374471 markings/sec, 15 secs
lola: 10169151 markings, 28351149 edges, 393550 markings/sec, 20 secs
lola: 12067749 markings, 33727871 edges, 379720 markings/sec, 25 secs
lola: 13905569 markings, 38977242 edges, 367564 markings/sec, 30 secs
lola: 15767851 markings, 44242123 edges, 372456 markings/sec, 35 secs
lola: 17555139 markings, 49351354 edges, 357458 markings/sec, 40 secs
lola: 19410816 markings, 54603922 edges, 371135 markings/sec, 45 secs
lola: 21126083 markings, 59492906 edges, 343053 markings/sec, 50 secs
lola: 22891549 markings, 64532738 edges, 353093 markings/sec, 55 secs
lola: 24617690 markings, 69460818 edges, 345228 markings/sec, 60 secs
lola: 26347425 markings, 74400977 edges, 345947 markings/sec, 65 secs
lola: 28079769 markings, 79356064 edges, 346469 markings/sec, 70 secs
lola: 29659342 markings, 83921863 edges, 315915 markings/sec, 75 secs
lola: 31372410 markings, 88807289 edges, 342614 markings/sec, 80 secs
lola: 33125445 markings, 93810148 edges, 350607 markings/sec, 85 secs
lola: 34886698 markings, 98842268 edges, 352251 markings/sec, 90 secs
lola: 36590703 markings, 103786189 edges, 340801 markings/sec, 95 secs
lola: 38322872 markings, 108720131 edges, 346434 markings/sec, 100 secs
lola: 40043490 markings, 113631957 edges, 344124 markings/sec, 105 secs
lola: 41702488 markings, 118450228 edges, 331800 markings/sec, 110 secs
lola: 43421177 markings, 123342284 edges, 343738 markings/sec, 115 secs
lola: 44946343 markings, 127778960 edges, 305033 markings/sec, 120 secs
lola: 46639206 markings, 132597089 edges, 338573 markings/sec, 125 secs
lola: 48336368 markings, 137446890 edges, 339432 markings/sec, 130 secs
lola: 49926381 markings, 142053017 edges, 318003 markings/sec, 135 secs
lola: 51583697 markings, 146782228 edges, 331463 markings/sec, 140 secs
lola: 53192544 markings, 151447428 edges, 321769 markings/sec, 145 secs
lola: 54882290 markings, 156270998 edges, 337949 markings/sec, 150 secs
lola: 56490893 markings, 160936124 edges, 321721 markings/sec, 155 secs
lola: 58164390 markings, 165723015 edges, 334699 markings/sec, 160 secs
lola: 59797757 markings, 170446029 edges, 326673 markings/sec, 165 secs
lola: 61403011 markings, 175131722 edges, 321051 markings/sec, 170 secs
lola: 63061020 markings, 179829821 edges, 331602 markings/sec, 175 secs
lola: 64609050 markings, 184342546 edges, 309606 markings/sec, 180 secs
lola: 66255390 markings, 189020350 edges, 329268 markings/sec, 185 secs
lola: 67826202 markings, 193586276 edges, 314162 markings/sec, 190 secs
lola: 69383826 markings, 198140756 edges, 311525 markings/sec, 195 secs
lola: 71032650 markings, 202802415 edges, 329765 markings/sec, 200 secs
lola: 72561980 markings, 207262720 edges, 305866 markings/sec, 205 secs
lola: 74176349 markings, 211858634 edges, 322874 markings/sec, 210 secs
lola: 75729161 markings, 216360433 edges, 310562 markings/sec, 215 secs
lola: 77246320 markings, 220788091 edges, 303432 markings/sec, 220 secs
lola: 78862852 markings, 225376733 edges, 323306 markings/sec, 225 secs
lola: 80371308 markings, 229757793 edges, 301691 markings/sec, 230 secs
lola: 81839853 markings, 234050151 edges, 293709 markings/sec, 235 secs
lola: 83427896 markings, 238554511 edges, 317609 markings/sec, 240 secs
lola: 85018730 markings, 243170766 edges, 318167 markings/sec, 245 secs
lola: 86578946 markings, 247728961 edges, 312043 markings/sec, 250 secs
lola: 88270914 markings, 252539661 edges, 338394 markings/sec, 255 secs
lola: 89915468 markings, 257311631 edges, 328911 markings/sec, 260 secs
lola: 91523489 markings, 262011097 edges, 321604 markings/sec, 265 secs
lola: 93202372 markings, 266790725 edges, 335777 markings/sec, 270 secs
lola: 94853043 markings, 271569894 edges, 330134 markings/sec, 275 secs
lola: 96447577 markings, 276228801 edges, 318907 markings/sec, 280 secs
lola: 97998017 markings, 280770241 edges, 310088 markings/sec, 285 secs
lola: 99686510 markings, 285530319 edges, 337699 markings/sec, 290 secs
lola: 101250035 markings, 290088245 edges, 312705 markings/sec, 295 secs
lola: 102767328 markings, 294532073 edges, 303459 markings/sec, 300 secs
lola: 104396306 markings, 299143644 edges, 325796 markings/sec, 305 secs
lola: 106006791 markings, 303817657 edges, 322097 markings/sec, 310 secs
lola: 107569815 markings, 308387451 edges, 312605 markings/sec, 315 secs
lola: 109121428 markings, 312932180 edges, 310323 markings/sec, 320 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
Aborted (core dumped)
FORMULA SwimmingPool-PT-09-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-09-LTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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="SwimmingPool-PT-09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-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/SwimmingPool-PT-09.tgz
mv SwimmingPool-PT-09 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is SwimmingPool-PT-09, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r215-smll-152732267100665"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
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 ;