About the Execution of LoLA for DLCround-PT-06b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10468.270 | 1067471.00 | 1077277.00 | 70.20 | TFFFTTT?TTTF???F | 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 DLCround-PT-06b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-csrt-149580961700264
=====================================================================
--------------------
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 DLCround-PT-06b-CTLCardinality-0
FORMULA_NAME DLCround-PT-06b-CTLCardinality-1
FORMULA_NAME DLCround-PT-06b-CTLCardinality-10
FORMULA_NAME DLCround-PT-06b-CTLCardinality-11
FORMULA_NAME DLCround-PT-06b-CTLCardinality-12
FORMULA_NAME DLCround-PT-06b-CTLCardinality-13
FORMULA_NAME DLCround-PT-06b-CTLCardinality-14
FORMULA_NAME DLCround-PT-06b-CTLCardinality-15
FORMULA_NAME DLCround-PT-06b-CTLCardinality-2
FORMULA_NAME DLCround-PT-06b-CTLCardinality-3
FORMULA_NAME DLCround-PT-06b-CTLCardinality-4
FORMULA_NAME DLCround-PT-06b-CTLCardinality-5
FORMULA_NAME DLCround-PT-06b-CTLCardinality-6
FORMULA_NAME DLCround-PT-06b-CTLCardinality-7
FORMULA_NAME DLCround-PT-06b-CTLCardinality-8
FORMULA_NAME DLCround-PT-06b-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496539004386
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
DLCround-PT-06b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
DLCround-PT-06b: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ DLCround-PT-06b @ 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: 5796/65536 symbol table entries, 557 collisions
lola: preprocessing...
lola: finding significant places
lola: 2340 places, 3456 transitions, 2231 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4716 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-06b-CTLCardinality.task
lola: E (G ((p1399 <= p1373))) : E (F ((3 <= p941))) : E (G ((p1118 <= p1739))) : A (F (NOT(A (F ((1 <= p2189)))))) : NOT(NOT(E (G ((p795 <= 1))))) : A ((A (F ((3 <= p1598))) U A (G ((3 <= p1778))))) : A (((((p1703 <= p898) AND (1 <= p950)) OR (p222 <= 2)) U E (F ((1 <= p1775))))) : A (X (E (F ((2 <= p2249))))) : A (G (E (F ((p1363 <= p1457))))) : ((((p191 + 1 <= p551) OR (2 <= p498)) OR (E (F ((p1429 <= p388))) AND ((p2211 <= 0) AND ((1 <= p542) OR (3 <= p1133))))) OR E (F (((p201 <= p275) AND (2 <= p1584) AND (p1409 + 1 <= p1853))))) : A (G ((p1544 <= p1446))) : A ((((p1075 <= p16) OR (p922 <= p1381) OR (p219 <= 1)) U ((p1712 + 1 <= p274) AND (p2205 <= p409)))) : E (((p378 <= 0) U E (G ((p1378 <= p2091))))) : E (F ((p1498 + 1 <= p674))) : A (X (E (G (((3 <= p1661) OR (p1034 <= p2287)))))) : (NOT((E (F ((1 <= p2309))) AND E (F ((1 <= p787))))) AND E (F (((p198 + 1 <= p1955) AND (p1622 <= 1)))))
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 ((p1399 <= p1373)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p1373 + 1 <= p1399)))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 2340 places; total mentions: 0
lola: closed formula file DLCround-PT-06b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 280 bytes per marking, with 9 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p941)))
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 280 bytes per marking, with 9 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 DLCround-PT-06b-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-06b-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p1118 <= p1739)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p1739 + 1 <= p1118)))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 2340 places; total mentions: 0
lola: closed formula file DLCround-PT-06b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 280 bytes per marking, with 9 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(A (F ((1 <= p2189))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (1 <= p2189))))
lola: processed formula length: 37
lola: 6 rewrites
lola: formula mentions 0 of 2340 places; total mentions: 0
lola: closed formula file DLCround-PT-06b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 280 bytes per marking, with 9 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (G ((p795 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= p795)))
lola: processed formula length: 26
lola: 8 rewrites
lola: formula mentions 0 of 2340 places; total mentions: 0
lola: closed formula file DLCround-PT-06b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 280 bytes per marking, with 9 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((3 <= p1598))) U A (G ((3 <= p1778)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (3 <= p1598)) U NOT(E(TRUE U (p1778 <= 2))))
lola: processed formula length: 55
lola: 4 rewrites
lola: formula mentions 0 of 2340 places; total mentions: 0
lola: closed formula file DLCround-PT-06b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 280 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((((p1703 <= p898) AND (1 <= p950)) OR (p222 <= 2)) U E (F ((1 <= p1775)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((((p1703 <= p898) AND (1 <= p950)) OR (p222 <= 2)) U E(TRUE U (1 <= p1775)))
lola: processed formula length: 79
lola: 2 rewrites
lola: formula mentions 0 of 2340 places; total mentions: 0
lola: closed formula file DLCround-PT-06b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 280 bytes per marking, with 9 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: 514651 markings, 599795 edges, 2951648585491415040 markings/sec, 0 secs
lola: 1015412 markings, 1183843 edges, 100152 markings/sec, 5 secs
lola: 1508059 markings, 1758651 edges, 98529 markings/sec, 10 secs
lola: 2032454 markings, 2372278 edges, 104879 markings/sec, 15 secs
lola: 2596254 markings, 3031829 edges, 112760 markings/sec, 20 secs
lola: 3116815 markings, 3641239 edges, 104112 markings/sec, 25 secs
lola: 3644356 markings, 4257524 edges, 105508 markings/sec, 30 secs
lola: 4175486 markings, 4880114 edges, 106226 markings/sec, 35 secs
lola: 4700395 markings, 5493958 edges, 104982 markings/sec, 40 secs
lola: 5223584 markings, 6108701 edges, 104638 markings/sec, 45 secs
lola: 5757561 markings, 6732113 edges, 106795 markings/sec, 50 secs
lola: 6264149 markings, 7327302 edges, 101318 markings/sec, 55 secs
lola: 6774328 markings, 7923226 edges, 102036 markings/sec, 60 secs
lola: 7290552 markings, 8529568 edges, 103245 markings/sec, 65 secs
lola: 7810993 markings, 9137273 edges, 104088 markings/sec, 70 secs
lola: 8280207 markings, 9686473 edges, 93843 markings/sec, 75 secs
lola: 8761889 markings, 10252116 edges, 96336 markings/sec, 80 secs
lola: 9254952 markings, 10826715 edges, 98613 markings/sec, 85 secs
lola: 9766020 markings, 11427662 edges, 102214 markings/sec, 90 secs
lola: 10241364 markings, 11988426 edges, 95069 markings/sec, 95 secs
lola: 10701817 markings, 12531522 edges, 92091 markings/sec, 100 secs
lola: 11169865 markings, 13079508 edges, 93610 markings/sec, 105 secs
lola: 11614494 markings, 13599096 edges, 88926 markings/sec, 110 secs
lola: 12043475 markings, 14101904 edges, 85796 markings/sec, 115 secs
lola: 12499030 markings, 14641200 edges, 91111 markings/sec, 120 secs
lola: 12938210 markings, 15157393 edges, 87836 markings/sec, 125 secs
lola: 13385709 markings, 15682729 edges, 89500 markings/sec, 130 secs
lola: 13820937 markings, 16192448 edges, 87046 markings/sec, 135 secs
lola: 14268810 markings, 16716019 edges, 89575 markings/sec, 140 secs
lola: 14709725 markings, 17233802 edges, 88183 markings/sec, 145 secs
lola: 15154154 markings, 17755685 edges, 88886 markings/sec, 150 secs
lola: 15598080 markings, 18273433 edges, 88785 markings/sec, 155 secs
lola: 16032580 markings, 18785567 edges, 86900 markings/sec, 160 secs
lola: 16490705 markings, 19322478 edges, 91625 markings/sec, 165 secs
lola: 16919444 markings, 19826393 edges, 85748 markings/sec, 170 secs
lola: 17377907 markings, 20363707 edges, 91693 markings/sec, 175 secs
lola: 17824877 markings, 20888495 edges, 89394 markings/sec, 180 secs
lola: 18299737 markings, 21445799 edges, 94972 markings/sec, 185 secs
lola: 18771012 markings, 21998642 edges, 94255 markings/sec, 190 secs
lola: 19220652 markings, 22528736 edges, 89928 markings/sec, 195 secs
lola: 19659472 markings, 23046396 edges, 87764 markings/sec, 200 secs
lola: 20087929 markings, 23549065 edges, 85691 markings/sec, 205 secs
lola: 20542850 markings, 24081451 edges, 90984 markings/sec, 210 secs
lola: 21016396 markings, 24638173 edges, 94709 markings/sec, 215 secs
lola: 21514320 markings, 25220965 edges, 99585 markings/sec, 220 secs
lola: 21969390 markings, 25756125 edges, 91014 markings/sec, 225 secs
lola: 22452947 markings, 26323210 edges, 96711 markings/sec, 230 secs
lola: 22934257 markings, 26887661 edges, 96262 markings/sec, 235 secs
lola: 23407430 markings, 27443721 edges, 94635 markings/sec, 240 secs
lola: 23853335 markings, 27972261 edges, 89181 markings/sec, 245 secs
lola: 24319786 markings, 28522013 edges, 93290 markings/sec, 250 secs
lola: 24790136 markings, 29069642 edges, 94070 markings/sec, 255 secs
lola: 25242717 markings, 29604649 edges, 90516 markings/sec, 260 secs
lola: 25701166 markings, 30143623 edges, 91690 markings/sec, 265 secs
lola: 26182341 markings, 30713083 edges, 96235 markings/sec, 270 secs
lola: 26662870 markings, 31280421 edges, 96106 markings/sec, 275 secs
lola: 27118945 markings, 31818515 edges, 91215 markings/sec, 280 secs
lola: 27578903 markings, 32357309 edges, 91992 markings/sec, 285 secs
lola: 28040743 markings, 32899503 edges, 92368 markings/sec, 290 secs
lola: 28505973 markings, 33447376 edges, 93046 markings/sec, 295 secs
lola: 28967551 markings, 33993089 edges, 92316 markings/sec, 300 secs
lola: 29415406 markings, 34522786 edges, 89571 markings/sec, 305 secs
lola: 29868878 markings, 35057110 edges, 90694 markings/sec, 310 secs
lola: 30333666 markings, 35603492 edges, 92958 markings/sec, 315 secs
lola: 30802630 markings, 36158326 edges, 93793 markings/sec, 320 secs
lola: 31264776 markings, 36703362 edges, 92429 markings/sec, 325 secs
lola: 31725494 markings, 37248588 edges, 92144 markings/sec, 330 secs
lola: 32173792 markings, 37777056 edges, 89660 markings/sec, 335 secs
lola: 32618803 markings, 38303709 edges, 89002 markings/sec, 340 secs
lola: 33048003 markings, 38811334 edges, 85840 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((2 <= p2249)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (2 <= p2249)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 2340 places; total mentions: 0
lola: closed formula file DLCround-PT-06b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 280 bytes per marking, with 9 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: 447650 markings, 515363 edges, 2750789801329295360 markings/sec, 0 secs
lola: 877513 markings, 1009579 edges, 85973 markings/sec, 5 secs
lola: 1317061 markings, 1511140 edges, 87910 markings/sec, 10 secs
lola: 1753061 markings, 2008753 edges, 87200 markings/sec, 15 secs
lola: 2177853 markings, 2498854 edges, 84958 markings/sec, 20 secs
lola: 2593778 markings, 2972185 edges, 83185 markings/sec, 25 secs
lola: 3025347 markings, 3464333 edges, 86314 markings/sec, 30 secs
lola: 3437032 markings, 3935813 edges, 82337 markings/sec, 35 secs
lola: 3834970 markings, 4402904 edges, 79588 markings/sec, 40 secs
lola: 4243516 markings, 4878105 edges, 81709 markings/sec, 45 secs
lola: 4657185 markings, 5360479 edges, 82734 markings/sec, 50 secs
lola: 5095886 markings, 5860396 edges, 87740 markings/sec, 55 secs
lola: 5535118 markings, 6363146 edges, 87846 markings/sec, 60 secs
lola: 5965931 markings, 6859799 edges, 86163 markings/sec, 65 secs
lola: 6383950 markings, 7341155 edges, 83604 markings/sec, 70 secs
lola: 6828727 markings, 7854221 edges, 88955 markings/sec, 75 secs
lola: 7271128 markings, 8367471 edges, 88480 markings/sec, 80 secs
lola: 7729886 markings, 8889385 edges, 91752 markings/sec, 85 secs
lola: 8176663 markings, 9404092 edges, 89355 markings/sec, 90 secs
lola: 8604635 markings, 9898358 edges, 85594 markings/sec, 95 secs
lola: 9047500 markings, 10413595 edges, 88573 markings/sec, 100 secs
lola: 9489464 markings, 10925035 edges, 88393 markings/sec, 105 secs
lola: 9943551 markings, 11446537 edges, 90817 markings/sec, 110 secs
lola: 10391328 markings, 11957478 edges, 89555 markings/sec, 115 secs
lola: 10828363 markings, 12460632 edges, 87407 markings/sec, 120 secs
lola: 11244367 markings, 12935085 edges, 83201 markings/sec, 125 secs
lola: 11687859 markings, 13447321 edges, 88698 markings/sec, 130 secs
lola: 12137443 markings, 13971963 edges, 89917 markings/sec, 135 secs
lola: 12580553 markings, 14476191 edges, 88622 markings/sec, 140 secs
lola: 12993708 markings, 14954238 edges, 82631 markings/sec, 145 secs
lola: 13443518 markings, 15467373 edges, 89962 markings/sec, 150 secs
lola: 13874304 markings, 15961043 edges, 86157 markings/sec, 155 secs
lola: 14295082 markings, 16443717 edges, 84156 markings/sec, 160 secs
lola: 14713619 markings, 16920285 edges, 83707 markings/sec, 165 secs
lola: 15109784 markings, 17379975 edges, 79233 markings/sec, 170 secs
lola: 15514365 markings, 17846592 edges, 80916 markings/sec, 175 secs
lola: 15927155 markings, 18339784 edges, 82558 markings/sec, 180 secs
lola: 16369604 markings, 18855672 edges, 88490 markings/sec, 185 secs
lola: 16819385 markings, 19367834 edges, 89956 markings/sec, 190 secs
lola: 17257729 markings, 19871574 edges, 87669 markings/sec, 195 secs
lola: 17693604 markings, 20373592 edges, 87175 markings/sec, 200 secs
lola: 18092713 markings, 20835305 edges, 79822 markings/sec, 205 secs
lola: 18493793 markings, 21293459 edges, 80216 markings/sec, 210 secs
lola: 18906587 markings, 21766088 edges, 82559 markings/sec, 215 secs
lola: 19324608 markings, 22243267 edges, 83604 markings/sec, 220 secs
lola: 19741014 markings, 22722181 edges, 83281 markings/sec, 225 secs
lola: 20151862 markings, 23189775 edges, 82170 markings/sec, 230 secs
lola: 20533119 markings, 23624178 edges, 76251 markings/sec, 235 secs
lola: 20949645 markings, 24096452 edges, 83305 markings/sec, 240 secs
lola: 21329665 markings, 24532864 edges, 76004 markings/sec, 245 secs
lola: 21716568 markings, 24982022 edges, 77381 markings/sec, 250 secs
lola: 22083089 markings, 25407846 edges, 73304 markings/sec, 255 secs
lola: 22497796 markings, 25893789 edges, 82941 markings/sec, 260 secs
lola: 22920264 markings, 26383452 edges, 84494 markings/sec, 265 secs
lola: 23356374 markings, 26882957 edges, 87222 markings/sec, 270 secs
lola: 23783532 markings, 27373564 edges, 85432 markings/sec, 275 secs
lola: 24206945 markings, 27856838 edges, 84683 markings/sec, 280 secs
lola: 24619321 markings, 28326940 edges, 82475 markings/sec, 285 secs
lola: 25035869 markings, 28811761 edges, 83310 markings/sec, 290 secs
lola: 25461742 markings, 29307849 edges, 85175 markings/sec, 295 secs
lola: 25887369 markings, 29797884 edges, 85125 markings/sec, 300 secs
lola: 26288692 markings, 30258475 edges, 80265 markings/sec, 305 secs
lola: 26719373 markings, 30747298 edges, 86136 markings/sec, 310 secs
lola: 27143298 markings, 31231874 edges, 84785 markings/sec, 315 secs
lola: 27547967 markings, 31700311 edges, 80934 markings/sec, 320 secs
lola: 27933635 markings, 32136774 edges, 77134 markings/sec, 325 secs
lola: 28331610 markings, 32595052 edges, 79595 markings/sec, 330 secs
lola: 28716137 markings, 33039660 edges, 76905 markings/sec, 335 secs
lola: 29109307 markings, 33493730 edges, 78634 markings/sec, 340 secs
lola: 29461215 markings, 33917751 edges, 70382 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p1363 <= p1457)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (p1363 <= p1457)))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 2340 places; total mentions: 0
lola: closed formula file DLCround-PT-06b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 280 bytes per marking, with 9 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: 305931 markings, 668320 edges, 3096157398730014720 markings/sec, 0 secs
lola: 611630 markings, 1366137 edges, 61140 markings/sec, 5 secs
lola: 927498 markings, 2061527 edges, 63174 markings/sec, 10 secs
lola: 1241715 markings, 2741738 edges, 62843 markings/sec, 15 secs
lola: 1554824 markings, 3420325 edges, 62622 markings/sec, 20 secs
lola: 1863949 markings, 4091592 edges, 61825 markings/sec, 25 secs
lola: 2171162 markings, 4759004 edges, 61443 markings/sec, 30 secs
lola: 2487954 markings, 5445959 edges, 63358 markings/sec, 35 secs
lola: 2791563 markings, 6104005 edges, 60722 markings/sec, 40 secs
lola: 3092427 markings, 6756359 edges, 60173 markings/sec, 45 secs
lola: 3382224 markings, 7385793 edges, 57959 markings/sec, 50 secs
lola: 3696728 markings, 8066226 edges, 62901 markings/sec, 55 secs
lola: 4012809 markings, 8752225 edges, 63216 markings/sec, 60 secs
lola: 4320999 markings, 9421413 edges, 61638 markings/sec, 65 secs
lola: 4628185 markings, 10089708 edges, 61437 markings/sec, 70 secs
lola: 4935730 markings, 10758565 edges, 61509 markings/sec, 75 secs
lola: 5231370 markings, 11399728 edges, 59128 markings/sec, 80 secs
lola: 5527105 markings, 12042928 edges, 59147 markings/sec, 85 secs
lola: 5823620 markings, 12686279 edges, 59303 markings/sec, 90 secs
lola: 6089788 markings, 13307441 edges, 53234 markings/sec, 95 secs
lola: 6364814 markings, 13924778 edges, 55005 markings/sec, 100 secs
lola: 6636715 markings, 14538955 edges, 54380 markings/sec, 105 secs
lola: 6899139 markings, 15136461 edges, 52485 markings/sec, 110 secs
lola: 7157428 markings, 15768588 edges, 51658 markings/sec, 115 secs
lola: 7435108 markings, 16375772 edges, 55536 markings/sec, 120 secs
lola: 7678941 markings, 16992524 edges, 48767 markings/sec, 125 secs
lola: 7953892 markings, 17621456 edges, 54990 markings/sec, 130 secs
lola: 8237919 markings, 18252129 edges, 56805 markings/sec, 135 secs
lola: 8513742 markings, 18870053 edges, 55165 markings/sec, 140 secs
lola: 8796637 markings, 19493741 edges, 56579 markings/sec, 145 secs
lola: 9078974 markings, 20122974 edges, 56467 markings/sec, 150 secs
lola: 9370783 markings, 20791700 edges, 58362 markings/sec, 155 secs
lola: 9669034 markings, 21459862 edges, 59650 markings/sec, 160 secs
lola: 9973847 markings, 22133965 edges, 60963 markings/sec, 165 secs
lola: 10280439 markings, 22798079 edges, 61318 markings/sec, 170 secs
lola: 10528372 markings, 23453319 edges, 49587 markings/sec, 175 secs
lola: 10794766 markings, 24120329 edges, 53279 markings/sec, 180 secs
lola: 11090191 markings, 24781928 edges, 59085 markings/sec, 185 secs
lola: 11370146 markings, 25407068 edges, 55991 markings/sec, 190 secs
lola: 11629336 markings, 26001734 edges, 51838 markings/sec, 195 secs
lola: 11900220 markings, 26636271 edges, 54177 markings/sec, 200 secs
lola: 12178235 markings, 27251088 edges, 55603 markings/sec, 205 secs
lola: 12443411 markings, 27863940 edges, 53035 markings/sec, 210 secs
lola: 12741017 markings, 28506937 edges, 59521 markings/sec, 215 secs
lola: 13042473 markings, 29193612 edges, 60291 markings/sec, 220 secs
lola: 13350657 markings, 29882066 edges, 61637 markings/sec, 225 secs
lola: 13665513 markings, 30569286 edges, 62971 markings/sec, 230 secs
lola: 13964415 markings, 31245781 edges, 59780 markings/sec, 235 secs
lola: 14237070 markings, 31905379 edges, 54531 markings/sec, 240 secs
lola: 14537735 markings, 32560379 edges, 60133 markings/sec, 245 secs
lola: 14847723 markings, 33241873 edges, 61998 markings/sec, 250 secs
lola: 15157220 markings, 33936397 edges, 61899 markings/sec, 255 secs
lola: 15465425 markings, 34615902 edges, 61641 markings/sec, 260 secs
lola: 15771686 markings, 35285634 edges, 61252 markings/sec, 265 secs
lola: 16050516 markings, 35951096 edges, 55766 markings/sec, 270 secs
lola: 16361469 markings, 36636432 edges, 62191 markings/sec, 275 secs
lola: 16686955 markings, 37345559 edges, 65097 markings/sec, 280 secs
lola: 17003197 markings, 38034830 edges, 63248 markings/sec, 285 secs
lola: 17314778 markings, 38733929 edges, 62316 markings/sec, 290 secs
lola: 17622101 markings, 39412196 edges, 61465 markings/sec, 295 secs
lola: 17931693 markings, 40101744 edges, 61918 markings/sec, 300 secs
lola: 18208556 markings, 40765449 edges, 55373 markings/sec, 305 secs
lola: 18526717 markings, 41460888 edges, 63632 markings/sec, 310 secs
lola: 18847084 markings, 42158744 edges, 64073 markings/sec, 315 secs
lola: 19173444 markings, 42868524 edges, 65272 markings/sec, 320 secs
lola: 19482744 markings, 43541658 edges, 61860 markings/sec, 325 secs
lola: 19792878 markings, 44215510 edges, 62027 markings/sec, 330 secs
lola: 20104259 markings, 44892537 edges, 62276 markings/sec, 335 secs
lola: 20410520 markings, 45559712 edges, 61252 markings/sec, 340 secs
lola: 20739743 markings, 46272941 edges, 65845 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p191 + 1 <= p551) OR (2 <= p498)) OR (E (F ((p1429 <= p388))) AND ((p2211 <= 0) AND ((1 <= p542) OR (3 <= p1133))))) OR E (F (((p201 <= p275) AND (2 <= p1584) AND (p1409 + 1 <= p1853)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p191 + 1 <= p551) OR (2 <= p498))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p191 + 1 <= p551) OR (2 <= p498))
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 2340 places; total mentions: 0
lola: closed formula file DLCround-PT-06b-CTLCardinality.task
lola: processed formula with 2 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 10 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1429 <= p388)))
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 280 bytes per marking, with 9 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 11 will run for 495 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p2211 <= 0) AND ((1 <= p542) OR (3 <= p1133)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p2211 <= 0) AND ((1 <= p542) OR (3 <= p1133)))
lola: processed formula length: 49
lola: 1 rewrites
lola: formula mentions 0 of 2340 places; total mentions: 0
lola: closed formula file DLCround-PT-06b-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: ========================================
lola: subprocess 12 will run for 619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p201 <= p275) AND (2 <= p1584) AND (p1409 + 1 <= p1853))))
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 280 bytes per marking, with 9 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-06b-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-06b-CTLCardinality-12.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1544 <= p1446)))
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 280 bytes per marking, with 9 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 DLCround-PT-06b-CTLCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 494 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p1075 <= p16) OR (p922 <= p1381) OR (p219 <= 1)) U ((p1712 + 1 <= p274) AND (p2205 <= p409))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((p1075 <= p16) OR (p922 <= p1381) OR (p219 <= 1)) U ((p1712 + 1 <= p274) AND (p2205 <= p409)))
lola: processed formula length: 99
lola: 1 rewrites
lola: formula mentions 0 of 2340 places; total mentions: 0
lola: closed formula file DLCround-PT-06b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 280 bytes per marking, with 9 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 12 will run for 618 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p378 <= 0) U E (G ((p1378 <= p2091)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p378 <= 0) U NOT(A(TRUE U (p2091 + 1 <= p1378))))
lola: processed formula length: 52
lola: 3 rewrites
lola: formula mentions 0 of 2340 places; total mentions: 0
lola: closed formula file DLCround-PT-06b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 280 bytes per marking, with 9 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 824 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1498 + 1 <= p674)))
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 280 bytes per marking, with 9 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 DLCround-PT-06b-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 1236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((3 <= p1661) OR (p1034 <= p2287))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U ((p1661 <= 2) AND (p2287 + 1 <= p1034)))))
lola: processed formula length: 58
lola: 3 rewrites
lola: formula mentions 0 of 2340 places; total mentions: 0
lola: closed formula file DLCround-PT-06b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 280 bytes per marking, with 9 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 2473 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (F ((1 <= p2309))) AND E (F ((1 <= p787))))) AND E (F (((p198 + 1 <= p1955) AND (p1622 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2473 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2309 <= 0)))
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 280 bytes per marking, with 9 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to DLCround-PT-06b-CTLCardinality-15.sara
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p198 + 1 <= p1955) AND (p1622 <= 1))))
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 280 bytes per marking, with 9 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-06b-CTLCardinality-17.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-06b-CTLCardinality-17.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes yes no unknown unknown unknown no no no yes yes yes unknown
lola: ========================================
FORMULA DLCround-PT-06b-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06b-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06b-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06b-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06b-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06b-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06b-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06b-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06b-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06b-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06b-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06b-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06b-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06b-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06b-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06b-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496540071857
--------------------
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="DLCround-PT-06b"
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/DLCround-PT-06b.tgz
mv DLCround-PT-06b 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 DLCround-PT-06b, 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 r178-csrt-149580961700264"
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 '
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 ;