fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r088-csrt-149441074700608
Last Updated
June 27, 2017

About the Execution of LoLA for S_CircadianClock-PT-100000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15907.880 271771.00 272199.00 67.70 FTTTF?FTTF?FTFF? 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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_CircadianClock-PT-100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074700608
=====================================================================


--------------------
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 CircadianClock-PT-100000-LTLCardinality-0
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-1
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-10
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-11
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-12
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-13
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-14
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-15
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-2
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-3
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-4
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-5
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-6
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-7
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-8
FORMULA_NAME CircadianClock-PT-100000-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496356424604


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


checking for too many tokens
===========================================================================================
S_CircadianClock-PT-100000: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_CircadianClock-PT-100000 @ 3540 seconds
----- 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: 30/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 14 places, 16 transitions, 7 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 26 transition conflict sets
lola: TASK
lola: reading formula from CircadianClock-PT-100000-LTLCardinality.task
lola: A ((((2 <= dr) U (3 <= r)) U F (F ((a_cap <= a))))) : A ((((1 <= r_cap) U (c <= a_cap)) U (mr <= r))) : A ((X (G ((da <= mr_cap))) U ((2 <= dr_a) U (a <= ma_cap)))) : A (F (G (X (F ((2 <= r_cap)))))) : A (X (F (G (G ((da_a <= a_cap)))))) : A (X (((2 <= c_cap) U G ((1 <= da_a))))) : A (X (X (X (F ((2 <= c_cap)))))) : A (F (F (G (G ((a_cap <= ma)))))) : A (F ((1 <= ma))) : A (X (F (G (G ((c <= a)))))) : A (((dr <= r) U F ((1 <= r_cap)))) : A (F ((ma_cap <= a_cap))) : A (F (G (G (G ((dr <= r_cap)))))) : A ((G (F ((1 <= ma_cap))) U X (G ((3 <= c_cap))))) : A ((c_cap <= da)) : A ((F (F ((1 <= a_cap))) U ((dr <= ma) U (3 <= r_cap))))
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 ((((2 <= dr) U (3 <= r)) U F (F ((a_cap <= a)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= dr) U (3 <= r)) U F ((a_cap <= a))))
lola: processed formula: A ((((2 <= dr) U (3 <= r)) U F ((a_cap <= a))))
lola: processed formula length: 47
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 31 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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= r_cap) U (c <= a_cap)) U (mr <= r)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= r_cap) U (c <= a_cap)) U (mr <= r)))
lola: processed formula: A ((((1 <= r_cap) U (c <= a_cap)) U (mr <= r)))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((da <= mr_cap))) U ((2 <= dr_a) U (a <= ma_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((da <= mr_cap))) U ((2 <= dr_a) U (a <= ma_cap))))
lola: processed formula: A ((X (G ((da <= mr_cap))) U ((2 <= dr_a) U (a <= ma_cap))))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (F ((2 <= r_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X (F ((2 <= r_cap))))))
lola: processed formula: A (F (G (X (F ((2 <= r_cap))))))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (G ((da_a <= a_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G (G ((da_a <= a_cap))))))
lola: processed formula: A (X (F (G (G ((da_a <= a_cap))))))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: 5053670 markings, 7553695 edges, 1010734 markings/sec, 0 secs
lola: 9806232 markings, 14706281 edges, 950512 markings/sec, 5 secs
lola: 14496049 markings, 21696121 edges, 937963 markings/sec, 10 secs
lola: 19249230 markings, 28849326 edges, 950636 markings/sec, 15 secs
lola: 23905068 markings, 35810015 edges, 931168 markings/sec, 20 secs
lola: 28973900 markings, 43447654 edges, 1013766 markings/sec, 25 secs
lola: 34052683 markings, 51052852 edges, 1015757 markings/sec, 30 secs
lola: 38951778 markings, 58403360 edges, 979819 markings/sec, 35 secs
lola: 44006305 markings, 66006525 edges, 1010905 markings/sec, 40 secs
lola: 48773700 markings, 73147153 edges, 953479 markings/sec, 45 secs
lola: 53597432 markings, 80394595 edges, 964746 markings/sec, 50 secs
lola: 58542269 markings, 87784244 edges, 988967 markings/sec, 55 secs
lola: 63124110 markings, 94647903 edges, 916368 markings/sec, 60 secs
lola: 67717316 markings, 101534291 edges, 918641 markings/sec, 65 secs
lola: 72390343 markings, 108580321 edges, 934605 markings/sec, 70 secs
lola: 76719726 markings, 115039066 edges, 865877 markings/sec, 75 secs
lola: 81308065 markings, 121915721 edges, 917668 markings/sec, 80 secs
lola: 86411114 markings, 129611545 edges, 1020610 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= c_cap) U G ((1 <= da_a)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((2 <= c_cap) U G ((1 <= da_a)))))
lola: processed formula: A (X (((2 <= c_cap) U G ((1 <= da_a)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: subprocess 6 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((2 <= c_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((2 <= c_cap))))))
lola: processed formula: A (X (X (X (F ((2 <= c_cap))))))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: subprocess 7 will run for 383 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (F (G (G ((a_cap <= ma))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G ((a_cap <= ma)))))
lola: processed formula: A (F (G (G ((a_cap <= ma)))))
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: ========================================
lola: subprocess 8 will run for 431 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= ma)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((1 <= ma)))
lola: processed formula: A (F ((1 <= ma)))
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 31 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: ========================================
lola: subprocess 9 will run for 492 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (G ((c <= a))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G (G ((c <= a))))))
lola: processed formula: A (X (F (G (G ((c <= a))))))
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: 5710983 markings, 8521936 edges, 1142197 markings/sec, 0 secs
lola: 11213629 markings, 16813685 edges, 1100529 markings/sec, 5 secs
lola: 16322958 markings, 24445833 edges, 1021866 markings/sec, 10 secs
lola: 21165528 markings, 31730948 edges, 968514 markings/sec, 15 secs
lola: 26326914 markings, 39453694 edges, 1032277 markings/sec, 20 secs
lola: 31436983 markings, 47137140 edges, 1022014 markings/sec, 25 secs
lola: 36353392 markings, 54506601 edges, 983282 markings/sec, 30 secs
lola: 41125310 markings, 61650412 edges, 954384 markings/sec, 35 secs
lola: 45847517 markings, 68747746 edges, 944441 markings/sec, 40 secs
lola: 50475568 markings, 75675820 edges, 925610 markings/sec, 45 secs
lola: 55361477 markings, 83022676 edges, 977182 markings/sec, 50 secs
lola: 60260157 markings, 90360458 edges, 979736 markings/sec, 55 secs
lola: 65372880 markings, 98045430 edges, 1022545 markings/sec, 60 secs
lola: 70356755 markings, 105513156 edges, 996775 markings/sec, 65 secs
lola: 75327599 markings, 112954820 edges, 994169 markings/sec, 70 secs
lola: 80202763 markings, 120303164 edges, 975033 markings/sec, 75 secs
lola: 84835289 markings, 127235713 edges, 926505 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 560 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((dr <= r) U F ((1 <= r_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((dr <= r) U F ((1 <= r_cap))))
lola: processed formula: A (((dr <= r) U F ((1 <= r_cap))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 31 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: subprocess 11 will run for 672 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((ma_cap <= a_cap)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((ma_cap <= a_cap)))
lola: lola: ========================================
processed formula: A (F ((ma_cap <= a_cap)))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 bytes per marking, with 31 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 12 will run for 840 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (G ((dr <= r_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G (G ((dr <= r_cap))))))
lola: processed formula: A (F (G (G (G ((dr <= r_cap))))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: ========================================
lola: subprocess 13 will run for 1120 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((1 <= ma_cap))) U X (G ((3 <= c_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((1 <= ma_cap))) U X (G ((3 <= c_cap)))))
lola: processed formula: A ((G (F ((1 <= ma_cap))) U X (G ((3 <= c_cap)))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: 5140468 markings, 7680907 edges, 1028094 markings/sec, 0 secs
lola: 9909549 markings, 14819046 edges, 953816 markings/sec, 5 secs
lola: 14686697 markings, 21986769 edges, 955430 markings/sec, 10 secs
lola: 19426085 markings, 29126182 edges, 947878 markings/sec, 15 secs
lola: 24121862 markings, 36143602 edges, 939155 markings/sec, 20 secs
lola: 28872124 markings, 43272268 edges, 950052 markings/sec, 25 secs
lola: 33573767 markings, 50347363 edges, 940329 markings/sec, 30 secs
lola: 38199766 markings, 57299340 edges, 925200 markings/sec, 35 secs
lola: 42895106 markings, 64295320 edges, 939068 markings/sec, 40 secs
lola: 47473435 markings, 71173671 edges, 915666 markings/sec, 45 secs
lola: 52165484 markings, 78230704 edges, 938410 markings/sec, 50 secs
lola: 56920487 markings, 85340688 edges, 951001 markings/sec, 55 secs
lola: 61631636 markings, 92431944 edges, 942230 markings/sec, 60 secs
lola: 66535425 markings, 99770514 edges, 980758 markings/sec, 65 secs
lola: 71216563 markings, 106816919 edges, 936228 markings/sec, 70 secs
lola: 75754734 markings, 113609086 edges, 907634 markings/sec, 75 secs
lola: 80457806 markings, 120658208 edges, 940614 markings/sec, 80 secs
lola: 85095173 markings, 127595598 edges, 927473 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1634 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((c_cap <= da))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (c_cap <= da)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-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: subprocess 15 will run for 3268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((1 <= a_cap))) U ((dr <= ma) U (3 <= r_cap))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((1 <= a_cap)) U ((dr <= ma) U (3 <= r_cap))))
lola: ========================================
lola: processed formula: A ((F ((1 <= a_cap)) U ((dr <= ma) U (3 <= r_cap))))
lola: processed formula length: 52
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 32 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: RESULT
lola:
SUMMARY: no yes yes no unknown no yes no no unknown yes yes no unknown no yes
lola: ========================================
FORMULA CircadianClock-PT-100000-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496356696375

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="S_CircadianClock-PT-100000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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/S_CircadianClock-PT-100000.tgz
mv S_CircadianClock-PT-100000 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_CircadianClock-PT-100000, 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 r088-csrt-149441074700608"
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 ;