About the Execution of M4M.full for SwimmingPool-PT-09
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15905.640 | 339382.00 | 340999.00 | 2617.20 | ???????????????? | 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-full
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 r214-smll-152732265900665
=====================================================================
--------------------
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 1527499180889
BK_STOP 1527499520271
--------------------
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 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 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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 236 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 295 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 354 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: 2278745 markings, 6192153 edges, 455749 markings/sec, 0 secs
lola: 4363482 markings, 12001017 edges, 416947 markings/sec, 5 secs
lola: 6342708 markings, 17555414 edges, 395845 markings/sec, 10 secs
lola: 8182781 markings, 22756971 edges, 368015 markings/sec, 15 secs
lola: 10088681 markings, 28123364 edges, 381180 markings/sec, 20 secs
lola: 11937101 markings, 33359393 edges, 369684 markings/sec, 25 secs
lola: 13751894 markings, 38530796 edges, 362959 markings/sec, 30 secs
lola: 15568338 markings, 43668865 edges, 363289 markings/sec, 35 secs
lola: 17312922 markings, 48647880 edges, 348917 markings/sec, 40 secs
lola: 19061882 markings, 53648781 edges, 349792 markings/sec, 45 secs
lola: 20939339 markings, 58961874 edges, 375491 markings/sec, 50 secs
lola: 22728736 markings, 64064973 edges, 357879 markings/sec, 55 secs
lola: 24518243 markings, 69174965 edges, 357901 markings/sec, 60 secs
lola: 26275645 markings, 74195717 edges, 351480 markings/sec, 65 secs
lola: 28029436 markings, 79214962 edges, 350758 markings/sec, 70 secs
lola: 29701134 markings, 84045067 edges, 334340 markings/sec, 75 secs
lola: 31430920 markings, 88976401 edges, 345957 markings/sec, 80 secs
lola: 33204332 markings, 94036824 edges, 354682 markings/sec, 85 secs
lola: 34984142 markings, 99122282 edges, 355962 markings/sec, 90 secs
lola: 36702354 markings, 104111927 edges, 343642 markings/sec, 95 secs
lola: 38439401 markings, 109059871 edges, 347409 markings/sec, 100 secs
lola: 40179949 markings, 114025846 edges, 348110 markings/sec, 105 secs
lola: 41854140 markings, 118893011 edges, 334838 markings/sec, 110 secs
lola: 43581833 markings, 123809148 edges, 345539 markings/sec, 115 secs
lola: 45289733 markings, 128693501 edges, 341580 markings/sec, 120 secs
lola: 46936504 markings, 133462702 edges, 329354 markings/sec, 125 secs
lola: 48645168 markings, 138334779 edges, 341733 markings/sec, 130 secs
lola: 50237006 markings, 142961042 edges, 318368 markings/sec, 135 secs
lola: 51920817 markings, 147754645 edges, 336762 markings/sec, 140 secs
lola: 53537277 markings, 152455737 edges, 323292 markings/sec, 145 secs
lola: 55254723 markings, 157343465 edges, 343489 markings/sec, 150 secs
lola: 56871390 markings, 162045490 edges, 323333 markings/sec, 155 secs
lola: 58575340 markings, 166898866 edges, 340790 markings/sec, 160 secs
lola: 60198201 markings, 171613126 edges, 324572 markings/sec, 165 secs
lola: 61894672 markings, 176461808 edges, 339294 markings/sec, 170 secs
lola: 63483234 markings, 181057375 edges, 317712 markings/sec, 175 secs
lola: 65032844 markings, 185584306 edges, 309922 markings/sec, 180 secs
lola: 66704982 markings, 190323647 edges, 334428 markings/sec, 185 secs
lola: 68281677 markings, 194918030 edges, 315339 markings/sec, 190 secs
lola: 69948489 markings, 199667276 edges, 333362 markings/sec, 195 secs
lola: 71515108 markings, 204206642 edges, 313324 markings/sec, 200 secs
lola: 73049210 markings, 208687724 edges, 306820 markings/sec, 205 secs
lola: 74695741 markings, 213355225 edges, 329306 markings/sec, 210 secs
lola: 76249995 markings, 217877033 edges, 310851 markings/sec, 215 secs
lola: 77766647 markings, 222311177 edges, 303330 markings/sec, 220 secs
lola: 79401914 markings, 226935998 edges, 327053 markings/sec, 225 secs
lola: 80908486 markings, 231326691 edges, 301314 markings/sec, 230 secs
lola: 82391989 markings, 235666984 edges, 296701 markings/sec, 235 secs
lola: 83984898 markings, 240164930 edges, 318582 markings/sec, 240 secs
lola: 85560314 markings, 244752826 edges, 315083 markings/sec, 245 secs
lola: 87113902 markings, 249294772 edges, 310718 markings/sec, 250 secs
lola: 88815572 markings, 254111748 edges, 340334 markings/sec, 255 secs
lola: 90364434 markings, 258620354 edges, 309772 markings/sec, 260 secs
lola: 91864138 markings, 263007622 edges, 299941 markings/sec, 265 secs
lola: 93447864 markings, 267494240 edges, 316745 markings/sec, 270 secs
lola: 94917159 markings, 271758272 edges, 293859 markings/sec, 275 secs
lola: 96341736 markings, 275917436 edges, 284915 markings/sec, 280 secs
lola: 97729810 markings, 279982708 edges, 277615 markings/sec, 285 secs
lola: 99243606 markings, 284244458 edges, 302759 markings/sec, 290 secs
lola: 100628633 markings, 288275226 edges, 277005 markings/sec, 295 secs
lola: 101970066 markings, 292196037 edges, 268287 markings/sec, 300 secs
lola: 103285380 markings, 296047679 edges, 263063 markings/sec, 305 secs
lola: 104763623 markings, 300203919 edges, 295649 markings/sec, 310 secs
lola: 106169585 markings, 304293064 edges, 281192 markings/sec, 315 secs
lola: 107532133 markings, 308275993 edges, 272510 markings/sec, 320 secs
lola: 108853489 markings, 312145796 edges, 264271 markings/sec, 325 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 stdout -----
----- Finished stdout -----
----- Finished stderr -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SwimmingPool-PT-09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/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-full"
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 r214-smll-152732265900665"
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 ;