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 CircadianClock-PT-100000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126500608
=====================================================================

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


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ 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: 5151009 markings, 7701990 edges, 1030202 markings/sec, 0 secs
lola: 10462155 markings, 15662207 edges, 1062229 markings/sec, 5 secs
lola: 15526833 markings, 23253586 edges, 1012936 markings/sec, 10 secs
lola: 20593382 markings, 30886659 edges, 1013310 markings/sec, 15 secs
lola: 25339441 markings, 37978754 edges, 949212 markings/sec, 20 secs
lola: 30195600 markings, 45291048 edges, 971232 markings/sec, 25 secs
lola: 34840900 markings, 52241074 edges, 929060 markings/sec, 30 secs
lola: 39729360 markings, 59558520 edges, 977692 markings/sec, 35 secs
lola: 44531659 markings, 66763093 edges, 960460 markings/sec, 40 secs
lola: 49390701 markings, 74081152 edges, 971808 markings/sec, 45 secs
lola: 54425237 markings, 81625508 edges, 1006907 markings/sec, 50 secs
lola: 59662997 markings, 89463295 edges, 1047552 markings/sec, 55 secs
lola: 64644881 markings, 96945203 edges, 996377 markings/sec, 60 secs
lola: 69645632 markings, 104445980 edges, 1000150 markings/sec, 65 secs
lola: 74570905 markings, 111841434 edges, 985055 markings/sec, 70 secs
lola: 79536677 markings, 119272954 edges, 993154 markings/sec, 75 secs
lola: 84379967 markings, 126559510 edges, 968658 markings/sec, 80 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 345 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: 0lola: ========================================

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: ========================================
lola: subprocess 7 will run for 383 seconds at most (--localtimelimit=-1)
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 493 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: 5198865 markings, 7797701 edges, 1039773 markings/sec, 0 secs
lola: 10183087 markings, 15266122 edges, 996844 markings/sec, 5 secs
lola: 15142225 markings, 22684372 edges, 991828 markings/sec, 10 secs
lola: 20170900 markings, 30241698 edges, 1005735 markings/sec, 15 secs
lola: 25125797 markings, 37651467 edges, 990979 markings/sec, 20 secs
lola: 30133817 markings, 45167480 edges, 1001604 markings/sec, 25 secs
lola: 34913841 markings, 52327506 edges, 956005 markings/sec, 30 secs
lola: 39773956 markings, 59647710 edges, 972023 markings/sec, 35 secs
lola: 44798996 markings, 67197765 edges, 1005008 markings/sec, 40 secs
lola: 49751333 markings, 74602416 edges, 990467 markings/sec, 45 secs
lola: 55109799 markings, 82619319 edges, 1071693 markings/sec, 50 secs
lola: 60297870 markings, 90398171 edges, 1037614 markings/sec, 55 secs
lola: 65231566 markings, 97831892 edges, 986739 markings/sec, 60 secs
lola: 70066379 markings, 105066728 edges, 966963 markings/sec, 65 secs
lola: 75014577 markings, 112514951 edges, 989640 markings/sec, 70 secs
lola: 80038130 markings, 120038530 edges, 1004711 markings/sec, 75 secs
lola: 84940835 markings, 127381242 edges, 980541 markings/sec, 80 secs
lola: 86419269 markings, 129619701 edges, 295687 markings/sec, 85 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: processed formula: A (F ((ma_cap <= a_cap)))
lola: processed formula length: 25
lola: 0 rewrites
lola: ========================================
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: 4977374 markings, 7454721 edges, 995475 markings/sec, 0 secs
lola: 9994253 markings, 14988453 edges, 1003376 markings/sec, 5 secs
lola: 15078480 markings, 22578555 edges, 1016845 markings/sec, 10 secs
lola: 20121976 markings, 30143849 edges, 1008699 markings/sec, 15 secs
lola: 24796547 markings, 37192968 edges, 934914 markings/sec, 20 secs
lola: 29442002 markings, 44142149 edges, 929091 markings/sec, 25 secs
lola: 33871321 markings, 50771490 edges, 885864 markings/sec, 30 secs
lola: 38409964 markings, 57610155 edges, 907729 markings/sec, 35 secs
lola: 42866820 markings, 64267033 edges, 891371 markings/sec, 40 secs
lola: 47183235 markings, 70766233 edges, 863283 markings/sec, 45 secs
lola: 51493950 markings, 77194207 edges, 862143 markings/sec, 50 secs
lola: 56362109 markings, 84523935 edges, 973632 markings/sec, 55 secs
lola: 61078703 markings, 91579007 edges, 943319 markings/sec, 60 secs
lola: 65516141 markings, 98231952 edges, 887488 markings/sec, 65 secs
lola: 69822514 markings, 104722863 edges, 861275 markings/sec, 70 secs
lola: 74118765 markings, 111137158 edges, 859250 markings/sec, 75 secs
lola: 78519993 markings, 117739590 edges, 880246 markings/sec, 80 secs
lola: 82935807 markings, 124371198 edges, 883163 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1632 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: ========================================
lola: subprocess 15 will run for 3265 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: 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: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no unknown no yes no no unknown yes yes no unknown no yes
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 1494622211322

--------------------
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="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/CircadianClock-PT-100000.tgz
mv 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 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 r008-csrt-149436126500608"
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 ;