fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r210-smll-152732261200665
Last Updated
June 26, 2018

About the Execution of Irma.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
15919.320 365577.00 332622.00 2687.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 irma4mcc-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 r210-smll-152732261200665
=====================================================================


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


BK_STOP 1527461893332

--------------------
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
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 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: 2368171 markings, 6446520 edges, 473634 markings/sec, 0 secs
lola: 4433874 markings, 12201342 edges, 413141 markings/sec, 5 secs
lola: 6406969 markings, 17734717 edges, 394619 markings/sec, 10 secs
lola: 8270753 markings, 23012204 edges, 372757 markings/sec, 15 secs
lola: 10247913 markings, 28575649 edges, 395432 markings/sec, 20 secs
lola: 12148541 markings, 33958288 edges, 380126 markings/sec, 25 secs
lola: 13994154 markings, 39229098 edges, 369123 markings/sec, 30 secs
lola: 15855816 markings, 44495917 edges, 372332 markings/sec, 35 secs
lola: 17655963 markings, 49642277 edges, 360029 markings/sec, 40 secs
lola: 19525695 markings, 54930229 edges, 373946 markings/sec, 45 secs
lola: 21343479 markings, 60118589 edges, 363557 markings/sec, 50 secs
lola: 23114824 markings, 65175429 edges, 354269 markings/sec, 55 secs
lola: 24885347 markings, 70233407 edges, 354105 markings/sec, 60 secs
lola: 26637034 markings, 75234188 edges, 350337 markings/sec, 65 secs
lola: 28387550 markings, 80235260 edges, 350103 markings/sec, 70 secs
lola: 30072719 markings, 85062035 edges, 337034 markings/sec, 75 secs
lola: 31754710 markings, 89920213 edges, 336398 markings/sec, 80 secs
lola: 33518400 markings, 94948798 edges, 352738 markings/sec, 85 secs
lola: 35289528 markings, 100004754 edges, 354226 markings/sec, 90 secs
lola: 37060904 markings, 105077977 edges, 354275 markings/sec, 95 secs
lola: 38720527 markings, 109877818 edges, 331925 markings/sec, 100 secs
lola: 40453247 markings, 114816287 edges, 346544 markings/sec, 105 secs
lola: 42140188 markings, 119700082 edges, 337388 markings/sec, 110 secs
lola: 43831444 markings, 124537138 edges, 338251 markings/sec, 115 secs
lola: 45538932 markings, 129407893 edges, 341498 markings/sec, 120 secs
lola: 47169807 markings, 134142934 edges, 326175 markings/sec, 125 secs
lola: 48864503 markings, 138969566 edges, 338939 markings/sec, 130 secs
lola: 50442968 markings, 143560547 edges, 315693 markings/sec, 135 secs
lola: 52119723 markings, 148329069 edges, 335351 markings/sec, 140 secs
lola: 53720079 markings, 152986756 edges, 320071 markings/sec, 145 secs
lola: 55428826 markings, 157847009 edges, 341749 markings/sec, 150 secs
lola: 57034795 markings, 162520942 edges, 321194 markings/sec, 155 secs
lola: 58732187 markings, 167352183 edges, 339478 markings/sec, 160 secs
lola: 60344091 markings, 172039584 edges, 322381 markings/sec, 165 secs
lola: 62034581 markings, 176861693 edges, 338098 markings/sec, 170 secs
lola: 63603899 markings, 181409067 edges, 313864 markings/sec, 175 secs
lola: 65148432 markings, 185920861 edges, 308907 markings/sec, 180 secs
lola: 66811010 markings, 190629930 edges, 332516 markings/sec, 185 secs
lola: 68376031 markings, 195192144 edges, 313004 markings/sec, 190 secs
lola: 70034814 markings, 199914790 edges, 331757 markings/sec, 195 secs
lola: 71582098 markings, 204404167 edges, 309457 markings/sec, 200 secs
lola: 73102795 markings, 208846038 edges, 304139 markings/sec, 205 secs
lola: 74740494 markings, 213486383 edges, 327540 markings/sec, 210 secs
lola: 76283669 markings, 217976400 edges, 308635 markings/sec, 215 secs
lola: 77807764 markings, 222431626 edges, 304819 markings/sec, 220 secs
lola: 79430006 markings, 227018085 edges, 324448 markings/sec, 225 secs
lola: 80927650 markings, 231379661 edges, 299529 markings/sec, 230 secs
lola: 82396440 markings, 235679699 edges, 293758 markings/sec, 235 secs
lola: 84046290 markings, 240342656 edges, 329970 markings/sec, 240 secs
lola: 85633608 markings, 244964747 edges, 317464 markings/sec, 245 secs
lola: 87194332 markings, 249532450 edges, 312145 markings/sec, 250 secs
lola: 88932874 markings, 254453574 edges, 347708 markings/sec, 255 secs
lola: 90570668 markings, 259224736 edges, 327559 markings/sec, 260 secs
lola: 92175932 markings, 263919354 edges, 321053 markings/sec, 265 secs
lola: 93887039 markings, 268762944 edges, 342221 markings/sec, 270 secs
lola: 95512673 markings, 273495282 edges, 325127 markings/sec, 275 secs
lola: 97102153 markings, 278143336 edges, 317896 markings/sec, 280 secs
lola: 98782788 markings, 282912620 edges, 336127 markings/sec, 285 secs
lola: 100370127 markings, 287520574 edges, 317468 markings/sec, 290 secs
lola: 101919284 markings, 292045930 edges, 309831 markings/sec, 295 secs
lola: 103428330 markings, 296470514 edges, 301809 markings/sec, 300 secs
lola: 105114751 markings, 301222822 edges, 337284 markings/sec, 305 secs
lola: 106711322 markings, 305875023 edges, 319314 markings/sec, 310 secs
lola: 108212301 markings, 310266434 edges, 300196 markings/sec, 315 secs
lola: 109248305 markings, 313307472 edges, 207201 markings/sec, 320 secs
lola: 109251253 markings, 313316314 edges, 590 markings/sec, 325 secs
lola: 109257659 markings, 313335286 edges, 1281 markings/sec, 330 secs
lola: 109263070 markings, 313351274 edges, 1082 markings/sec, 335 secs
lola: 109265875 markings, 313359689 edges, 561 markings/sec, 340 secs
lola: local time limit reached - aborting
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 -----
----- 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="SwimmingPool-PT-09"
export BK_EXAMINATION="LTLCardinality"
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/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 irma4mcc-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 r210-smll-152732261200665"
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 '' LTLCardinality.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 ;