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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074700606
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496356352587


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 CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ 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-CTLCardinality.task
lola: E (G (NOT(E (F ((mr_cap <= dr_a)))))) : E (F ((A (G ((1 <= da_a))) OR (2 <= dr)))) : A (G (NOT(E (G ((2 <= c)))))) : NOT(E (F ((2 <= da_a)))) : A (G (E (G ((c <= mr_cap))))) : E (F (NOT(A (G ((1 <= r_cap)))))) : (((dr + 1 <= da) OR ((r_cap + 1 <= a) AND (ma_cap <= 0) AND ((a + 1 <= ma) OR (r + 1 <= r_cap)))) OR A (G (()))) : (A (G (E (X ((2 <= ma_cap))))) OR (((2 <= a) AND (3 <= dr)) OR (dr <= dr_a))) : NOT(A (G (E (F ((2 <= da)))))) : A (G ((dr <= r_cap))) : E ((((mr + 1 <= dr) AND (ma <= 1)) U ((ma_cap + 1 <= c) AND (c_cap <= 0)))) : E (F (((c_cap <= da_a) AND (1 <= ma) AND (dr <= 1) AND (dr <= c_cap) AND (r <= a) AND (da_a + 1 <= mr)))) : E (G (A (G (((c <= c_cap) OR (1 <= c_cap)))))) : E (F (((r_cap + 1 <= ma) OR (mr_cap + 1 <= ma) OR ((ma_cap + 1 <= dr) AND (mr_cap + 1 <= r))))) : NOT(A (G (E (X ((c <= ma)))))) : E (F (A (F ((c_cap <= ma)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(E (F ((mr_cap <= dr_a))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U (mr_cap <= dr_a))))
lola: processed formula length: 41
lola: 7 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 5696514 markings, 8496543 edges, 1139303 markings/sec, 0 secs
lola: 11138268 markings, 16676480 edges, 1088351 markings/sec, 5 secs
lola: 17032879 markings, 25532965 edges, 1178922 markings/sec, 10 secs
lola: 22786144 markings, 34172173 edges, 1150653 markings/sec, 15 secs
lola: 28552227 markings, 42804309 edges, 1153217 markings/sec, 20 secs
lola: 34275314 markings, 51375486 edges, 1144617 markings/sec, 25 secs
lola: 39926960 markings, 59853719 edges, 1130329 markings/sec, 30 secs
lola: 45529643 markings, 68259058 edges, 1120537 markings/sec, 35 secs
lola: 51015606 markings, 76515862 edges, 1097193 markings/sec, 40 secs
lola: 56733081 markings, 85065878 edges, 1143495 markings/sec, 45 secs
lola: 62054001 markings, 93054312 edges, 1064184 markings/sec, 50 secs
lola: 67154215 markings, 100708092 edges, 1020043 markings/sec, 55 secs
lola: 72303317 markings, 108406271 edges, 1029820 markings/sec, 60 secs
lola: 77278296 markings, 115878683 edges, 994996 markings/sec, 65 secs
lola: 82367883 markings, 123535354 edges, 1017917 markings/sec, 70 secs
lola: 87382388 markings, 131064338 edges, 1002901 markings/sec, 75 secs
lola: 92411526 markings, 138611988 edges, 1005828 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 230 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((1 <= da_a))) OR (2 <= dr))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 230 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= da_a)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (da_a <= 0))))
lola: processed formula length: 36
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 4210697 markings, 10521415 edges, 3225863212045959168 markings/sec, 0 secs
lola: 8357542 markings, 20872583 edges, 829369 markings/sec, 5 secs
lola: 12505696 markings, 31217023 edges, 829631 markings/sec, 10 secs
lola: 16733871 markings, 41801528 edges, 845635 markings/sec, 15 secs
lola: 20849928 markings, 52099959 edges, 823211 markings/sec, 20 secs
lola: 24916437 markings, 62249183 edges, 813302 markings/sec, 25 secs
lola: 29070838 markings, 72641821 edges, 830880 markings/sec, 30 secs
lola: 33111274 markings, 82733652 edges, 808087 markings/sec, 35 secs
lola: 36999341 markings, 92497837 edges, 777613 markings/sec, 40 secs
lola: 40913978 markings, 102241727 edges, 782927 markings/sec, 45 secs
lola: 44723420 markings, 111770035 edges, 761888 markings/sec, 50 secs
lola: 48426346 markings, 121052933 edges, 740585 markings/sec, 55 secs
lola: 52125889 markings, 130277403 edges, 739909 markings/sec, 60 secs
lola: 55989747 markings, 139968958 edges, 772772 markings/sec, 65 secs
lola: 59794622 markings, 149483565 edges, 760975 markings/sec, 70 secs
lola: 63542863 markings, 158828268 edges, 749648 markings/sec, 75 secs
lola: 67349775 markings, 168348987 edges, 761382 markings/sec, 80 secs
lola: 71136414 markings, 177808883 edges, 757328 markings/sec, 85 secs
lola: 74969055 markings, 187406788 edges, 766528 markings/sec, 90 secs
lola: 78866274 markings, 197132942 edges, 779444 markings/sec, 95 secs
lola: 82686574 markings, 206673560 edges, 764060 markings/sec, 100 secs
lola: 86444516 markings, 216089464 edges, 751588 markings/sec, 105 secs
lola: 90129291 markings, 225287421 edges, 736955 markings/sec, 110 secs
lola: 93849365 markings, 234599198 edges, 744015 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= dr)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-CTLCardinality-2.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (G ((2 <= c))))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (c <= 1)))))
lola: processed formula length: 38
lola: 5 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 4096068 markings, 10192156 edges, 3223546815924142080 markings/sec, 0 secs
lola: 8328519 markings, 20785514 edges, 846490 markings/sec, 5 secs
lola: 12630746 markings, 31561554 edges, 860445 markings/sec, 10 secs
lola: 16887661 markings, 42175406 edges, 851383 markings/sec, 15 secs
lola: 21118713 markings, 52756030 edges, 846210 markings/sec, 20 secs
lola: 25338157 markings, 63314340 edges, 843889 markings/sec, 25 secs
lola: 29519651 markings, 73758803 edges, 836299 markings/sec, 30 secs
lola: 33426037 markings, 83552241 edges, 781277 markings/sec, 35 secs
lola: 37269057 markings, 93138300 edges, 768604 markings/sec, 40 secs
lola: 41144490 markings, 102833263 edges, 775087 markings/sec, 45 secs
lola: 44969886 markings, 112409431 edges, 765079 markings/sec, 50 secs
lola: 48789689 markings, 121968822 edges, 763961 markings/sec, 55 secs
lola: 52630368 markings, 131560999 edges, 768136 markings/sec, 60 secs
lola: 56605020 markings, 141510323 edges, 794930 markings/sec, 65 secs
lola: 60472698 markings, 151145698 edges, 773536 markings/sec, 70 secs
lola: 64265137 markings, 160630595 edges, 758488 markings/sec, 75 secs
lola: 68055420 markings, 170111179 edges, 758057 markings/sec, 80 secs
lola: 71738691 markings, 179315713 edges, 736654 markings/sec, 85 secs
lola: 75395535 markings, 188486226 edges, 731369 markings/sec, 90 secs
lola: 79122746 markings, 197767839 edges, 745442 markings/sec, 95 secs
lola: 82807109 markings, 207014632 edges, 736873 markings/sec, 100 secs
lola: 86491893 markings, 216184217 edges, 736957 markings/sec, 105 secs
lola: 90110914 markings, 225232288 edges, 723804 markings/sec, 110 secs
lola: 93947356 markings, 234841595 edges, 767288 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 246 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((2 <= da_a))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-CTLCardinality-3.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((c <= mr_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (mr_cap + 1 <= c))))
lola: processed formula length: 42
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3012415 markings, 10512492 edges, 592361 markings/sec, 0 secs
lola: 6277593 markings, 21777751 edges, 653036 markings/sec, 5 secs
lola: 9307454 markings, 32529766 edges, 605972 markings/sec, 10 secs
lola: 12245787 markings, 42746095 edges, 587667 markings/sec, 15 secs
lola: 15123607 markings, 52894351 edges, 575564 markings/sec, 20 secs
lola: 17928214 markings, 62712765 edges, 560921 markings/sec, 25 secs
lola: 20900210 markings, 73076091 edges, 594399 markings/sec, 30 secs
lola: 23709805 markings, 82939098 edges, 561919 markings/sec, 35 secs
lola: 26500266 markings, 92625540 edges, 558092 markings/sec, 40 secs
lola: 29318442 markings, 102573617 edges, 563635 markings/sec, 45 secs
lola: 32100322 markings, 112290644 edges, 556376 markings/sec, 50 secs
lola: 34900350 markings, 122025957 edges, 560006 markings/sec, 55 secs
lola: 37599941 markings, 131599575 edges, 539918 markings/sec, 60 secs
lola: 40333154 markings, 141132410 edges, 546643 markings/sec, 65 secs
lola: 43016050 markings, 150517127 edges, 536579 markings/sec, 70 secs
lola: 45700458 markings, 159804894 edges, 536882 markings/sec, 75 secs
lola: 48326062 markings, 169104001 edges, 525121 markings/sec, 80 secs
lola: 50951506 markings, 178305766 edges, 525089 markings/sec, 85 secs
lola: 54052412 markings, 189053765 edges, 620181 markings/sec, 90 secs
lola: 56788931 markings, 198755438 edges, 547304 markings/sec, 95 secs
lola: 59539401 markings, 208357302 edges, 550094 markings/sec, 100 secs
lola: 62500626 markings, 218522445 edges, 592245 markings/sec, 105 secs
lola: 65423884 markings, 228925522 edges, 584652 markings/sec, 110 secs
lola: 68312396 markings, 239049239 edges, 577702 markings/sec, 115 secs
lola: 71188309 markings, 249152876 edges, 575183 markings/sec, 120 secs
lola: 73900740 markings, 258497541 edges, 542486 markings/sec, 125 secs
lola: 76676685 markings, 268178602 edges, 555189 markings/sec, 130 secs
lola: 79529266 markings, 278316662 edges, 570516 markings/sec, 135 secs
lola: 82523830 markings, 288794904 edges, 598913 markings/sec, 140 secs
lola: 85500856 markings, 299051681 edges, 595405 markings/sec, 145 secs
lola: 88217875 markings, 308720083 edges, 543404 markings/sec, 150 secs
lola: 91179900 markings, 319119140 edges, 592405 markings/sec, 155 secs
lola: 94110323 markings, 329340818 edges, 586085 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(A (G ((1 <= r_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-CTLCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((dr + 1 <= da) OR ((r_cap + 1 <= a) AND (ma_cap <= 0) AND ((a + 1 <= ma) OR (r + 1 <= r_cap)))) OR A (G (())))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X ((2 <= ma_cap))))) OR (((2 <= a) AND (3 <= dr)) OR (dr <= dr_a)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((2 <= ma_cap)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((2 <= ma_cap)))))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 4938329 markings, 7376632 edges, 3221853842895273984 markings/sec, 0 secs
lola: 9503486 markings, 14206923 edges, 913031 markings/sec, 5 secs
lola: 14190992 markings, 21281912 edges, 937501 markings/sec, 10 secs
lola: 18507021 markings, 27713946 edges, 863206 markings/sec, 15 secs
lola: 23297206 markings, 34897322 edges, 958037 markings/sec, 20 secs
lola: 27829365 markings, 41729503 edges, 906432 markings/sec, 25 secs
lola: 32493570 markings, 48693731 edges, 932841 markings/sec, 30 secs
lola: 36933039 markings, 55365892 edges, 887894 markings/sec, 35 secs
lola: 41087687 markings, 61587892 edges, 830930 markings/sec, 40 secs
lola: 45089585 markings, 67589810 edges, 800380 markings/sec, 45 secs
lola: 49471592 markings, 74171839 edges, 876401 markings/sec, 50 secs
lola: 54067329 markings, 81067599 edges, 919147 markings/sec, 55 secs
lola: 58289140 markings, 87389431 edges, 844362 markings/sec, 60 secs
lola: 62332151 markings, 93463988 edges, 808602 markings/sec, 65 secs
lola: 66526722 markings, 99753108 edges, 838914 markings/sec, 70 secs
lola: 70753892 markings, 106107429 edges, 845434 markings/sec, 75 secs
lola: 74957357 markings, 112414338 edges, 840693 markings/sec, 80 secs
lola: 79252744 markings, 118853140 edges, 859077 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= a) AND (3 <= dr)) OR (dr <= dr_a))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= a) AND (3 <= dr)) OR (dr <= dr_a))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: processed formula with 3 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 8 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: lola: ========================================
========================================
...considering subproblem: NOT(A (G (E (F ((2 <= da))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (2 <= da))))
lola: processed formula length: 34
lola: 8 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 6296143 markings, 9396174 edges, 1259219 markings/sec, 0 secs
lola: 12151511 markings, 18202960 edges, 1171074 markings/sec, 5 secs
lola: 18160351 markings, 27220611 edges, 1201768 markings/sec, 10 secs
lola: 23889465 markings, 35789584 edges, 1145823 markings/sec, 15 secs
lola: 29791175 markings, 44682201 edges, 1180342 markings/sec, 20 secs
lola: 35721971 markings, 53543763 edges, 1186159 markings/sec, 25 secs
lola: 41742891 markings, 62585572 edges, 1204184 markings/sec, 30 secs
lola: 47649365 markings, 71449604 edges, 1181295 markings/sec, 35 secs
lola: 53677604 markings, 80477873 edges, 1205648 markings/sec, 40 secs
lola: 59740814 markings, 89581328 edges, 1212642 markings/sec, 45 secs
lola: 65636955 markings, 98437284 edges, 1179228 markings/sec, 50 secs
lola: 71484924 markings, 107185282 edges, 1169594 markings/sec, 55 secs
lola: 77106466 markings, 115612544 edges, 1124308 markings/sec, 60 secs
lola: 82892230 markings, 124292645 edges, 1157153 markings/sec, 65 secs
lola: 88385956 markings, 132571468 edges, 1098745 markings/sec, 70 secs
lola: 94059299 markings, 141059769 edges, 1134669 markings/sec, 75 secs
lola: 94366426 markings, 141532378 edges, 61425 markings/sec, 80 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((dr <= r_cap)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-CTLCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((mr + 1 <= dr) AND (ma <= 1)) U ((ma_cap + 1 <= c) AND (c_cap <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((mr + 1 <= dr) AND (ma <= 1)) U ((ma_cap + 1 <= c) AND (c_cap <= 0)))
lola: processed formula length: 72
lola: 1 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((c_cap <= da_a) AND (1 <= ma) AND (dr <= 1) AND (dr <= c_cap) AND (r <= a) AND (da_a + 1 <= mr))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-CTLCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 12 will run for 713 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G (((c <= c_cap) OR (1 <= c_cap))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: NOT(A(TRUE U E(TRUE U ((c_cap + 1 <= c) AND (c_cap <= 0)))))
lola: processed formula length: 60
lola: 4 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 6053542 markings, 9053573 edges, 1210708 markings/sec, 0 secs
lola: 12314565 markings, 18429066 edges, 1252205 markings/sec, 5 secs
lola: 18488095 markings, 27688188 edges, 1234706 markings/sec, 10 secs
lola: 24518438 markings, 36736752 edges, 1206069 markings/sec, 15 secs
lola: 30588682 markings, 45877211 edges, 1214049 markings/sec, 20 secs
lola: 36477671 markings, 54677854 edges, 1177798 markings/sec, 25 secs
lola: 42302893 markings, 63405573 edges, 1165044 markings/sec, 30 secs
lola: 47857251 markings, 71757491 edges, 1110872 markings/sec, 35 secs
lola: 53244345 markings, 79844612 edges, 1077419 markings/sec, 40 secs
lola: 58743574 markings, 88086853 edges, 1099846 markings/sec, 45 secs
lola: 64354132 markings, 96507941 edges, 1122112 markings/sec, 50 secs
lola: 70068941 markings, 105069292 edges, 1142962 markings/sec, 55 secs
lola: 75701631 markings, 113502883 edges, 1126538 markings/sec, 60 secs
lola: 81453394 markings, 122153802 edges, 1150353 markings/sec, 65 secs
lola: 86944356 markings, 130388276 edges, 1098192 markings/sec, 70 secs
lola: 92006703 markings, 138007164 edges, 1012469 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 923 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((r_cap + 1 <= ma) OR (mr_cap + 1 <= ma) OR ((ma_cap + 1 <= dr) AND (mr_cap + 1 <= r)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CircadianClock-PT-100000-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CircadianClock-PT-100000-CTLCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1385 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (X ((c <= ma))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((ma + 1 <= c)))
lola: processed formula length: 27
lola: 7 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 4764081 markings, 7128137 edges, 952816 markings/sec, 0 secs
lola: 9384028 markings, 14068008 edges, 923989 markings/sec, 5 secs
lola: 13951221 markings, 20902371 edges, 913439 markings/sec, 10 secs
lola: 18451319 markings, 27651411 edges, 900020 markings/sec, 15 secs
lola: 22917820 markings, 34335524 edges, 893300 markings/sec, 20 secs
lola: 27478331 markings, 41178468 edges, 912102 markings/sec, 25 secs
lola: 32388004 markings, 48575844 edges, 981935 markings/sec, 30 secs
lola: 37316774 markings, 55933360 edges, 985754 markings/sec, 35 secs
lola: 42023418 markings, 63023628 edges, 941329 markings/sec, 40 secs
lola: 46332992 markings, 69465751 edges, 861915 markings/sec, 45 secs
lola: 51078241 markings, 76578495 edges, 949050 markings/sec, 50 secs
lola: 56193906 markings, 84287530 edges, 1023133 markings/sec, 55 secs
lola: 61177340 markings, 91754373 edges, 996687 markings/sec, 60 secs
lola: 66107376 markings, 99114420 edges, 986007 markings/sec, 65 secs
lola: 70927456 markings, 106354555 edges, 964016 markings/sec, 70 secs
lola: 75670740 markings, 113471118 edges, 948657 markings/sec, 75 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2686 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (F ((c_cap <= ma)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (c_cap <= ma)))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 14 places; total mentions: 0
lola: closed formula file CircadianClock-PT-100000-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3385024 markings, 11840078 edges, 676992 markings/sec, 0 secs
lola: 6885134 markings, 23885306 edges, 700022 markings/sec, 5 secs
lola: 10300104 markings, 35835734 edges, 682994 markings/sec, 10 secs
lola: 13669160 markings, 47669503 edges, 673811 markings/sec, 15 secs
lola: 16994082 markings, 59476242 edges, 664984 markings/sec, 20 secs
lola: 20327761 markings, 71110939 edges, 666736 markings/sec, 25 secs
lola: 23663120 markings, 82663713 edges, 667072 markings/sec, 30 secs
lola: 26916183 markings, 94164593 edges, 650613 markings/sec, 35 secs
lola: 30239550 markings, 105740307 edges, 664673 markings/sec, 40 secs
lola: 33500336 markings, 117069889 edges, 652157 markings/sec, 45 secs
lola: 36700368 markings, 128340831 edges, 640006 markings/sec, 50 secs
lola: 39915099 markings, 139660193 edges, 642946 markings/sec, 55 secs
lola: 43116506 markings, 150865806 edges, 640281 markings/sec, 60 secs
lola: 46300464 markings, 161801622 edges, 636792 markings/sec, 65 secs
lola: 49351597 markings, 172706140 edges, 610227 markings/sec, 70 secs
lola: 52548399 markings, 183893332 edges, 639360 markings/sec, 75 secs
lola: 55863346 markings, 195364744 edges, 662989 markings/sec, 80 secs
lola: 58900590 markings, 206002868 edges, 607449 markings/sec, 85 secs
lola: 62102592 markings, 217310055 edges, 640400 markings/sec, 90 secs
lola: 65300654 markings, 228339748 edges, 639612 markings/sec, 95 secs
lola: 68153186 markings, 238512402 edges, 570506 markings/sec, 100 secs
lola: 71113694 markings, 248854419 edges, 592102 markings/sec, 105 secs
lola: 74228903 markings, 259730761 edges, 623042 markings/sec, 110 secs
lola: 77189594 markings, 270157988 edges, 592138 markings/sec, 115 secs
lola: 80324451 markings, 281097398 edges, 626971 markings/sec, 120 secs
lola: 83380993 markings, 291823554 edges, 611308 markings/sec, 125 secs
lola: 86500866 markings, 302503029 edges, 623975 markings/sec, 130 secs
lola: 89451160 markings, 312953398 edges, 590059 markings/sec, 135 secs
lola: 92514832 markings, 323758861 edges, 612734 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown unknown unknown yes unknown yes yes unknown unknown no no yes unknown yes unknown unknown
FORMULA CircadianClock-PT-100000-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CircadianClock-PT-100000-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496357357539

--------------------
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="CTLCardinality"
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 CTLCardinality"
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-149441074700606"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;